/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/1_thr/adfg_1.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:56,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:56,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:56,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:56,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:56,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:56,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:56,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:56,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:56,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:56,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:56,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:56,315 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:56,315 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:56,315 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:56,315 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:56,315 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:56,315 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:56,315 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:56,315 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:56,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:56,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:56,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:56,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:56,317 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:56,317 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:56,317 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:56,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:56,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:56,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:56,561 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:56,562 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:56,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/1_thr/adfg_1.c.bpl [2025-04-26 18:41:56,565 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/1_thr/adfg_1.c.bpl' [2025-04-26 18:41:56,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:56,581 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:56,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:56,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:56,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:56,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:56" (1/1) ... [2025-04-26 18:41:56,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:56" (1/1) ... [2025-04-26 18:41:56,615 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:56,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:56,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:56,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:56,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:56,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:56" (1/1) ... [2025-04-26 18:41:56,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:56" (1/1) ... [2025-04-26 18:41:56,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:56" (1/1) ... [2025-04-26 18:41:56,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:56" (1/1) ... [2025-04-26 18:41:56,623 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:56" (1/1) ... [2025-04-26 18:41:56,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:56" (1/1) ... [2025-04-26 18:41:56,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:56" (1/1) ... [2025-04-26 18:41:56,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:56" (1/1) ... [2025-04-26 18:41:56,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:56" (1/1) ... [2025-04-26 18:41:56,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:56,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:56,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:56,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:56,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:56" (1/1) ... [2025-04-26 18:41:56,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:56,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:56,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:56,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:56,679 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:56,679 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:56,679 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:56,679 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:56,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:56,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:56,680 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:41:56,717 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:56,719 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:56,765 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:56,765 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:56,772 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:56,772 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:56,773 INFO L201 PluginConnector]: Adding new model adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:56 BoogieIcfgContainer [2025-04-26 18:41:56,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:56,773 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:56,773 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:56,777 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:56,778 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:56,778 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:56" (1/2) ... [2025-04-26 18:41:56,779 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f61c396 and model type adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:56, skipping insertion in model container [2025-04-26 18:41:56,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:56,780 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:56" (2/2) ... [2025-04-26 18:41:56,780 INFO L376 chiAutomizerObserver]: Analyzing ICFG adfg_1.c.bpl [2025-04-26 18:41:56,815 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-26 18:41:56,856 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:56,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:56,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:56,860 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:56,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:56,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 16 transitions, 39 flow [2025-04-26 18:41:56,919 INFO L116 PetriNetUnfolderBase]: 3/14 cut-off events. [2025-04-26 18:41:56,923 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-26 18:41:56,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19 conditions, 14 events. 3/14 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 11. Up to 4 conditions per place. [2025-04-26 18:41:56,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 16 places, 16 transitions, 39 flow [2025-04-26 18:41:56,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 14 transitions, 34 flow [2025-04-26 18:41:56,936 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 15 places, 14 transitions, 34 flow [2025-04-26 18:41:56,937 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 14 transitions, 34 flow [2025-04-26 18:41:56,944 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (in total 14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:56,944 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (in total 14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:56,946 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:56,953 WARN L140 AmpleReduction]: Number of pruned transitions: 0 [2025-04-26 18:41:56,953 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:56,953 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 0 [2025-04-26 18:41:56,953 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:11 [2025-04-26 18:41:56,953 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:0 [2025-04-26 18:41:56,954 WARN L145 AmpleReduction]: Times succ was already a loop node:2 [2025-04-26 18:41:56,954 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:41:56,954 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:56,954 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (in total 14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:56,959 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:56,959 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:56,959 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:56,959 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:56,960 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:56,960 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:56,960 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:56,960 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:56,962 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (in total 14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:56,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 18:41:56,970 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:56,970 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:56,973 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:56,974 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:56,974 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:56,974 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (in total 14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:56,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 18:41:56,974 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:56,975 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:56,975 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:56,975 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:56,979 INFO L752 eck$LassoCheckResult]: Stem: "[52] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[39] $Ultimate##0-->L22: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[41] L22-->L30-2: Formula: (= v_t_2 1) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" [2025-04-26 18:41:56,980 INFO L754 eck$LassoCheckResult]: Loop: "[44] L30-2-->L30: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[47] L30-->L36: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[49] L36-->L30-2: Formula: (= v_x1_2 (+ v_x1_1 v_t_1)) InVars {x1=v_x1_2, t=v_t_1} OutVars{x1=v_x1_1, t=v_t_1} AuxVars[] AssignedVars[x1]" [2025-04-26 18:41:56,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash 81013, now seen corresponding path program 1 times [2025-04-26 18:41:56,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:56,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066178256] [2025-04-26 18:41:56,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:56,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:57,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:57,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:57,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:57,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:57,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:57,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:57,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,082 INFO L85 PathProgramCache]: Analyzing trace with hash 73581, now seen corresponding path program 1 times [2025-04-26 18:41:57,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:57,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243249909] [2025-04-26 18:41:57,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:57,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:57,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:57,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:57,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:57,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:57,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:57,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:57,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1881465223, now seen corresponding path program 1 times [2025-04-26 18:41:57,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:57,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943289846] [2025-04-26 18:41:57,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:57,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:57,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:57,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:57,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:57,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:57,162 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943289846] [2025-04-26 18:41:57,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943289846] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:57,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:57,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:57,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13964741] [2025-04-26 18:41:57,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:57,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:57,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:57,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:57,254 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (in total 14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:57,273 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-04-26 18:41:57,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2025-04-26 18:41:57,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-04-26 18:41:57,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 10 states and 12 transitions. [2025-04-26 18:41:57,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-04-26 18:41:57,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-04-26 18:41:57,293 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2025-04-26 18:41:57,294 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:57,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-04-26 18:41:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2025-04-26 18:41:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-04-26 18:41:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (in total 12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-04-26 18:41:57,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-04-26 18:41:57,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:57,347 INFO L438 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-04-26 18:41:57,348 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:57,348 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2025-04-26 18:41:57,350 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-04-26 18:41:57,350 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:57,350 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:57,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:57,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:57,351 INFO L752 eck$LassoCheckResult]: Stem: "[52] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[39] $Ultimate##0-->L22: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[41] L22-->L30-2: Formula: (= v_t_2 1) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" [2025-04-26 18:41:57,353 INFO L754 eck$LassoCheckResult]: Loop: "[44] L30-2-->L30: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[46] L30-->L32: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[48] L32-->L30-2: Formula: (= v_x1_5 (+ v_x1_6 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" [2025-04-26 18:41:57,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash 81013, now seen corresponding path program 2 times [2025-04-26 18:41:57,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:57,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896157411] [2025-04-26 18:41:57,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:57,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:57,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:57,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:57,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:57,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:57,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:57,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:57,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:57,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,365 INFO L85 PathProgramCache]: Analyzing trace with hash 73549, now seen corresponding path program 1 times [2025-04-26 18:41:57,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:57,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132744642] [2025-04-26 18:41:57,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:57,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:57,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:57,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:57,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:57,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:57,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:57,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:57,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1881465255, now seen corresponding path program 1 times [2025-04-26 18:41:57,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:57,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488892786] [2025-04-26 18:41:57,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:57,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:57,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:57,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:57,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:57,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:57,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:57,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:57,422 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:57,423 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:57,423 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:57,425 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:57,425 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:57,425 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,425 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:57,425 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:57,425 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_1.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:41:57,425 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:57,425 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:57,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:57,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:57,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:57,513 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:57,513 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:57,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:57,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:41:57,524 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:57,524 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:57,538 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:57,538 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:41:57,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:41:57,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:57,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:41:57,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:57,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:57,586 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-04-26 18:41:57,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,591 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:57,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:41:57,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:57,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:57,747 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:57,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:57,754 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:57,754 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:57,754 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:57,754 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:57,754 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:57,754 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,754 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:57,754 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:57,754 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_1.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:41:57,754 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:57,754 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:57,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:57,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:57,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:57,812 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:57,815 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:57,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,818 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:57,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:41:57,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:57,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:57,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:57,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:57,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:57,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:57,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:57,839 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:57,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:57,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:57,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:41:57,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:57,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:57,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:57,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:57,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:57,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:57,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:57,865 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:57,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:57,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,873 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:57,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:41:57,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:57,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:57,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:57,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:57,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:57,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:57,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:57,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:57,908 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:57,909 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:57,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,912 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:57,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:41:57,913 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:57,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:57,935 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:41:57,935 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:57,936 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, n) = -2*x1 + 2*n + 1 Supporting invariants [1*t - 1 >= 0] [2025-04-26 18:41:57,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:57,945 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:57,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:57,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:57,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:57,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:41:57,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:57,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:57,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:57,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:57,993 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:41:57,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:58,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-04-26 18:41:58,034 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:58,087 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 16 states and 19 transitions. Complement of second has 4 states. [2025-04-26 18:41:58,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-04-26 18:41:58,093 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:41:58,093 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:58,093 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:41:58,093 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:58,093 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:41:58,094 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:58,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2025-04-26 18:41:58,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-04-26 18:41:58,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 9 states and 10 transitions. [2025-04-26 18:41:58,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-04-26 18:41:58,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-04-26 18:41:58,094 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2025-04-26 18:41:58,094 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:58,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-04-26 18:41:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2025-04-26 18:41:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-04-26 18:41:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (in total 10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-04-26 18:41:58,095 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-04-26 18:41:58,095 INFO L438 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-04-26 18:41:58,095 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:58,096 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2025-04-26 18:41:58,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-04-26 18:41:58,096 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:58,096 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:58,096 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:58,096 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:58,096 INFO L752 eck$LassoCheckResult]: Stem: "[52] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[40] $Ultimate##0-->L26: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[42] L26-->L30-2: Formula: (= (+ v_t_3 1) 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" [2025-04-26 18:41:58,096 INFO L754 eck$LassoCheckResult]: Loop: "[44] L30-2-->L30: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[47] L30-->L36: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[49] L36-->L30-2: Formula: (= v_x1_2 (+ v_x1_1 v_t_1)) InVars {x1=v_x1_2, t=v_t_1} OutVars{x1=v_x1_1, t=v_t_1} AuxVars[] AssignedVars[x1]" [2025-04-26 18:41:58,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:58,097 INFO L85 PathProgramCache]: Analyzing trace with hash 81045, now seen corresponding path program 1 times [2025-04-26 18:41:58,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:58,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008538669] [2025-04-26 18:41:58,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:58,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:58,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:58,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:58,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,104 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:58,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:58,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:58,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:58,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:58,107 INFO L85 PathProgramCache]: Analyzing trace with hash 73581, now seen corresponding path program 2 times [2025-04-26 18:41:58,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:58,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222975929] [2025-04-26 18:41:58,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:58,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:58,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:58,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:58,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:58,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:58,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:58,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:58,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:58,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:58,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1880511911, now seen corresponding path program 1 times [2025-04-26 18:41:58,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:58,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976110363] [2025-04-26 18:41:58,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:58,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:58,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:58,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:58,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:58,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:58,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:58,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:58,162 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:58,162 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:58,162 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:58,162 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:58,162 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:58,162 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,162 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:58,162 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:58,162 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_1.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:41:58,162 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:58,162 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:58,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,206 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:58,207 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:58,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,209 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:58,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:41:58,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:58,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:58,224 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:58,224 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:41:58,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:41:58,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,232 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:58,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:41:58,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:58,234 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:58,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:41:58,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,257 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:58,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:41:58,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:58,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:58,372 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:58,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:58,378 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:58,378 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:58,378 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:58,378 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:58,378 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:58,378 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,378 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:58,378 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:58,378 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_1.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:41:58,378 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:58,378 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:58,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,421 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:58,422 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:58,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,423 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:58,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:41:58,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:58,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:58,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:58,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:58,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:58,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:58,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:58,440 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:58,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:41:58,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,448 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:58,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:41:58,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:58,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:58,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:58,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:58,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:58,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:58,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:58,463 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:58,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:41:58,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,471 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:58,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:41:58,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:58,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:58,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:58,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:58,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:58,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:58,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:58,490 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:58,493 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:58,493 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:58,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,495 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:58,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:58,498 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:58,519 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-04-26 18:41:58,519 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:41:58,519 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:58,519 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(t, n, x1) = -1*t + 2*n - 2*x1 Supporting invariants [-1*t - 1 >= 0] [2025-04-26 18:41:58,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:58,527 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:58,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:58,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:58,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:58,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:58,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:41:58,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:58,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:58,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:58,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:58,575 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:41:58,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:58,609 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:58,609 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:58,641 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 14 states and 16 transitions. Complement of second has 5 states. [2025-04-26 18:41:58,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-04-26 18:41:58,642 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:41:58,642 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:58,642 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:41:58,642 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:58,642 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:41:58,643 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:58,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2025-04-26 18:41:58,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-04-26 18:41:58,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 14 transitions. [2025-04-26 18:41:58,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-04-26 18:41:58,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-04-26 18:41:58,643 INFO L74 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2025-04-26 18:41:58,643 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:58,643 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-04-26 18:41:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2025-04-26 18:41:58,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2025-04-26 18:41:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (in total 12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-04-26 18:41:58,644 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-04-26 18:41:58,644 INFO L438 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-04-26 18:41:58,644 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:58,644 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2025-04-26 18:41:58,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-04-26 18:41:58,645 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:58,645 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:58,645 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:41:58,645 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:58,645 INFO L752 eck$LassoCheckResult]: Stem: "[52] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[40] $Ultimate##0-->L26: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[42] L26-->L30-2: Formula: (= (+ v_t_3 1) 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[44] L30-2-->L30: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:58,645 INFO L754 eck$LassoCheckResult]: Loop: "[46] L30-->L32: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[48] L32-->L30-2: Formula: (= v_x1_5 (+ v_x1_6 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" "[44] L30-2-->L30: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:58,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2512439, now seen corresponding path program 1 times [2025-04-26 18:41:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:58,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360362350] [2025-04-26 18:41:58,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:58,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:58,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:58,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:58,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:58,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:58,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:58,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:58,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:58,650 INFO L85 PathProgramCache]: Analyzing trace with hash 75529, now seen corresponding path program 2 times [2025-04-26 18:41:58,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:58,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259380019] [2025-04-26 18:41:58,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:58,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:58,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:58,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:58,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:58,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:58,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:58,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:58,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:58,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1833671955, now seen corresponding path program 1 times [2025-04-26 18:41:58,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:58,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743536035] [2025-04-26 18:41:58,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:58,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:58,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:58,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:58,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:58,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:58,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743536035] [2025-04-26 18:41:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743536035] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:58,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:58,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507112497] [2025-04-26 18:41:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:58,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:58,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:58,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:58,696 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:58,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:58,700 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2025-04-26 18:41:58,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2025-04-26 18:41:58,700 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:58,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2025-04-26 18:41:58,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:58,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:58,700 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:58,700 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:58,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:58,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:58,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:58,702 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:58,702 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:58,702 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:58,702 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:58,702 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:58,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:41:58,715 INFO L201 PluginConnector]: Adding new model adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:58 BoogieIcfgContainer [2025-04-26 18:41:58,715 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:58,716 INFO L158 Benchmark]: Toolchain (without parser) took 2134.88ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 87.2MB in the beginning and 35.3MB in the end (delta: 52.0MB). Peak memory consumption was 38.1MB. Max. memory is 8.0GB. [2025-04-26 18:41:58,717 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.15ms. Allocated memory is still 155.2MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:58,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.22ms. Allocated memory is still 155.2MB. Free memory was 87.1MB in the beginning and 85.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:58,718 INFO L158 Benchmark]: Boogie Preprocessor took 15.69ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 84.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:58,718 INFO L158 Benchmark]: RCFGBuilder took 139.51ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 75.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:58,718 INFO L158 Benchmark]: BuchiAutomizer took 1942.07ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 75.7MB in the beginning and 35.3MB in the end (delta: 40.4MB). Peak memory consumption was 29.7MB. Max. memory is 8.0GB. [2025-04-26 18:41:58,719 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 1.15ms. Allocated memory is still 155.2MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.22ms. Allocated memory is still 155.2MB. Free memory was 87.1MB in the beginning and 85.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 15.69ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 84.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 139.51ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 75.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1942.07ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 75.7MB in the beginning and 35.3MB in the end (delta: 40.4MB). Peak memory consumption was 29.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 29 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp56 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 101, Number of transitions in reduction automaton: 14, Number of states in reduction automaton: 12, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * n + -2 * x1 + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * n + -1 * t + -2 * x1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:58,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...