/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/seq_loops_indep_2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:18,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:18,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:18,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:18,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:18,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:18,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:18,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:18,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:18,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:18,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:18,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:18,759 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:18,759 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:18,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:18,760 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:18,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:18,761 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:18,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:18,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:18,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:18,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:18,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:18,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:18,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:18,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:18,761 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:18,761 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:18,762 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:18,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:18,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:18,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:19,000 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:19,000 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:19,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/seq_loops_indep_2.c.bpl [2025-04-26 18:42:19,004 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/seq_loops_indep_2.c.bpl' [2025-04-26 18:42:19,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:19,019 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:19,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:19,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:19,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:19,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:19" (1/1) ... [2025-04-26 18:42:19,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:19" (1/1) ... [2025-04-26 18:42:19,050 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:19,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:19,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:19,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:19,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:19,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:19" (1/1) ... [2025-04-26 18:42:19,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:19" (1/1) ... [2025-04-26 18:42:19,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:19" (1/1) ... [2025-04-26 18:42:19,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:19" (1/1) ... [2025-04-26 18:42:19,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:19" (1/1) ... [2025-04-26 18:42:19,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:19" (1/1) ... [2025-04-26 18:42:19,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:19" (1/1) ... [2025-04-26 18:42:19,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:19" (1/1) ... [2025-04-26 18:42:19,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:19" (1/1) ... [2025-04-26 18:42:19,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:19,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:19,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:19,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:19,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:19" (1/1) ... [2025-04-26 18:42:19,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:19,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:19,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:19,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:42:19,124 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:19,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:19,124 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:19,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:19,124 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:19,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:19,125 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:42:19,163 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:19,165 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:19,225 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:19,225 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:19,235 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:19,235 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:19,237 INFO L201 PluginConnector]: Adding new model seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:19 BoogieIcfgContainer [2025-04-26 18:42:19,237 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:19,238 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:19,238 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:19,242 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:19,243 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:19,243 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:19" (1/2) ... [2025-04-26 18:42:19,245 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69c2b3f6 and model type seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:19, skipping insertion in model container [2025-04-26 18:42:19,245 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:19,245 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:19" (2/2) ... [2025-04-26 18:42:19,246 INFO L376 chiAutomizerObserver]: Analyzing ICFG seq_loops_indep_2.c.bpl [2025-04-26 18:42:19,291 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:42:19,330 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:19,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:19,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:19,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:19,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:42:19,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 23 transitions, 60 flow [2025-04-26 18:42:19,393 INFO L116 PetriNetUnfolderBase]: 4/19 cut-off events. [2025-04-26 18:42:19,396 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:42:19,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 4/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-26 18:42:19,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 23 transitions, 60 flow [2025-04-26 18:42:19,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 19 transitions, 50 flow [2025-04-26 18:42:19,402 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 22 places, 19 transitions, 50 flow [2025-04-26 18:42:19,403 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 19 transitions, 50 flow [2025-04-26 18:42:19,414 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51 states, 50 states have (on average 2.26) internal successors, (in total 113), 50 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:19,415 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 51 states, 50 states have (on average 2.26) internal successors, (in total 113), 50 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:19,417 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:19,449 WARN L140 AmpleReduction]: Number of pruned transitions: 23 [2025-04-26 18:42:19,449 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:19,449 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 16 [2025-04-26 18:42:19,449 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:15 [2025-04-26 18:42:19,449 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:19 [2025-04-26 18:42:19,450 WARN L145 AmpleReduction]: Times succ was already a loop node:28 [2025-04-26 18:42:19,450 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:2 [2025-04-26 18:42:19,450 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:19,450 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 51 states, 50 states have (on average 1.8) internal successors, (in total 90), 50 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:19,455 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:19,455 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:19,455 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:19,455 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:19,456 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:19,456 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:19,456 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:19,456 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:19,457 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.8) internal successors, (in total 90), 50 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:19,465 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 40 [2025-04-26 18:42:19,465 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:19,465 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:19,467 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:19,468 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:19,468 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:19,468 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.8) internal successors, (in total 90), 50 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:19,470 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 40 [2025-04-26 18:42:19,470 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:19,470 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:19,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:19,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:19,473 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:19,473 INFO L754 eck$LassoCheckResult]: Loop: "[53] L21-->L23: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[56] L23-->L21: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:19,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash 99, now seen corresponding path program 1 times [2025-04-26 18:42:19,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:19,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44806738] [2025-04-26 18:42:19,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:19,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:19,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:19,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:19,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:19,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:19,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:19,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:19,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:19,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2660, now seen corresponding path program 1 times [2025-04-26 18:42:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:19,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086618419] [2025-04-26 18:42:19,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:19,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:19,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:19,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:19,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:19,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:19,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:19,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:19,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:19,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:19,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash 96838, now seen corresponding path program 1 times [2025-04-26 18:42:19,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:19,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713955988] [2025-04-26 18:42:19,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:19,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:19,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:19,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:19,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:19,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:19,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:19,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:19,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:19,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:19,638 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:19,639 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:19,639 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:19,639 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:19,639 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:19,639 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,639 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:19,639 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:19,639 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:19,640 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:19,640 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:19,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:19,726 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:19,727 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:19,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:19,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:19,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:42:19,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:19,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:19,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:19,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:19,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:19,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:42:19,762 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:19,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:19,835 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:19,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:42:19,840 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:19,840 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:19,840 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:19,840 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:19,840 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:19,840 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,840 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:19,841 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:19,841 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:19,841 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:19,841 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:19,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:19,866 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:19,869 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:19,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:19,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:19,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:42:19,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:42:19,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:19,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:19,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:19,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:19,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:19,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:19,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:19,913 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:19,921 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:19,921 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:19,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:19,924 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:19,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:42:19,925 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:19,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:42:19,928 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:19,929 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:19,929 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:42:19,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:42:19,937 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:19,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:19,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:19,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:19,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:19,978 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:19,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:19,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:19,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:19,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:19,988 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:19,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:20,064 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:20,066 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 51 states, 50 states have (on average 1.8) internal successors, (in total 90), 50 states have internal predecessors, (90), 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 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:20,157 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 51 states, 50 states have (on average 1.8) internal successors, (in total 90), 50 states have internal predecessors, (90), 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 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 114 states and 209 transitions. Complement of second has 6 states. [2025-04-26 18:42:20,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2025-04-26 18:42:20,166 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 18:42:20,167 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:20,167 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:20,167 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:20,167 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 18:42:20,167 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:20,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 209 transitions. [2025-04-26 18:42:20,171 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 26 [2025-04-26 18:42:20,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 57 states and 106 transitions. [2025-04-26 18:42:20,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-04-26 18:42:20,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-04-26 18:42:20,176 INFO L74 IsDeterministic]: Start isDeterministic. Operand 57 states and 106 transitions. [2025-04-26 18:42:20,176 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:20,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 106 transitions. [2025-04-26 18:42:20,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 106 transitions. [2025-04-26 18:42:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2025-04-26 18:42:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.8) internal successors, (in total 90), 49 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 90 transitions. [2025-04-26 18:42:20,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 90 transitions. [2025-04-26 18:42:20,201 INFO L438 stractBuchiCegarLoop]: Abstraction has 50 states and 90 transitions. [2025-04-26 18:42:20,201 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:20,201 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 90 transitions. [2025-04-26 18:42:20,202 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 26 [2025-04-26 18:42:20,202 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:20,202 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:20,202 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:20,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:20,203 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[52] L21-->L25-1: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" [2025-04-26 18:42:20,203 INFO L754 eck$LassoCheckResult]: Loop: "[55] L25-1-->L27: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[58] L27-->L25-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:20,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash 3121, now seen corresponding path program 1 times [2025-04-26 18:42:20,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:20,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248833179] [2025-04-26 18:42:20,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:20,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:20,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:20,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:20,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:20,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:20,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:20,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:20,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:20,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2724, now seen corresponding path program 1 times [2025-04-26 18:42:20,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:20,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488505001] [2025-04-26 18:42:20,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:20,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:20,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:20,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:20,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,213 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:20,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:20,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:20,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:20,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash 3001044, now seen corresponding path program 1 times [2025-04-26 18:42:20,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:20,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234700801] [2025-04-26 18:42:20,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:20,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:20,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:20,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:20,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,221 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:20,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:20,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:20,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:20,236 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:20,236 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:20,236 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:20,236 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:20,236 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:20,236 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,236 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:20,236 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:20,236 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:20,236 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:20,236 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:20,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:20,257 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:20,257 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:20,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:20,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:20,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:42:20,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:20,267 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:20,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:42:20,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:20,285 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:20,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:42:20,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:20,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:20,387 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:20,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:42:20,392 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:20,393 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:20,393 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:20,393 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:20,393 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:20,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:20,393 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:20,393 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:20,393 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:20,393 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:20,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:20,421 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:20,421 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:20,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:20,424 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:20,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:42:20,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:42:20,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:20,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:20,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:20,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:20,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:20,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:20,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:20,443 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:20,445 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:20,445 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:20,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:20,448 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:20,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:42:20,483 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:20,486 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:20,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:42:20,487 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:20,487 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:20,487 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 18:42:20,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:20,495 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:20,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:20,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:20,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:20,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:20,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:20,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:20,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:20,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:20,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:20,523 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:20,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:20,540 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:20,540 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 90 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:20,584 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 90 transitions. cyclomatic complexity: 56. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 94 states and 183 transitions. Complement of second has 6 states. [2025-04-26 18:42:20,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-04-26 18:42:20,586 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:42:20,586 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:20,586 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:20,586 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:20,586 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:42:20,586 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:20,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 183 transitions. [2025-04-26 18:42:20,590 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-04-26 18:42:20,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 53 states and 103 transitions. [2025-04-26 18:42:20,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-04-26 18:42:20,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-04-26 18:42:20,591 INFO L74 IsDeterministic]: Start isDeterministic. Operand 53 states and 103 transitions. [2025-04-26 18:42:20,591 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:20,591 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 103 transitions. [2025-04-26 18:42:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 103 transitions. [2025-04-26 18:42:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2025-04-26 18:42:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.9591836734693877) internal successors, (in total 96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 96 transitions. [2025-04-26 18:42:20,596 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 96 transitions. [2025-04-26 18:42:20,596 INFO L438 stractBuchiCegarLoop]: Abstraction has 49 states and 96 transitions. [2025-04-26 18:42:20,597 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:20,597 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 96 transitions. [2025-04-26 18:42:20,601 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-04-26 18:42:20,601 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:20,601 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:20,601 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:20,601 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:20,601 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[52] L21-->L25-1: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[54] L25-1-->thread1FINAL: Formula: (<= v_z_4 v_x3_4) InVars {x3=v_x3_4, z=v_z_4} OutVars{x3=v_x3_4, z=v_z_4} AuxVars[] AssignedVars[]" "[57] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[71] L12-->L34: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:42:20,601 INFO L754 eck$LassoCheckResult]: Loop: "[60] L34-->L36: Formula: (< v_x2_1 v_z_5) InVars {x2=v_x2_1, z=v_z_5} OutVars{x2=v_x2_1, z=v_z_5} AuxVars[] AssignedVars[]" "[63] L36-->L34: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:20,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:20,602 INFO L85 PathProgramCache]: Analyzing trace with hash 93031443, now seen corresponding path program 1 times [2025-04-26 18:42:20,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:20,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119685651] [2025-04-26 18:42:20,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:20,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:20,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:20,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:20,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:20,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:20,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:20,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:20,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:20,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2884, now seen corresponding path program 1 times [2025-04-26 18:42:20,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:20,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124286762] [2025-04-26 18:42:20,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:20,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:20,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:20,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:20,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:20,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:20,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:20,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:20,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash -791094570, now seen corresponding path program 1 times [2025-04-26 18:42:20,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:20,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189036962] [2025-04-26 18:42:20,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:20,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:20,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:20,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:20,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:20,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:20,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:20,649 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:20,649 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:20,649 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:20,649 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:20,649 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:20,649 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,649 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:20,649 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:20,649 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:20,649 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:20,649 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:20,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:20,668 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:20,668 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:20,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:20,670 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:20,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:42:20,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:20,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:20,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:42:20,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:20,690 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:20,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:42:20,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:20,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:20,761 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:20,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:42:20,765 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:20,765 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:20,765 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:20,765 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:20,765 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:20,766 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,766 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:20,766 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:20,766 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:20,766 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:20,766 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:20,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:20,784 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:20,785 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:20,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:20,787 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:20,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:42:20,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:20,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:20,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:20,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:20,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:20,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:20,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:20,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:20,803 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:20,805 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:20,805 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:20,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:20,807 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:20,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:42:20,808 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:20,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:42:20,811 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:20,811 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:20,812 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 18:42:20,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:42:20,818 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:20,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:20,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:20,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:20,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:20,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:20,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:20,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:20,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:20,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:20,854 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:20,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:20,872 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:20,872 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 96 transitions. cyclomatic complexity: 59 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:20,910 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 96 transitions. cyclomatic complexity: 59. 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) Result 117 states and 232 transitions. Complement of second has 6 states. [2025-04-26 18:42:20,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-04-26 18:42:20,912 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:20,912 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:20,912 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:42:20,912 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:20,912 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:42:20,912 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:20,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 232 transitions. [2025-04-26 18:42:20,915 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:42:20,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 73 states and 137 transitions. [2025-04-26 18:42:20,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-04-26 18:42:20,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-04-26 18:42:20,918 INFO L74 IsDeterministic]: Start isDeterministic. Operand 73 states and 137 transitions. [2025-04-26 18:42:20,918 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:20,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 137 transitions. [2025-04-26 18:42:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 137 transitions. [2025-04-26 18:42:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2025-04-26 18:42:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.8823529411764706) internal successors, (in total 128), 67 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 128 transitions. [2025-04-26 18:42:20,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 128 transitions. [2025-04-26 18:42:20,921 INFO L438 stractBuchiCegarLoop]: Abstraction has 68 states and 128 transitions. [2025-04-26 18:42:20,921 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:20,921 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 128 transitions. [2025-04-26 18:42:20,922 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:42:20,922 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:20,922 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:20,923 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:42:20,923 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:20,923 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[52] L21-->L25-1: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[54] L25-1-->thread1FINAL: Formula: (<= v_z_4 v_x3_4) InVars {x3=v_x3_4, z=v_z_4} OutVars{x3=v_x3_4, z=v_z_4} AuxVars[] AssignedVars[]" "[57] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[71] L12-->L34: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[59] L34-->L38-1: Formula: (<= v_z_6 v_x2_4) InVars {x2=v_x2_4, z=v_z_6} OutVars{x2=v_x2_4, z=v_z_6} AuxVars[] AssignedVars[]" [2025-04-26 18:42:20,923 INFO L754 eck$LassoCheckResult]: Loop: "[62] L38-1-->L40: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[65] L40-->L38-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 18:42:20,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:20,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1410992504, now seen corresponding path program 1 times [2025-04-26 18:42:20,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:20,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250172018] [2025-04-26 18:42:20,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:20,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:20,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:20,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:20,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:20,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:20,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:20,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:20,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2948, now seen corresponding path program 1 times [2025-04-26 18:42:20,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:20,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509362456] [2025-04-26 18:42:20,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:20,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:20,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:20,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:20,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:20,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:20,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:20,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:20,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:20,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1245871179, now seen corresponding path program 1 times [2025-04-26 18:42:20,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:20,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122546225] [2025-04-26 18:42:20,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:20,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:20,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:20,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:20,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:20,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:20,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:20,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:20,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:20,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:20,959 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:20,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:20,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:20,959 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:20,959 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:20,959 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,959 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:20,959 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:20,959 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:20,959 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:20,959 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:20,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:20,974 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:20,974 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:20,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:20,976 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:20,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:42:20,981 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:20,981 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:20,999 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:42:20,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:20,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:21,001 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:21,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:42:21,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:21,003 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:21,068 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:21,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:21,072 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:21,072 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:21,072 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:21,072 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:21,072 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:21,073 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:21,073 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:21,073 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:21,073 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:21,073 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:21,073 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:21,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:21,087 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:21,088 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:21,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:21,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:21,090 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:21,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:42:21,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:21,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:21,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:21,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:21,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:21,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:21,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:21,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:21,106 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:21,110 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:21,110 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:21,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:21,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:21,112 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:21,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:42:21,114 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:21,117 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:21,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:21,118 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:21,118 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:21,118 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 18:42:21,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:21,125 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:21,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:21,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:21,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:21,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:21,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:21,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:21,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:21,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:21,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:21,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:21,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:21,157 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:21,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:21,175 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:21,175 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 128 transitions. cyclomatic complexity: 75 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:21,220 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 128 transitions. cyclomatic complexity: 75. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 101 states and 188 transitions. Complement of second has 6 states. [2025-04-26 18:42:21,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-04-26 18:42:21,221 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:21,221 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:21,221 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:42:21,222 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:21,222 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:42:21,222 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:21,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 188 transitions. [2025-04-26 18:42:21,223 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:21,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 0 states and 0 transitions. [2025-04-26 18:42:21,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:21,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:21,223 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:21,223 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:21,223 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:21,223 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:21,223 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:21,223 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:21,224 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:21,224 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:21,224 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:21,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:21,239 INFO L201 PluginConnector]: Adding new model seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:21 BoogieIcfgContainer [2025-04-26 18:42:21,239 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:21,240 INFO L158 Benchmark]: Toolchain (without parser) took 2220.83ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 84.3MB in the beginning and 44.4MB in the end (delta: 39.9MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:21,240 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.87ms. Allocated memory is still 155.2MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:21,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.01ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 82.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:21,240 INFO L158 Benchmark]: Boogie Preprocessor took 17.17ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 81.4MB in the end (delta: 904.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:21,241 INFO L158 Benchmark]: RCFGBuilder took 167.48ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 72.7MB in the end (delta: 8.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:42:21,241 INFO L158 Benchmark]: BuchiAutomizer took 2001.38ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 72.7MB in the beginning and 44.4MB in the end (delta: 28.3MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. [2025-04-26 18:42:21,243 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.87ms. Allocated memory is still 155.2MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.01ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 82.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.17ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 81.4MB in the end (delta: 904.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 167.48ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 72.7MB in the end (delta: 8.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2001.38ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 72.7MB in the beginning and 44.4MB in the end (delta: 28.3MB). Peak memory consumption was 18.6MB. 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.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 50 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 59ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 124, Number of transitions in reduction automaton: 90, Number of states in reduction automaton: 51, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:21,257 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...