/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/adfg_2_x_n_indep.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:45:19,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:45:19,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:45:19,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:45:19,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:45:19,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:45:19,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:45:19,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:45:19,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:45:19,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:45:19,991 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:45:19,991 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:45:19,991 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:45:19,991 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:45:19,991 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:45:19,991 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:45:19,991 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:45:19,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:45:19,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:45:19,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:45:19,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:45:19,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:45:19,993 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:45:19,993 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-02-17 22:45:20,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:45:20,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:45:20,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:45:20,239 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:45:20,240 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:45:20,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/adfg_2_x_n_indep.c.bpl [2025-02-17 22:45:20,244 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/adfg_2_x_n_indep.c.bpl' [2025-02-17 22:45:20,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:45:20,260 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:45:20,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:20,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:45:20,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:45:20,268 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 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,273 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 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,278 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:45:20,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:20,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:45:20,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:45:20,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:45:20,285 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 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,285 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 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,286 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 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,286 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 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,287 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 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,288 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 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,291 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 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,292 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 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,292 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 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:45:20,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:45:20,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:45:20,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:45:20,294 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 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:20,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:20,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:20,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:45:20,348 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:45:20,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:45:20,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:45:20,348 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:45:20,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:45:20,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:45:20,348 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:45:20,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:45:20,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:45:20,349 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:45:20,385 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:45:20,387 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:45:20,447 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:45:20,447 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:45:20,454 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:45:20,454 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:45:20,454 INFO L201 PluginConnector]: Adding new model adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:20 BoogieIcfgContainer [2025-02-17 22:45:20,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:45:20,455 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:45:20,455 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:45:20,459 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:45:20,459 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:20,459 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 17.02 10:45:20" (1/2) ... [2025-02-17 22:45:20,460 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fa68942 and model type adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:45:20, skipping insertion in model container [2025-02-17 22:45:20,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:20,460 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 17.02 10:45:20" (2/2) ... [2025-02-17 22:45:20,461 INFO L363 chiAutomizerObserver]: Analyzing ICFG adfg_2_x_n_indep.c.bpl [2025-02-17 22:45:20,526 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:45:20,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 31 transitions, 76 flow [2025-02-17 22:45:20,584 INFO L124 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-02-17 22:45:20,586 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:45:20,589 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-02-17 22:45:20,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 31 transitions, 76 flow [2025-02-17 22:45:20,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 27 transitions, 66 flow [2025-02-17 22:45:20,602 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:45:20,603 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:45:20,603 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:45:20,603 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:45:20,603 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:45:20,603 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:45:20,603 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:45:20,603 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:45:20,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-02-17 22:45:20,638 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 64 [2025-02-17 22:45:20,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:20,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:20,642 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:45:20,642 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:20,642 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:45:20,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 101 states, but on-demand construction may add more states [2025-02-17 22:45:20,646 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 64 [2025-02-17 22:45:20,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:20,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:20,646 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:45:20,646 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:20,650 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-02-17 22:45:20,651 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-02-17 22:45:20,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash 128325, now seen corresponding path program 1 times [2025-02-17 22:45:20,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:20,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444141218] [2025-02-17 22:45:20,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:20,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:20,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:20,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,706 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:20,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:20,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:20,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:20,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash 110322, now seen corresponding path program 1 times [2025-02-17 22:45:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:20,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115576656] [2025-02-17 22:45:20,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:20,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:20,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:20,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:20,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,738 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:20,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:20,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:20,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:20,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:20,747 INFO L85 PathProgramCache]: Analyzing trace with hash -471956690, now seen corresponding path program 1 times [2025-02-17 22:45:20,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:20,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484898350] [2025-02-17 22:45:20,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:20,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:20,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:20,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:20,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:20,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:45:20,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484898350] [2025-02-17 22:45:20,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484898350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:45:20,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:45:20,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:45:20,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801442396] [2025-02-17 22:45:20,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:45:20,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:45:20,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:45:20,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:45:20,901 INFO L87 Difference]: Start difference. First operand currently 101 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:45:20,956 INFO L93 Difference]: Finished difference Result 155 states and 337 transitions. [2025-02-17 22:45:20,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 337 transitions. [2025-02-17 22:45:20,963 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 90 [2025-02-17 22:45:20,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 139 states and 309 transitions. [2025-02-17 22:45:20,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2025-02-17 22:45:20,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2025-02-17 22:45:20,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 309 transitions. [2025-02-17 22:45:20,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:45:20,976 INFO L218 hiAutomatonCegarLoop]: Abstraction has 139 states and 309 transitions. [2025-02-17 22:45:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 309 transitions. [2025-02-17 22:45:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-17 22:45:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 2.223021582733813) internal successors, (309), 138 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 309 transitions. [2025-02-17 22:45:21,028 INFO L240 hiAutomatonCegarLoop]: Abstraction has 139 states and 309 transitions. [2025-02-17 22:45:21,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:45:21,031 INFO L432 stractBuchiCegarLoop]: Abstraction has 139 states and 309 transitions. [2025-02-17 22:45:21,031 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:45:21,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 309 transitions. [2025-02-17 22:45:21,032 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 90 [2025-02-17 22:45:21,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:21,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:21,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:45:21,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:21,034 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-02-17 22:45:21,034 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-02-17 22:45:21,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,034 INFO L85 PathProgramCache]: Analyzing trace with hash 128325, now seen corresponding path program 2 times [2025-02-17 22:45:21,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:21,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598796155] [2025-02-17 22:45:21,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:21,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:21,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:21,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:21,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:45:21,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,039 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:21,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:21,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:21,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:21,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,041 INFO L85 PathProgramCache]: Analyzing trace with hash 110290, now seen corresponding path program 1 times [2025-02-17 22:45:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:21,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169346711] [2025-02-17 22:45:21,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:21,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:21,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:21,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:21,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:21,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:21,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:21,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash -471956722, now seen corresponding path program 1 times [2025-02-17 22:45:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:21,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652817088] [2025-02-17 22:45:21,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:21,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:21,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:21,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:21,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:21,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:21,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:21,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:21,144 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:21,145 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:21,145 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:21,145 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:21,145 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:21,145 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,146 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:21,146 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:21,146 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration2_Lasso [2025-02-17 22:45:21,146 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:21,146 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:21,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,253 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:21,254 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:21,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:21,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:45:21,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:21,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:21,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:45:21,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,284 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:21,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-17 22:45:21,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:21,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:21,440 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:21,445 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-02-17 22:45:21,446 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:21,446 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:21,446 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:21,446 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:21,446 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:21,446 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,446 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:21,446 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:21,446 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration2_Lasso [2025-02-17 22:45:21,446 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:21,446 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:21,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,498 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:21,501 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:21,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,503 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:21,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-17 22:45:21,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:21,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:21,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:21,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:21,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:21,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:21,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:21,536 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:21,542 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:21,542 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:21,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:21,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-17 22:45:21,549 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:21,560 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:45:21,561 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:21,561 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1, x1) = 2*n1 - 2*x1 + 1 Supporting invariants [1*t - 1 >= 0] [2025-02-17 22:45:21,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-17 22:45:21,573 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:45:21,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:21,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:21,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:21,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:45:21,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:21,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:21,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:21,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:21,625 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:21,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:21,667 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:21,668 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 309 transitions. cyclomatic complexity: 196 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:21,753 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 309 transitions. cyclomatic complexity: 196. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 302 states and 690 transitions. Complement of second has 7 states. [2025-02-17 22:45:21,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-02-17 22:45:21,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 3 letters. Loop has 3 letters. [2025-02-17 22:45:21,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-17 22:45:21,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-17 22:45:21,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 302 states and 690 transitions. [2025-02-17 22:45:21,764 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 132 [2025-02-17 22:45:21,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 302 states to 255 states and 578 transitions. [2025-02-17 22:45:21,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 204 [2025-02-17 22:45:21,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2025-02-17 22:45:21,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 578 transitions. [2025-02-17 22:45:21,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:21,771 INFO L218 hiAutomatonCegarLoop]: Abstraction has 255 states and 578 transitions. [2025-02-17 22:45:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 578 transitions. [2025-02-17 22:45:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 193. [2025-02-17 22:45:21,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 193 states have (on average 2.3626943005181347) internal successors, (456), 192 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 456 transitions. [2025-02-17 22:45:21,782 INFO L240 hiAutomatonCegarLoop]: Abstraction has 193 states and 456 transitions. [2025-02-17 22:45:21,782 INFO L432 stractBuchiCegarLoop]: Abstraction has 193 states and 456 transitions. [2025-02-17 22:45:21,782 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:45:21,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 456 transitions. [2025-02-17 22:45:21,785 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 99 [2025-02-17 22:45:21,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:21,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:21,785 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:45:21,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:21,785 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-02-17 22:45:21,786 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-02-17 22:45:21,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,786 INFO L85 PathProgramCache]: Analyzing trace with hash 128357, now seen corresponding path program 1 times [2025-02-17 22:45:21,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:21,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366681110] [2025-02-17 22:45:21,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:21,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:21,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:21,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:21,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:21,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:21,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:21,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:21,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,793 INFO L85 PathProgramCache]: Analyzing trace with hash 110322, now seen corresponding path program 2 times [2025-02-17 22:45:21,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:21,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691388242] [2025-02-17 22:45:21,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:21,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:21,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:21,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:21,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:45:21,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:21,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:21,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:21,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:21,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,805 INFO L85 PathProgramCache]: Analyzing trace with hash -471003378, now seen corresponding path program 1 times [2025-02-17 22:45:21,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:21,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203074003] [2025-02-17 22:45:21,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:21,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:21,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:21,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:21,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:21,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:21,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:21,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:21,855 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:21,855 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:21,855 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:21,855 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:21,855 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:21,855 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,855 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:21,855 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:21,855 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration3_Lasso [2025-02-17 22:45:21,855 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:21,855 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:21,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,901 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:21,901 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:21,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:21,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-17 22:45:21,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:21,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:21,918 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:21,918 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:21,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:21,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,926 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:21,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-17 22:45:21,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:21,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:21,945 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:21,945 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:21,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:45:21,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,952 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:21,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-17 22:45:21,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:21,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:21,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:45:21,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,971 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:21,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-17 22:45:21,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:21,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:22,090 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:22,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-17 22:45:22,096 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:22,096 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:22,096 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:22,096 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:22,096 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:22,096 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,096 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:22,096 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:22,096 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration3_Lasso [2025-02-17 22:45:22,096 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:22,096 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:22,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:22,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:22,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:22,147 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:22,147 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:22,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:22,151 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:22,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-17 22:45:22,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:22,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:22,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:22,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:22,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:22,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:22,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:22,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:22,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:22,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:22,181 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:22,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-17 22:45:22,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:22,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:22,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:22,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:22,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:22,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:22,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:22,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:22,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:22,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:22,214 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:22,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-17 22:45:22,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:22,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:22,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:22,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:22,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:22,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:22,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:22,239 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:22,247 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:45:22,247 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:22,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:22,256 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:22,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-17 22:45:22,258 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:22,268 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:45:22,268 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:22,268 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1, x1) = 2*n1 - 2*x1 + 1 Supporting invariants [-1*t - 1 >= 0] [2025-02-17 22:45:22,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:45:22,278 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:45:22,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:22,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:22,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:22,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:22,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:22,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:45:22,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:22,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:22,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:22,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:22,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:22,316 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:22,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:22,345 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:22,345 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 456 transitions. cyclomatic complexity: 298 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:22,424 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 456 transitions. cyclomatic complexity: 298. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 412 states and 1000 transitions. Complement of second has 7 states. [2025-02-17 22:45:22,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-02-17 22:45:22,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 3 letters. Loop has 3 letters. [2025-02-17 22:45:22,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:22,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-17 22:45:22,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:22,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-17 22:45:22,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:22,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 412 states and 1000 transitions. [2025-02-17 22:45:22,436 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 129 [2025-02-17 22:45:22,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 412 states to 357 states and 843 transitions. [2025-02-17 22:45:22,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 247 [2025-02-17 22:45:22,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2025-02-17 22:45:22,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 357 states and 843 transitions. [2025-02-17 22:45:22,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:22,444 INFO L218 hiAutomatonCegarLoop]: Abstraction has 357 states and 843 transitions. [2025-02-17 22:45:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states and 843 transitions. [2025-02-17 22:45:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 232. [2025-02-17 22:45:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 232 states have (on average 2.4698275862068964) internal successors, (573), 231 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 573 transitions. [2025-02-17 22:45:22,456 INFO L240 hiAutomatonCegarLoop]: Abstraction has 232 states and 573 transitions. [2025-02-17 22:45:22,456 INFO L432 stractBuchiCegarLoop]: Abstraction has 232 states and 573 transitions. [2025-02-17 22:45:22,456 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:45:22,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 573 transitions. [2025-02-17 22:45:22,458 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 87 [2025-02-17 22:45:22,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:22,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:22,459 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:45:22,459 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:22,459 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]" "[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-02-17 22:45:22,459 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-02-17 22:45:22,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash 4004390, now seen corresponding path program 1 times [2025-02-17 22:45:22,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:22,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432632838] [2025-02-17 22:45:22,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:22,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:22,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:22,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:22,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:22,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:22,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:22,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:22,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:22,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:22,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:22,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:22,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:22,466 INFO L85 PathProgramCache]: Analyzing trace with hash 121213, now seen corresponding path program 1 times [2025-02-17 22:45:22,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:22,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935468968] [2025-02-17 22:45:22,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:22,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:22,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:22,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:22,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:22,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:22,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:22,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:22,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:22,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:22,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:22,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:22,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:22,483 INFO L85 PathProgramCache]: Analyzing trace with hash -964210376, now seen corresponding path program 1 times [2025-02-17 22:45:22,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:22,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445998719] [2025-02-17 22:45:22,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:22,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:45:22,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:45:22,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:45:22,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:45:22,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:22,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:22,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:22,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:45:22,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:45:22,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:22,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:22,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:22,547 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:22,547 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:22,547 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:22,547 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:22,547 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:22,547 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,548 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:22,548 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:22,548 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration4_Lasso [2025-02-17 22:45:22,548 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:22,548 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:22,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:22,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:22,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:22,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:22,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:22,609 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:22,610 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:22,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:22,612 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:22,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-17 22:45:22,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:22,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:22,638 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:22,638 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar0=0} Honda state: {thread2Thread1of1ForFork1_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:22,644 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-02-17 22:45:22,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:22,646 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:22,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-17 22:45:22,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:22,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:22,663 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:22,663 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=1} Honda state: {b=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:22,668 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-02-17 22:45:22,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:22,670 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:22,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-17 22:45:22,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:22,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:22,682 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:22,682 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:22,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-17 22:45:22,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:22,689 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:22,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-17 22:45:22,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:22,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:22,706 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-02-17 22:45:22,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:22,708 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:22,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-17 22:45:22,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:22,710 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:22,857 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:22,863 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-02-17 22:45:22,863 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:22,863 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:22,863 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:22,863 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:22,863 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:22,863 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,863 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:22,863 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:22,863 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration4_Lasso [2025-02-17 22:45:22,863 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:22,863 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:22,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:22,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:22,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:22,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:22,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:22,918 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:22,918 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:22,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:22,920 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:22,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-17 22:45:22,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:22,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:22,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:22,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:22,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:22,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:22,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:22,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:22,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:22,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:22,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:22,982 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:22,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-17 22:45:22,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:22,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:22,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:22,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:22,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:22,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:22,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:22,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:23,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-17 22:45:23,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:23,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:23,004 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:23,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-17 22:45:23,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:23,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:23,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:23,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:23,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:23,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:23,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:23,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:23,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:45:23,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:23,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:23,029 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:23,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-17 22:45:23,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:23,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:23,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:23,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:23,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:23,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:23,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:23,053 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:23,059 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:45:23,059 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:23,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:23,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:23,062 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:23,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-17 22:45:23,065 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:23,076 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:45:23,076 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:23,076 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n2, x2) = 2*n2 - 2*x2 + 1 Supporting invariants [1*t - 1 >= 0] [2025-02-17 22:45:23,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-17 22:45:23,084 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:45:23,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:23,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:23,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:23,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:23,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:23,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:45:23,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:23,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:23,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:23,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:23,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:23,121 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:23,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:23,148 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:23,148 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 232 states and 573 transitions. cyclomatic complexity: 381 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:23,205 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 232 states and 573 transitions. cyclomatic complexity: 381. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 451 states and 1119 transitions. Complement of second has 7 states. [2025-02-17 22:45:23,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-02-17 22:45:23,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 4 letters. Loop has 3 letters. [2025-02-17 22:45:23,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:23,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 7 letters. Loop has 3 letters. [2025-02-17 22:45:23,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:23,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 4 letters. Loop has 6 letters. [2025-02-17 22:45:23,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:23,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 451 states and 1119 transitions. [2025-02-17 22:45:23,211 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 123 [2025-02-17 22:45:23,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 451 states to 275 states and 659 transitions. [2025-02-17 22:45:23,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2025-02-17 22:45:23,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2025-02-17 22:45:23,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 659 transitions. [2025-02-17 22:45:23,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:23,214 INFO L218 hiAutomatonCegarLoop]: Abstraction has 275 states and 659 transitions. [2025-02-17 22:45:23,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 659 transitions. [2025-02-17 22:45:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 231. [2025-02-17 22:45:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 231 states have (on average 2.4718614718614718) internal successors, (571), 230 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 571 transitions. [2025-02-17 22:45:23,226 INFO L240 hiAutomatonCegarLoop]: Abstraction has 231 states and 571 transitions. [2025-02-17 22:45:23,226 INFO L432 stractBuchiCegarLoop]: Abstraction has 231 states and 571 transitions. [2025-02-17 22:45:23,226 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:45:23,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 571 transitions. [2025-02-17 22:45:23,227 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 93 [2025-02-17 22:45:23,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:23,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:23,227 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:45:23,227 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:23,228 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]" "[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-02-17 22:45:23,228 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-02-17 22:45:23,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:23,228 INFO L85 PathProgramCache]: Analyzing trace with hash 4004422, now seen corresponding path program 1 times [2025-02-17 22:45:23,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:23,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784135777] [2025-02-17 22:45:23,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:23,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:23,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:23,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:23,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:23,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:23,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:23,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:23,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:23,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:23,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:23,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:23,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash 121245, now seen corresponding path program 1 times [2025-02-17 22:45:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:23,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11287245] [2025-02-17 22:45:23,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:23,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:23,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:23,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:23,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:23,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:23,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:23,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:23,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:23,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:23,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:23,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:23,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:23,239 INFO L85 PathProgramCache]: Analyzing trace with hash -963257032, now seen corresponding path program 1 times [2025-02-17 22:45:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:23,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022717245] [2025-02-17 22:45:23,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:23,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:23,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:45:23,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:45:23,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:23,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:23,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:23,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:45:23,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:45:23,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:23,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:23,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:23,284 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:23,284 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:23,284 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:23,284 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:23,284 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:23,284 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:23,284 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:23,284 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:23,284 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration5_Lasso [2025-02-17 22:45:23,284 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:23,284 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:23,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:23,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:23,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:23,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:23,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:23,336 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:23,336 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:23,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:23,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:23,338 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:23,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-17 22:45:23,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:23,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:23,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-17 22:45:23,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:23,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:23,360 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:23,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-17 22:45:23,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:23,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:23,482 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:23,487 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-02-17 22:45:23,488 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:23,488 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:23,488 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:23,488 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:23,488 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:23,488 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:23,488 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:23,488 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:23,488 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration5_Lasso [2025-02-17 22:45:23,488 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:23,488 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:23,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:23,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:23,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:23,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:23,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:23,548 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:23,548 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:23,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:23,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:23,550 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:23,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:23,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-17 22:45:23,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:23,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:23,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:23,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:23,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:23,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:23,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:23,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-17 22:45:23,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:23,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:23,572 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:23,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-17 22:45:23,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:23,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:23,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:23,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:23,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:23,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:23,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:23,589 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:23,592 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:23,592 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:23,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:23,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:23,594 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:23,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-17 22:45:23,595 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:23,606 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:45:23,606 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:23,606 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n2, t, x2) = 2*n2 - 1*t - 2*x2 Supporting invariants [-1*t - 1 >= 0] [2025-02-17 22:45:23,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-17 22:45:23,613 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:45:23,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:23,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:23,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:23,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:23,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:23,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:45:23,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:23,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:23,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:23,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:23,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:23,651 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:23,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:23,680 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:23,680 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 231 states and 571 transitions. cyclomatic complexity: 382 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:23,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:23,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:23,746 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 231 states and 571 transitions. cyclomatic complexity: 382. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 502 states and 1270 transitions. Complement of second has 8 states. [2025-02-17 22:45:23,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-17 22:45:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-02-17 22:45:23,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 4 letters. Loop has 3 letters. [2025-02-17 22:45:23,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:23,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 7 letters. Loop has 3 letters. [2025-02-17 22:45:23,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:23,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 4 letters. Loop has 6 letters. [2025-02-17 22:45:23,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:23,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 502 states and 1270 transitions. [2025-02-17 22:45:23,751 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 108 [2025-02-17 22:45:23,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 502 states to 439 states and 1079 transitions. [2025-02-17 22:45:23,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2025-02-17 22:45:23,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 280 [2025-02-17 22:45:23,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 439 states and 1079 transitions. [2025-02-17 22:45:23,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:23,755 INFO L218 hiAutomatonCegarLoop]: Abstraction has 439 states and 1079 transitions. [2025-02-17 22:45:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states and 1079 transitions. [2025-02-17 22:45:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 300. [2025-02-17 22:45:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 300 states have (on average 2.546666666666667) internal successors, (764), 299 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 764 transitions. [2025-02-17 22:45:23,763 INFO L240 hiAutomatonCegarLoop]: Abstraction has 300 states and 764 transitions. [2025-02-17 22:45:23,763 INFO L432 stractBuchiCegarLoop]: Abstraction has 300 states and 764 transitions. [2025-02-17 22:45:23,763 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:45:23,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 764 transitions. [2025-02-17 22:45:23,765 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 69 [2025-02-17 22:45:23,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:23,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:23,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:23,766 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:23,766 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]" "[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]" "[77] $Ultimate##0-->L29: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[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-02-17 22:45:23,766 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-02-17 22:45:23,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:23,767 INFO L85 PathProgramCache]: Analyzing trace with hash 124126497, now seen corresponding path program 1 times [2025-02-17 22:45:23,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:23,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735802393] [2025-02-17 22:45:23,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:23,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:23,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:23,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:23,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:23,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:45:23,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735802393] [2025-02-17 22:45:23,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735802393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:45:23,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:45:23,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:45:23,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490041267] [2025-02-17 22:45:23,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:45:23,788 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:45:23,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:23,789 INFO L85 PathProgramCache]: Analyzing trace with hash 110290, now seen corresponding path program 2 times [2025-02-17 22:45:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:23,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31137408] [2025-02-17 22:45:23,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:23,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:23,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:23,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:45:23,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:23,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:23,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:23,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:23,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:23,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:23,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:23,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:45:23,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:45:23,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:45:23,812 INFO L87 Difference]: Start difference. First operand 300 states and 764 transitions. cyclomatic complexity: 511 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:45:23,825 INFO L93 Difference]: Finished difference Result 161 states and 405 transitions. [2025-02-17 22:45:23,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 405 transitions. [2025-02-17 22:45:23,826 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:23,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 0 states and 0 transitions. [2025-02-17 22:45:23,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:45:23,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:45:23,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:45:23,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:45:23,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:23,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:23,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:45:23,827 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:23,827 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:45:23,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:45:23,827 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:23,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:45:23,832 INFO L201 PluginConnector]: Adding new model adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:45:23 BoogieIcfgContainer [2025-02-17 22:45:23,832 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:45:23,832 INFO L158 Benchmark]: Toolchain (without parser) took 3572.10ms. Allocated memory was 163.6MB in the beginning and 125.8MB in the end (delta: -37.7MB). Free memory was 90.9MB in the beginning and 74.5MB in the end (delta: 16.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:23,833 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.76ms. Allocated memory is still 163.6MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:23,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.94ms. Allocated memory is still 163.6MB. Free memory was 90.8MB in the beginning and 89.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:23,833 INFO L158 Benchmark]: Boogie Preprocessor took 13.26ms. Allocated memory is still 163.6MB. Free memory was 89.6MB in the beginning and 88.9MB in the end (delta: 686.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:23,833 INFO L158 Benchmark]: RCFGBuilder took 161.28ms. Allocated memory is still 163.6MB. Free memory was 88.9MB in the beginning and 78.9MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-02-17 22:45:23,833 INFO L158 Benchmark]: BuchiAutomizer took 3376.86ms. Allocated memory was 163.6MB in the beginning and 125.8MB in the end (delta: -37.7MB). Free memory was 78.8MB in the beginning and 74.5MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:23,834 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.76ms. Allocated memory is still 163.6MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.94ms. Allocated memory is still 163.6MB. Free memory was 90.8MB in the beginning and 89.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 13.26ms. Allocated memory is still 163.6MB. Free memory was 89.6MB in the beginning and 88.9MB in the end (delta: 686.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 161.28ms. Allocated memory is still 163.6MB. Free memory was 88.9MB in the beginning and 78.9MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3376.86ms. Allocated memory was 163.6MB in the beginning and 125.8MB in the end (delta: -37.7MB). Free memory was 78.8MB in the beginning and 74.5MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 -1 * t + 2 * n2 + -2 * x2 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 370 StatesRemovedByMinimization, 4 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, 224 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 224 mSDsluCounter, 307 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 154 IncrementalHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 195 mSDtfsCounter, 154 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: 59ms 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.0s InitialAbstraction: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:45:23,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...