/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/adfg_2_x_n_b_t_indep.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:34,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:34,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:48:34,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:34,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:34,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:34,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:34,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:34,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:34,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:34,291 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:34,291 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:34,291 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:34,291 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:34,291 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:34,291 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:34,291 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:34,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:34,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:34,291 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:34,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:34,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:34,294 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:48:34,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:34,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:34,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:34,533 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:34,534 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:34,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/adfg_2_x_n_b_t_indep.c.bpl [2025-02-17 22:48:34,536 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/adfg_2_x_n_b_t_indep.c.bpl' [2025-02-17 22:48:34,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:34,550 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:34,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:34,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:34,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:34,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,566 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:34,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:34,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:34,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:34,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:34,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:34,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:34,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:34,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:34,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:34,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:34,606 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:34,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:48:34,631 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:34,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:34,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:34,631 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:34,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:34,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:34,631 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:34,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:34,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:34,632 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:48:34,666 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:34,667 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:34,726 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:34,726 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:34,733 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:34,733 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:34,733 INFO L201 PluginConnector]: Adding new model adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:34 BoogieIcfgContainer [2025-02-17 22:48:34,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:34,734 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:34,734 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:34,738 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:34,738 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:34,738 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/2) ... [2025-02-17 22:48:34,740 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52b3d35b and model type adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:34, skipping insertion in model container [2025-02-17 22:48:34,740 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:34,740 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:34" (2/2) ... [2025-02-17 22:48:34,741 INFO L363 chiAutomizerObserver]: Analyzing ICFG adfg_2_x_n_b_t_indep.c.bpl [2025-02-17 22:48:34,782 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:48:34,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 31 transitions, 76 flow [2025-02-17 22:48:34,854 INFO L124 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-02-17 22:48:34,857 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:48:34,861 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 6. Compared 53 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:48:34,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 31 transitions, 76 flow [2025-02-17 22:48:34,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 27 transitions, 66 flow [2025-02-17 22:48:34,869 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:34,946 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:34,946 INFO L101 AmpleReduction]: Number of pruned transitions: 31, Number of non-trivial ample sets: 48 [2025-02-17 22:48:34,946 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 54 [2025-02-17 22:48:34,951 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:34,951 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:34,951 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:34,952 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:34,952 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:34,952 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:34,952 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:34,952 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:34,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 69 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 68 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:34,964 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 48 [2025-02-17 22:48:34,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:34,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:34,967 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:34,967 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:34,967 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:34,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 69 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 68 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:34,970 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 48 [2025-02-17 22:48:34,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:34,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:34,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:34,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:34,973 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-->L27: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[78] L27-->L35-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" [2025-02-17 22:48:34,974 INFO L754 eck$LassoCheckResult]: Loop: "[81] L35-2-->L35: 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] L35-->L37: Formula: (<= 1 v_b1_4) InVars {b1=v_b1_4} OutVars{b1=v_b1_4} AuxVars[] AssignedVars[]" "[85] L37-->L35-2: Formula: (= v_x1_5 (+ v_x1_6 v_t1_4)) InVars {t1=v_t1_4, x1=v_x1_6} OutVars{t1=v_t1_4, x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-02-17 22:48:34,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:34,977 INFO L85 PathProgramCache]: Analyzing trace with hash 128325, now seen corresponding path program 1 times [2025-02-17 22:48:34,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:34,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841962630] [2025-02-17 22:48:34,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:34,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,034 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,056 INFO L85 PathProgramCache]: Analyzing trace with hash 110290, now seen corresponding path program 1 times [2025-02-17 22:48:35,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041045288] [2025-02-17 22:48:35,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash -471956722, now seen corresponding path program 1 times [2025-02-17 22:48:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576449063] [2025-02-17 22:48:35,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:35,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:35,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:35,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:35,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,167 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:35,167 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:35,168 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:35,168 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:35,168 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:35,168 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,168 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:35,169 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:35,169 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_b_t_indep.c.bpl_petrified1_Iteration1_Lasso [2025-02-17 22:48:35,169 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:35,170 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:35,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,248 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:35,250 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:35,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,253 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:35,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:48:35,258 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:35,258 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:35,280 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:48:35,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:35,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:48:35,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:35,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:35,433 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:35,439 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:48:35,440 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:35,440 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:35,440 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:35,440 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:35,440 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:35,440 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,440 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:35,440 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:35,440 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_b_t_indep.c.bpl_petrified1_Iteration1_Lasso [2025-02-17 22:48:35,440 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:35,440 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:35,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,537 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:35,542 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:35,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:35,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-17 22:48:35,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:35,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:35,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:35,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:35,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:35,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:35,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:35,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:35,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:35,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:35,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-17 22:48:35,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:35,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:35,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:35,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:35,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:35,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:35,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:35,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:35,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:35,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,611 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:35,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-17 22:48:35,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:35,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:35,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:35,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:35,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:35,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:35,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:35,634 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:35,640 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:35,640 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:35,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,644 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:35,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-17 22:48:35,645 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:35,657 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:35,657 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:35,658 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1, x1, t1) = 2*n1 - 2*x1 + 1*t1 Supporting invariants [1*t1 - 1 >= 0] [2025-02-17 22:48:35,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:48:35,669 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:35,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:35,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:48:35,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:35,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:35,733 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:35,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:35,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:35,833 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:35,834 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 69 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 68 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:35,963 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 69 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 68 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 273 states and 514 transitions. Complement of second has 7 states. [2025-02-17 22:48:35,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:35,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-02-17 22:48:35,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 3 letters. Loop has 3 letters. [2025-02-17 22:48:35,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:35,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-17 22:48:35,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:35,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-17 22:48:35,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:35,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 514 transitions. [2025-02-17 22:48:35,990 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 112 [2025-02-17 22:48:35,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 209 states and 400 transitions. [2025-02-17 22:48:35,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2025-02-17 22:48:35,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2025-02-17 22:48:35,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 400 transitions. [2025-02-17 22:48:35,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:35,999 INFO L218 hiAutomatonCegarLoop]: Abstraction has 209 states and 400 transitions. [2025-02-17 22:48:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 400 transitions. [2025-02-17 22:48:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 113. [2025-02-17 22:48:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 2.0088495575221237) internal successors, (227), 112 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 227 transitions. [2025-02-17 22:48:36,026 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 227 transitions. [2025-02-17 22:48:36,026 INFO L432 stractBuchiCegarLoop]: Abstraction has 113 states and 227 transitions. [2025-02-17 22:48:36,026 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:36,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 227 transitions. [2025-02-17 22:48:36,029 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 52 [2025-02-17 22:48:36,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:36,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:36,030 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:36,030 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:36,030 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-->L31: Formula: (< v_b1_3 1) InVars {b1=v_b1_3} OutVars{b1=v_b1_3} AuxVars[] AssignedVars[]" "[79] L31-->L35-2: Formula: (= (+ v_t1_3 1) 0) InVars {} OutVars{t1=v_t1_3} AuxVars[] AssignedVars[t1]" [2025-02-17 22:48:36,030 INFO L754 eck$LassoCheckResult]: Loop: "[81] L35-2-->L35: 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] L35-->L37: Formula: (<= 1 v_b1_4) InVars {b1=v_b1_4} OutVars{b1=v_b1_4} AuxVars[] AssignedVars[]" "[85] L37-->L35-2: Formula: (= v_x1_5 (+ v_x1_6 v_t1_4)) InVars {t1=v_t1_4, x1=v_x1_6} OutVars{t1=v_t1_4, x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-02-17 22:48:36,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,032 INFO L85 PathProgramCache]: Analyzing trace with hash 128357, now seen corresponding path program 1 times [2025-02-17 22:48:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42733540] [2025-02-17 22:48:36,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,037 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,043 INFO L85 PathProgramCache]: Analyzing trace with hash 110290, now seen corresponding path program 2 times [2025-02-17 22:48:36,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405701223] [2025-02-17 22:48:36,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:36,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:36,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,049 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,052 INFO L85 PathProgramCache]: Analyzing trace with hash -471003410, now seen corresponding path program 1 times [2025-02-17 22:48:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584848454] [2025-02-17 22:48:36,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:36,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:36,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:36,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584848454] [2025-02-17 22:48:36,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584848454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:36,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:36,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:48:36,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154225593] [2025-02-17 22:48:36,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:36,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:36,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:48:36,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:48:36,117 INFO L87 Difference]: Start difference. First operand 113 states and 227 transitions. cyclomatic complexity: 130 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:36,134 INFO L93 Difference]: Finished difference Result 122 states and 227 transitions. [2025-02-17 22:48:36,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 227 transitions. [2025-02-17 22:48:36,138 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 55 [2025-02-17 22:48:36,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 122 states and 227 transitions. [2025-02-17 22:48:36,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2025-02-17 22:48:36,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2025-02-17 22:48:36,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 227 transitions. [2025-02-17 22:48:36,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:36,141 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 227 transitions. [2025-02-17 22:48:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 227 transitions. [2025-02-17 22:48:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2025-02-17 22:48:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.94) internal successors, (194), 99 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 194 transitions. [2025-02-17 22:48:36,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 194 transitions. [2025-02-17 22:48:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:48:36,150 INFO L432 stractBuchiCegarLoop]: Abstraction has 100 states and 194 transitions. [2025-02-17 22:48:36,150 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:48:36,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 194 transitions. [2025-02-17 22:48:36,151 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 43 [2025-02-17 22:48:36,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:36,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:36,152 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:36,152 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:36,152 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-->L31: Formula: (< v_b1_3 1) InVars {b1=v_b1_3} OutVars{b1=v_b1_3} AuxVars[] AssignedVars[]" "[79] L31-->L35-2: Formula: (= (+ v_t1_3 1) 0) InVars {} OutVars{t1=v_t1_3} AuxVars[] AssignedVars[t1]" [2025-02-17 22:48:36,152 INFO L754 eck$LassoCheckResult]: Loop: "[81] L35-2-->L35: 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] L35-->L41: Formula: (< v_b1_1 1) InVars {b1=v_b1_1} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[]" "[86] L41-->L35-2: Formula: (= (+ v_x1_1 v_t1_1) v_x1_2) InVars {t1=v_t1_1, x1=v_x1_2} OutVars{t1=v_t1_1, x1=v_x1_1} AuxVars[] AssignedVars[x1]" [2025-02-17 22:48:36,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,154 INFO L85 PathProgramCache]: Analyzing trace with hash 128357, now seen corresponding path program 2 times [2025-02-17 22:48:36,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563880706] [2025-02-17 22:48:36,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:36,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,162 INFO L85 PathProgramCache]: Analyzing trace with hash 110322, now seen corresponding path program 1 times [2025-02-17 22:48:36,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766554997] [2025-02-17 22:48:36,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash -471003378, now seen corresponding path program 1 times [2025-02-17 22:48:36,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285938600] [2025-02-17 22:48:36,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:36,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:36,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:36,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:36,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,216 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:36,216 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:36,216 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:36,216 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:36,216 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:36,216 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,217 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:36,217 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:36,217 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_b_t_indep.c.bpl_petrified1_Iteration3_Lasso [2025-02-17 22:48:36,217 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:36,217 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:36,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,259 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:36,259 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:36,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,261 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:36,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-17 22:48:36,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:36,264 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:36,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,285 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:36,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-17 22:48:36,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:36,288 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,394 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:36,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:36,398 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:36,399 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:36,399 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:36,399 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:36,399 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:36,399 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,399 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:36,399 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:36,399 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_b_t_indep.c.bpl_petrified1_Iteration3_Lasso [2025-02-17 22:48:36,399 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:36,399 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:36,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,457 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:36,457 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:36,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,459 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:36,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-17 22:48:36,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:36,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:36,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:36,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:36,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:36,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:36,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:36,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:36,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:48:36,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,485 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:36,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-17 22:48:36,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:36,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:36,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:36,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:36,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:36,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:36,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:36,505 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:36,511 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:48:36,511 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:36,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,533 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:36,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-17 22:48:36,534 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:36,545 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:36,545 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:36,545 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1, x1) = 2*n1 - 2*x1 + 1 Supporting invariants [-1*t1 - 1 >= 0] [2025-02-17 22:48:36,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-17 22:48:36,554 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:36,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:48:36,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:36,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:36,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:36,622 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:36,622 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 194 transitions. cyclomatic complexity: 110 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,676 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 194 transitions. cyclomatic complexity: 110. 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 202 states and 379 transitions. Complement of second has 6 states. [2025-02-17 22:48:36,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-02-17 22:48:36,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 3 letters. Loop has 3 letters. [2025-02-17 22:48:36,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-17 22:48:36,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-17 22:48:36,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 379 transitions. [2025-02-17 22:48:36,679 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 55 [2025-02-17 22:48:36,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 151 states and 285 transitions. [2025-02-17 22:48:36,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2025-02-17 22:48:36,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2025-02-17 22:48:36,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 285 transitions. [2025-02-17 22:48:36,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:36,683 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 285 transitions. [2025-02-17 22:48:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 285 transitions. [2025-02-17 22:48:36,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 127. [2025-02-17 22:48:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 1.9448818897637796) internal successors, (247), 126 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 247 transitions. [2025-02-17 22:48:36,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127 states and 247 transitions. [2025-02-17 22:48:36,689 INFO L432 stractBuchiCegarLoop]: Abstraction has 127 states and 247 transitions. [2025-02-17 22:48:36,689 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:48:36,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 247 transitions. [2025-02-17 22:48:36,689 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 43 [2025-02-17 22:48:36,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:36,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:36,690 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:36,690 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:36,690 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-->L27: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[78] L27-->L35-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[81] L35-2-->L35: 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] L35-->L41: Formula: (< v_b1_1 1) InVars {b1=v_b1_1} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[]" [2025-02-17 22:48:36,690 INFO L754 eck$LassoCheckResult]: Loop: "[86] L41-->L35-2: Formula: (= (+ v_x1_1 v_t1_1) v_x1_2) InVars {t1=v_t1_1, x1=v_x1_2} OutVars{t1=v_t1_1, x1=v_x1_1} AuxVars[] AssignedVars[x1]" "[81] L35-2-->L35: 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] L35-->L41: Formula: (< v_b1_1 1) InVars {b1=v_b1_1} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[]" [2025-02-17 22:48:36,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,690 INFO L85 PathProgramCache]: Analyzing trace with hash 123322920, now seen corresponding path program 1 times [2025-02-17 22:48:36,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972150974] [2025-02-17 22:48:36,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:36,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:36,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:36,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:36,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972150974] [2025-02-17 22:48:36,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972150974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:36,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:36,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:48:36,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305137883] [2025-02-17 22:48:36,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:36,703 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:48:36,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,703 INFO L85 PathProgramCache]: Analyzing trace with hash 115032, now seen corresponding path program 2 times [2025-02-17 22:48:36,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533420934] [2025-02-17 22:48:36,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:36,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:36,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,706 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:36,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:48:36,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:48:36,731 INFO L87 Difference]: Start difference. First operand 127 states and 247 transitions. cyclomatic complexity: 140 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:36,746 INFO L93 Difference]: Finished difference Result 121 states and 220 transitions. [2025-02-17 22:48:36,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 220 transitions. [2025-02-17 22:48:36,746 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-02-17 22:48:36,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 111 states and 203 transitions. [2025-02-17 22:48:36,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-02-17 22:48:36,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2025-02-17 22:48:36,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 203 transitions. [2025-02-17 22:48:36,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:36,748 INFO L218 hiAutomatonCegarLoop]: Abstraction has 111 states and 203 transitions. [2025-02-17 22:48:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 203 transitions. [2025-02-17 22:48:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2025-02-17 22:48:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.891304347826087) internal successors, (174), 91 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 174 transitions. [2025-02-17 22:48:36,751 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 174 transitions. [2025-02-17 22:48:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:48:36,751 INFO L432 stractBuchiCegarLoop]: Abstraction has 92 states and 174 transitions. [2025-02-17 22:48:36,751 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:48:36,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 174 transitions. [2025-02-17 22:48:36,752 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-02-17 22:48:36,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:36,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:36,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:36,752 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:36,752 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-->L27: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[78] L27-->L35-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[80] L35-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[82] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L16-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[87] $Ultimate##0-->L51: Formula: (<= 1 v_b2_3) InVars {b2=v_b2_3} OutVars{b2=v_b2_3} AuxVars[] AssignedVars[]" "[89] L51-->L59-2: Formula: (= v_t2_3 1) InVars {} OutVars{t2=v_t2_3} AuxVars[] AssignedVars[t2]" [2025-02-17 22:48:36,753 INFO L754 eck$LassoCheckResult]: Loop: "[92] L59-2-->L59: 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] L59-->L61: Formula: (<= 1 v_b2_1) InVars {b2=v_b2_1} OutVars{b2=v_b2_1} AuxVars[] AssignedVars[]" "[96] L61-->L59-2: Formula: (= (+ v_x2_3 v_t2_1) v_x2_2) InVars {t2=v_t2_1, x2=v_x2_3} OutVars{t2=v_t2_1, x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:36,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1715190306, now seen corresponding path program 1 times [2025-02-17 22:48:36,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456592] [2025-02-17 22:48:36,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:36,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:36,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,756 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:36,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:36,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,759 INFO L85 PathProgramCache]: Analyzing trace with hash 121213, now seen corresponding path program 1 times [2025-02-17 22:48:36,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842134508] [2025-02-17 22:48:36,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,764 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,768 INFO L85 PathProgramCache]: Analyzing trace with hash 8576956, now seen corresponding path program 1 times [2025-02-17 22:48:36,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96512440] [2025-02-17 22:48:36,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:48:36,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:48:36,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:48:36,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:48:36,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,853 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:36,853 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:36,853 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:36,854 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:36,854 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:36,854 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,854 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:36,854 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:36,854 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_b_t_indep.c.bpl_petrified1_Iteration5_Lasso [2025-02-17 22:48:36,854 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:36,854 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:36,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,953 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:36,953 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:36,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,956 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:36,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-17 22:48:36,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:36,959 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,976 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:36,976 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {n1=0, x1=1} Honda state: {n1=0, x1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:36,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:48:36,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,984 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:36,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-17 22:48:36,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:36,987 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,998 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:36,998 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:37,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:37,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,006 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-17 22:48:37,008 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:37,008 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,025 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:48:37,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,026 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-17 22:48:37,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:37,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,168 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:37,174 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:48:37,174 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:37,174 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:37,174 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:37,174 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:37,174 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:37,174 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,174 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:37,174 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:37,174 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_b_t_indep.c.bpl_petrified1_Iteration5_Lasso [2025-02-17 22:48:37,174 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:37,174 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:37,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,244 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:37,244 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:37,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,246 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-17 22:48:37,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:37,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:37,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:37,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:37,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:37,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:37,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:37,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:37,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:37,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,270 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-17 22:48:37,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:37,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:37,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:37,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:37,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:37,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:37,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:37,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:37,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:37,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:37,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,309 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-17 22:48:37,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:37,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:37,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:37,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:37,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:37,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:37,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:37,329 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:37,335 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:48:37,335 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:37,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,345 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-17 22:48:37,346 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:37,356 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:37,357 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:37,357 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n2, x2) = 2*n2 - 2*x2 + 1 Supporting invariants [1*t2 - 1 >= 0] [2025-02-17 22:48:37,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-17 22:48:37,398 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:37,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:37,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:37,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:37,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:48:37,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:37,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:37,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:37,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:37,458 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:37,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:37,490 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:37,490 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 174 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:37,526 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 174 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 276 states and 537 transitions. Complement of second has 7 states. [2025-02-17 22:48:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-02-17 22:48:37,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:48:37,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:37,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 11 letters. Loop has 3 letters. [2025-02-17 22:48:37,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:37,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 8 letters. Loop has 6 letters. [2025-02-17 22:48:37,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:37,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 276 states and 537 transitions. [2025-02-17 22:48:37,529 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-02-17 22:48:37,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 276 states to 253 states and 497 transitions. [2025-02-17 22:48:37,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2025-02-17 22:48:37,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2025-02-17 22:48:37,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 253 states and 497 transitions. [2025-02-17 22:48:37,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:37,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 253 states and 497 transitions. [2025-02-17 22:48:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states and 497 transitions. [2025-02-17 22:48:37,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 179. [2025-02-17 22:48:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 179 states have (on average 1.9553072625698324) internal successors, (350), 178 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 350 transitions. [2025-02-17 22:48:37,537 INFO L240 hiAutomatonCegarLoop]: Abstraction has 179 states and 350 transitions. [2025-02-17 22:48:37,537 INFO L432 stractBuchiCegarLoop]: Abstraction has 179 states and 350 transitions. [2025-02-17 22:48:37,537 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:48:37,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 350 transitions. [2025-02-17 22:48:37,538 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-02-17 22:48:37,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:37,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:37,538 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:37,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:37,538 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-->L27: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[78] L27-->L35-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[80] L35-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[82] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L16-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[88] $Ultimate##0-->L55: Formula: (< v_b2_4 1) InVars {b2=v_b2_4} OutVars{b2=v_b2_4} AuxVars[] AssignedVars[]" "[90] L55-->L59-2: Formula: (= (+ v_t2_4 1) 0) InVars {} OutVars{t2=v_t2_4} AuxVars[] AssignedVars[t2]" [2025-02-17 22:48:37,538 INFO L754 eck$LassoCheckResult]: Loop: "[92] L59-2-->L59: 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] L59-->L65: Formula: (< v_b2_2 1) InVars {b2=v_b2_2} OutVars{b2=v_b2_2} AuxVars[] AssignedVars[]" "[97] L65-->L59-2: Formula: (= v_x2_5 (+ v_x2_4 v_t2_2)) InVars {t2=v_t2_2, x2=v_x2_5} OutVars{t2=v_t2_2, x2=v_x2_4} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:37,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1715190338, now seen corresponding path program 1 times [2025-02-17 22:48:37,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031820609] [2025-02-17 22:48:37,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:37,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:37,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:37,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:37,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,545 INFO L85 PathProgramCache]: Analyzing trace with hash 121245, now seen corresponding path program 1 times [2025-02-17 22:48:37,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525003068] [2025-02-17 22:48:37,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:37,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:37,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,547 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:37,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:37,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,549 INFO L85 PathProgramCache]: Analyzing trace with hash 9530300, now seen corresponding path program 1 times [2025-02-17 22:48:37,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220788699] [2025-02-17 22:48:37,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:48:37,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:48:37,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:48:37,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:48:37,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,608 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:37,608 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:37,608 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:37,608 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:37,608 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:37,608 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,608 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:37,608 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:37,608 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_b_t_indep.c.bpl_petrified1_Iteration6_Lasso [2025-02-17 22:48:37,608 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:37,608 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:37,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,667 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:37,668 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:37,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,669 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-17 22:48:37,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:37,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,691 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:37,691 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {n1=0, x1=1} Honda state: {n1=0, x1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:37,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:48:37,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,698 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-17 22:48:37,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:37,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-17 22:48:37,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,717 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-17 22:48:37,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:37,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,820 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:37,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-17 22:48:37,825 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:37,825 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:37,825 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:37,825 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:37,825 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:37,826 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,826 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:37,826 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:37,826 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_b_t_indep.c.bpl_petrified1_Iteration6_Lasso [2025-02-17 22:48:37,826 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:37,826 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:37,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,895 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:37,895 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:37,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,898 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-17 22:48:37,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:37,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:37,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:37,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:37,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:37,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:37,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:37,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:37,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:37,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,924 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-17 22:48:37,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:37,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:37,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:37,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:37,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:37,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:37,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:37,944 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:37,948 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:37,948 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:37,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,950 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-17 22:48:37,954 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:37,967 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:37,968 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:37,968 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(t2, n2, x2) = -1*t2 + 2*n2 - 2*x2 Supporting invariants [-1*t2 - 1 >= 0] [2025-02-17 22:48:37,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:37,976 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:37,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:37,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:37,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:37,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:48:37,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:38,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:38,007 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:38,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:38,031 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:38,031 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 350 transitions. cyclomatic complexity: 193 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,070 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 350 transitions. cyclomatic complexity: 193. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 363 states and 713 transitions. Complement of second has 7 states. [2025-02-17 22:48:38,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-02-17 22:48:38,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:48:38,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:38,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 11 letters. Loop has 3 letters. [2025-02-17 22:48:38,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:38,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 8 letters. Loop has 6 letters. [2025-02-17 22:48:38,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:38,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 363 states and 713 transitions. [2025-02-17 22:48:38,079 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-02-17 22:48:38,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 363 states to 340 states and 674 transitions. [2025-02-17 22:48:38,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2025-02-17 22:48:38,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2025-02-17 22:48:38,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 340 states and 674 transitions. [2025-02-17 22:48:38,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:38,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 340 states and 674 transitions. [2025-02-17 22:48:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states and 674 transitions. [2025-02-17 22:48:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 266. [2025-02-17 22:48:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 266 states have (on average 1.981203007518797) internal successors, (527), 265 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 527 transitions. [2025-02-17 22:48:38,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 266 states and 527 transitions. [2025-02-17 22:48:38,101 INFO L432 stractBuchiCegarLoop]: Abstraction has 266 states and 527 transitions. [2025-02-17 22:48:38,102 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:48:38,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 527 transitions. [2025-02-17 22:48:38,103 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-02-17 22:48:38,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:38,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:38,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:38,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:38,103 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-->L27: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[78] L27-->L35-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[80] L35-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[82] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L16-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[87] $Ultimate##0-->L51: Formula: (<= 1 v_b2_3) InVars {b2=v_b2_3} OutVars{b2=v_b2_3} AuxVars[] AssignedVars[]" "[89] L51-->L59-2: Formula: (= v_t2_3 1) InVars {} OutVars{t2=v_t2_3} AuxVars[] AssignedVars[t2]" "[92] L59-2-->L59: 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] L59-->L65: Formula: (< v_b2_2 1) InVars {b2=v_b2_2} OutVars{b2=v_b2_2} AuxVars[] AssignedVars[]" [2025-02-17 22:48:38,103 INFO L754 eck$LassoCheckResult]: Loop: "[97] L65-->L59-2: Formula: (= v_x2_5 (+ v_x2_4 v_t2_2)) InVars {t2=v_t2_2, x2=v_x2_5} OutVars{t2=v_t2_2, x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[92] L59-2-->L59: 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] L59-->L65: Formula: (< v_b2_2 1) InVars {b2=v_b2_2} OutVars{b2=v_b2_2} AuxVars[] AssignedVars[]" [2025-02-17 22:48:38,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,104 INFO L85 PathProgramCache]: Analyzing trace with hash -969554651, now seen corresponding path program 1 times [2025-02-17 22:48:38,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:38,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583704828] [2025-02-17 22:48:38,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:38,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:38,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:48:38,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:48:38,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:38,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:38,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583704828] [2025-02-17 22:48:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583704828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:38,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:38,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:48:38,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625888946] [2025-02-17 22:48:38,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:38,127 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:48:38,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,127 INFO L85 PathProgramCache]: Analyzing trace with hash 125955, now seen corresponding path program 2 times [2025-02-17 22:48:38,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:38,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972584477] [2025-02-17 22:48:38,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:38,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:38,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:38,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,133 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:38,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:38,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:38,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:48:38,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:48:38,154 INFO L87 Difference]: Start difference. First operand 266 states and 527 transitions. cyclomatic complexity: 293 Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:38,164 INFO L93 Difference]: Finished difference Result 255 states and 491 transitions. [2025-02-17 22:48:38,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 255 states and 491 transitions. [2025-02-17 22:48:38,165 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-02-17 22:48:38,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 255 states to 158 states and 300 transitions. [2025-02-17 22:48:38,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-02-17 22:48:38,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2025-02-17 22:48:38,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 300 transitions. [2025-02-17 22:48:38,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:38,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 300 transitions. [2025-02-17 22:48:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 300 transitions. [2025-02-17 22:48:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2025-02-17 22:48:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.9393939393939394) internal successors, (256), 131 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 256 transitions. [2025-02-17 22:48:38,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 256 transitions. [2025-02-17 22:48:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:48:38,174 INFO L432 stractBuchiCegarLoop]: Abstraction has 132 states and 256 transitions. [2025-02-17 22:48:38,174 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-17 22:48:38,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 256 transitions. [2025-02-17 22:48:38,175 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-02-17 22:48:38,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:38,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:38,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:38,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:38,176 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-->L27: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[78] L27-->L35-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[80] L35-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[82] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L16-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[88] $Ultimate##0-->L55: Formula: (< v_b2_4 1) InVars {b2=v_b2_4} OutVars{b2=v_b2_4} AuxVars[] AssignedVars[]" "[90] L55-->L59-2: Formula: (= (+ v_t2_4 1) 0) InVars {} OutVars{t2=v_t2_4} AuxVars[] AssignedVars[t2]" "[104] thread1EXIT-->L18: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" [2025-02-17 22:48:38,176 INFO L754 eck$LassoCheckResult]: Loop: "[92] L59-2-->L59: 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] L59-->L61: Formula: (<= 1 v_b2_1) InVars {b2=v_b2_1} OutVars{b2=v_b2_1} AuxVars[] AssignedVars[]" "[96] L61-->L59-2: Formula: (= (+ v_x2_3 v_t2_1) v_x2_2) InVars {t2=v_t2_1, x2=v_x2_3} OutVars{t2=v_t2_1, x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:38,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1631293030, now seen corresponding path program 1 times [2025-02-17 22:48:38,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:38,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908326514] [2025-02-17 22:48:38,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:38,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:38,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:48:38,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:48:38,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:38,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:48:38,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:48:38,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:38,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,182 INFO L85 PathProgramCache]: Analyzing trace with hash 121213, now seen corresponding path program 2 times [2025-02-17 22:48:38,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:38,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526794120] [2025-02-17 22:48:38,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:38,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:38,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:38,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:38,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:38,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,195 INFO L85 PathProgramCache]: Analyzing trace with hash 295793912, now seen corresponding path program 1 times [2025-02-17 22:48:38,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:38,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512700586] [2025-02-17 22:48:38,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:38,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:38,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-17 22:48:38,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-17 22:48:38,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:38,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:38,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512700586] [2025-02-17 22:48:38,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512700586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:38,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:38,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:48:38,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110479007] [2025-02-17 22:48:38,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:38,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:38,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:48:38,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:48:38,227 INFO L87 Difference]: Start difference. First operand 132 states and 256 transitions. cyclomatic complexity: 140 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:38,232 INFO L93 Difference]: Finished difference Result 117 states and 217 transitions. [2025-02-17 22:48:38,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 217 transitions. [2025-02-17 22:48:38,233 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:38,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 0 states and 0 transitions. [2025-02-17 22:48:38,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:48:38,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:48:38,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:48:38,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:48:38,233 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:38,233 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:48:38,235 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:38,236 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-17 22:48:38,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:48:38,236 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:38,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:48:38,241 INFO L201 PluginConnector]: Adding new model adfg_2_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:48:38 BoogieIcfgContainer [2025-02-17 22:48:38,241 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:48:38,241 INFO L158 Benchmark]: Toolchain (without parser) took 3692.09ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 87.1MB in the beginning and 33.8MB in the end (delta: 53.3MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. [2025-02-17 22:48:38,241 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:38,242 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.77ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 85.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:38,242 INFO L158 Benchmark]: Boogie Preprocessor took 11.33ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 85.0MB in the end (delta: 695.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:38,242 INFO L158 Benchmark]: RCFGBuilder took 154.15ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 76.0MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:48:38,242 INFO L158 Benchmark]: BuchiAutomizer took 3506.78ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.9MB in the beginning and 33.8MB in the end (delta: 42.1MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. [2025-02-17 22:48:38,243 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 16.77ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 85.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 11.33ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 85.0MB in the end (delta: 695.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 154.15ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 76.0MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3506.78ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.9MB in the beginning and 33.8MB in the end (delta: 42.1MB). Peak memory consumption was 26.3MB. 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 8 terminating modules (4 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * x1 + 2 * n1 + t1 and consists of 4 locations. One deterministic module has affine ranking function -2 * x1 + 2 * n1 + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n2 + -2 * x2 + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * t2 + 2 * n2 + -2 * x2 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 335 StatesRemovedByMinimization, 7 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, 251 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 441 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 172 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 269 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN2 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital31 mio100 ax100 hnf100 lsp44 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 134, Trivial Ample Sets caused by loops: 54, Number of non-trivial ample sets: 48, Number of pruned transitions: 31, Number of transitions in reduction automaton: 126, Number of states in reduction automaton: 69, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:48:38,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-17 22:48:38,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-17 22:48:38,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...