/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/4_plus_thr/pc4v.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:58:53,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:53,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:53,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:53,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:53,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:58:53,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:53,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:53,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:53,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:53,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:53,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:53,812 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:53,812 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:53,812 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:53,812 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:53,812 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:53,812 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:53,812 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:53,812 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:53,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:53,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:53,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:53,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:53,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:53,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:53,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:53,814 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:53,814 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:53,814 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:54,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:54,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:54,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:54,038 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:54,038 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:54,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/pc4v.c.bpl [2025-04-26 16:58:54,039 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/pc4v.c.bpl' [2025-04-26 16:58:54,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:54,053 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:54,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:54,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:54,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:54,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:54" (1/1) ... [2025-04-26 16:58:54,081 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:54" (1/1) ... [2025-04-26 16:58:54,085 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:54,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:54,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:54,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:54,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:54,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:54" (1/1) ... [2025-04-26 16:58:54,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:54" (1/1) ... [2025-04-26 16:58:54,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:54" (1/1) ... [2025-04-26 16:58:54,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:54" (1/1) ... [2025-04-26 16:58:54,094 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:54" (1/1) ... [2025-04-26 16:58:54,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:54" (1/1) ... [2025-04-26 16:58:54,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:54" (1/1) ... [2025-04-26 16:58:54,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:54" (1/1) ... [2025-04-26 16:58:54,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:54" (1/1) ... [2025-04-26 16:58:54,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:54,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:54,109 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:54,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:54,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:54" (1/1) ... [2025-04-26 16:58:54,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:54,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,130 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 16:58:54,132 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 16:58:54,150 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:54,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:54,150 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:54,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:54,151 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:54,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:54,151 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:54,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:54,151 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:54,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:54,152 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 16:58:54,188 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:54,189 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:54,268 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:54,268 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:54,275 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:54,275 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:54,276 INFO L201 PluginConnector]: Adding new model pc4v.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:54 BoogieIcfgContainer [2025-04-26 16:58:54,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:54,277 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:54,277 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:54,281 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:54,282 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:54,282 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:54" (1/2) ... [2025-04-26 16:58:54,283 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@abee374 and model type pc4v.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:58:54, skipping insertion in model container [2025-04-26 16:58:54,283 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:54,283 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pc4v.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:54" (2/2) ... [2025-04-26 16:58:54,284 INFO L376 chiAutomizerObserver]: Analyzing ICFG pc4v.c.bpl [2025-04-26 16:58:54,340 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:58:54,378 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:54,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:54,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,381 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 16:58:54,382 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 16:58:54,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 112 flow [2025-04-26 16:58:54,447 INFO L116 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-04-26 16:58:54,449 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:58:54,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 34 events. 4/34 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 93 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-26 16:58:54,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 42 transitions, 112 flow [2025-04-26 16:58:54,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 34 transitions, 92 flow [2025-04-26 16:58:54,455 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 43 places, 34 transitions, 92 flow [2025-04-26 16:58:54,461 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:54,922 WARN L140 AmpleReduction]: Number of pruned transitions: 3685 [2025-04-26 16:58:54,923 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:58:54,924 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 438 [2025-04-26 16:58:54,925 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:29 [2025-04-26 16:58:54,925 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:1345 [2025-04-26 16:58:54,925 WARN L145 AmpleReduction]: Times succ was already a loop node:170 [2025-04-26 16:58:54,925 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:836 [2025-04-26 16:58:54,925 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:54,932 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 1813 states, 1812 states have (on average 1.9128035320088301) internal successors, (in total 3466), 1812 states have internal predecessors, (3466), 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 16:58:54,940 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:54,940 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:54,940 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:54,940 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:54,940 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:54,940 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:54,940 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:54,940 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:54,946 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1813 states, 1812 states have (on average 1.9128035320088301) internal successors, (in total 3466), 1812 states have internal predecessors, (3466), 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 16:58:55,003 INFO L131 ngComponentsAnalysis]: Automaton has 190 accepting balls. 1326 [2025-04-26 16:58:55,003 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:55,004 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:55,008 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:55,008 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:58:55,008 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:55,012 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1813 states, 1812 states have (on average 1.9128035320088301) internal successors, (in total 3466), 1812 states have internal predecessors, (3466), 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 16:58:55,037 INFO L131 ngComponentsAnalysis]: Automaton has 190 accepting balls. 1326 [2025-04-26 16:58:55,037 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:55,037 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:55,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:55,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:58:55,042 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L14: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[107] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:58:55,042 INFO L754 eck$LassoCheckResult]: Loop: "[82] L27-->L29: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[84] L29-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[86] L30-->L27: Formula: (= (+ v_c_2 1) v_c_1) InVars {c=v_c_2} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" [2025-04-26 16:58:55,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,047 INFO L85 PathProgramCache]: Analyzing trace with hash 3393, now seen corresponding path program 1 times [2025-04-26 16:58:55,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821195110] [2025-04-26 16:58:55,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,096 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,132 INFO L85 PathProgramCache]: Analyzing trace with hash 111283, now seen corresponding path program 1 times [2025-04-26 16:58:55,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052278214] [2025-04-26 16:58:55,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:55,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:55,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,146 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:55,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:55,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash 101162355, now seen corresponding path program 1 times [2025-04-26 16:58:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864274714] [2025-04-26 16:58:55,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:55,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:55,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:55,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:55,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,240 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:55,241 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:55,241 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:55,241 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:55,241 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:55,241 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,241 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:55,241 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:55,241 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc4v.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:55,241 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:55,241 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:55,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,301 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:55,306 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:55,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,310 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 16:58:55,311 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 16:58:55,312 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:55,312 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:58:55,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,334 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 16:58:55,336 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 16:58:55,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:55,337 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,377 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:55,377 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 16:58:55,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:55,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,387 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 16:58:55,387 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 16:58:55,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:55,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:55,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,409 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 16:58:55,410 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 16:58:55,411 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:55,411 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,477 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:55,482 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 16:58:55,482 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:55,482 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:55,482 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:55,482 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:55,482 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:55,483 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,483 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:55,483 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:55,483 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc4v.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:55,483 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:55,483 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:55,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,519 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:55,521 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:55,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,524 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 16:58:55,525 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 16:58:55,526 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 16:58:55,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:55,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:55,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:55,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:55,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:55,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:55,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:55,543 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:58:55,549 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 16:58:55,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,551 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 16:58:55,551 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 16:58:55,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:55,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:55,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:55,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:55,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:55,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:55,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:55,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:55,565 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:55,568 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:55,568 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:55,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,593 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 16:58:55,594 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 16:58:55,595 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:55,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:58:55,598 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:55,598 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:55,598 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 16:58:55,603 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 16:58:55,606 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:55,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:55,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:55,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:55,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:55,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:55,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:55,650 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:55,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:55,697 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 16:58:55,710 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:55,714 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 1813 states, 1812 states have (on average 1.9128035320088301) internal successors, (in total 3466), 1812 states have internal predecessors, (3466), 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 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:55,824 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 1813 states, 1812 states have (on average 1.9128035320088301) internal successors, (in total 3466), 1812 states have internal predecessors, (3466), 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 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3712 states and 7192 transitions. Complement of second has 6 states. [2025-04-26 16:58:55,824 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 16:58:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:55,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-26 16:58:55,831 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:58:55,831 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,831 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:58:55,831 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,831 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:58:55,832 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3712 states and 7192 transitions. [2025-04-26 16:58:55,863 INFO L131 ngComponentsAnalysis]: Automaton has 105 accepting balls. 549 [2025-04-26 16:58:55,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3712 states to 2240 states and 4253 transitions. [2025-04-26 16:58:55,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1115 [2025-04-26 16:58:55,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1437 [2025-04-26 16:58:55,897 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2240 states and 4253 transitions. [2025-04-26 16:58:55,898 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:55,898 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2240 states and 4253 transitions. [2025-04-26 16:58:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states and 4253 transitions. [2025-04-26 16:58:55,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2079. [2025-04-26 16:58:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2079 states have (on average 1.9682539682539681) internal successors, (in total 4092), 2078 states have internal predecessors, (4092), 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 16:58:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 4092 transitions. [2025-04-26 16:58:56,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2079 states and 4092 transitions. [2025-04-26 16:58:56,013 INFO L438 stractBuchiCegarLoop]: Abstraction has 2079 states and 4092 transitions. [2025-04-26 16:58:56,013 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:58:56,013 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2079 states and 4092 transitions. [2025-04-26 16:58:56,024 INFO L131 ngComponentsAnalysis]: Automaton has 105 accepting balls. 549 [2025-04-26 16:58:56,025 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:56,025 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:56,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:58:56,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:58:56,026 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L14: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[107] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[81] L27-->L32: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[83] L32-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[85] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[110] L14-1-->L38: 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 16:58:56,026 INFO L754 eck$LassoCheckResult]: Loop: "[88] L38-->L40: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[90] L40-->L41: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[92] L41-->L38: Formula: (= (+ v_c_4 1) v_c_3) InVars {c=v_c_4} OutVars{c=v_c_3} AuxVars[] AssignedVars[c]" [2025-04-26 16:58:56,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1158964964, now seen corresponding path program 1 times [2025-04-26 16:58:56,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723306113] [2025-04-26 16:58:56,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:56,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:56,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:56,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:56,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash 117241, now seen corresponding path program 1 times [2025-04-26 16:58:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401964524] [2025-04-26 16:58:56,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:56,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:56,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:56,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:56,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,054 INFO L85 PathProgramCache]: Analyzing trace with hash 516937470, now seen corresponding path program 1 times [2025-04-26 16:58:56,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830287681] [2025-04-26 16:58:56,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:56,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:56,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,063 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:56,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:56,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,085 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,085 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,085 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,085 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,085 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:56,085 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,085 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,085 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,086 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc4v.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:56,086 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,086 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,113 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,113 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:56,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,115 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 16:58:56,116 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 16:58:56,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:56,118 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,136 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 16:58:56,138 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 16:58:56,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:56,139 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,206 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:56,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,211 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,211 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,211 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,211 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,211 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:56,211 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,211 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,211 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,211 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc4v.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:56,212 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,212 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,241 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,241 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:56,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,243 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 16:58:56,244 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 16:58:56,246 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 16:58:56,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:56,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:56,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:56,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:56,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:56,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:56,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:56,259 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:56,261 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:56,261 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:56,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,263 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 16:58:56,265 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 16:58:56,266 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:56,269 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 16:58:56,270 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:56,270 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:56,270 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:58:56,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,277 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:56,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:56,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:56,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:56,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:56,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,320 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,346 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 16:58:56,346 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:56,347 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2079 states and 4092 transitions. cyclomatic complexity: 2185 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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 16:58:56,447 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2079 states and 4092 transitions. cyclomatic complexity: 2185. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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 4625 states and 9038 transitions. Complement of second has 6 states. [2025-04-26 16:58:56,447 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 16:58:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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 16:58:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-26 16:58:56,448 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:58:56,448 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,448 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:58:56,448 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,448 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 16:58:56,448 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4625 states and 9038 transitions. [2025-04-26 16:58:56,481 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 183 [2025-04-26 16:58:56,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4625 states to 2897 states and 5632 transitions. [2025-04-26 16:58:56,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1110 [2025-04-26 16:58:56,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1288 [2025-04-26 16:58:56,504 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2897 states and 5632 transitions. [2025-04-26 16:58:56,504 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:56,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2897 states and 5632 transitions. [2025-04-26 16:58:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states and 5632 transitions. [2025-04-26 16:58:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2729. [2025-04-26 16:58:56,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2729 states have (on average 1.9637229754488823) internal successors, (in total 5359), 2728 states have internal predecessors, (5359), 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 16:58:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 5359 transitions. [2025-04-26 16:58:56,562 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2729 states and 5359 transitions. [2025-04-26 16:58:56,563 INFO L438 stractBuchiCegarLoop]: Abstraction has 2729 states and 5359 transitions. [2025-04-26 16:58:56,563 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:58:56,563 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2729 states and 5359 transitions. [2025-04-26 16:58:56,575 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 183 [2025-04-26 16:58:56,575 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:56,575 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:56,575 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:56,575 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:58:56,576 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L14: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[107] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[81] L27-->L32: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[83] L32-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[85] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[110] L14-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[87] L38-->L43: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[89] L43-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[91] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[113] L15-->L49: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:58:56,576 INFO L754 eck$LassoCheckResult]: Loop: "[94] L49-->L51: Formula: (< v_y1_1 v_z1_3) InVars {y1=v_y1_1, z1=v_z1_3} OutVars{y1=v_y1_1, z1=v_z1_3} AuxVars[] AssignedVars[]" "[96] L51-->L52: Formula: (= v_y1_2 (+ v_y1_3 1)) InVars {y1=v_y1_3} OutVars{y1=v_y1_2} AuxVars[] AssignedVars[y1]" "[98] L52-->L49: Formula: (= v_c_5 (+ v_c_6 1)) InVars {c=v_c_6} OutVars{c=v_c_5} AuxVars[] AssignedVars[c]" [2025-04-26 16:58:56,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1154838284, now seen corresponding path program 1 times [2025-04-26 16:58:56,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703614842] [2025-04-26 16:58:56,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:56,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:56,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:56,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:56,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,593 INFO L85 PathProgramCache]: Analyzing trace with hash 123199, now seen corresponding path program 1 times [2025-04-26 16:58:56,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183713188] [2025-04-26 16:58:56,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:56,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:56,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:56,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:56,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1099184276, now seen corresponding path program 1 times [2025-04-26 16:58:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014221222] [2025-04-26 16:58:56,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:58:56,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:58:56,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:58:56,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:58:56,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,634 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,635 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,635 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,635 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,635 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:56,635 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,635 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,635 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,635 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc4v.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:56,635 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,635 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,659 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,660 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:56,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,662 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 16:58:56,663 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 16:58:56,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:56,665 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,680 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 16:58:56,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,683 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 16:58:56,683 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 16:58:56,684 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:56,684 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,716 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:56,716 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 16:58:56,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:58:56,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,724 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 16:58:56,725 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 16:58:56,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:56,726 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:58:56,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,745 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 16:58:56,746 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 16:58:56,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:56,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,830 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:56,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:58:56,837 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,837 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,837 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,838 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,838 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:56,838 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,838 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,838 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,838 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc4v.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:56,838 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,838 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,871 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,872 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:56,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,874 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 16:58:56,875 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 16:58:56,876 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 16:58:56,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:56,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:56,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:56,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:56,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:56,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:56,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:56,889 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:58:56,895 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 16:58:56,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,897 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:56,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:58:56,899 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 16:58:56,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:56,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:56,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:56,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:56,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:56,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:56,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:56,913 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:56,917 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:56,918 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:56,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,920 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:56,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:58:56,923 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:56,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,926 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:56,927 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:56,927 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y1, z1) = -1*y1 + 1*z1 Supporting invariants [] [2025-04-26 16:58:56,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,934 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:56,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:56,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:56,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:56,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:56,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,975 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:57,008 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 16:58:57,009 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:57,009 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2729 states and 5359 transitions. cyclomatic complexity: 2808 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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 16:58:57,124 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2729 states and 5359 transitions. cyclomatic complexity: 2808. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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 6351 states and 12350 transitions. Complement of second has 6 states. [2025-04-26 16:58:57,124 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 16:58:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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 16:58:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-26 16:58:57,126 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:58:57,126 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,126 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 16:58:57,126 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,126 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 16:58:57,127 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6351 states and 12350 transitions. [2025-04-26 16:58:57,165 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 45 [2025-04-26 16:58:57,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6351 states to 3522 states and 6780 transitions. [2025-04-26 16:58:57,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1031 [2025-04-26 16:58:57,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1113 [2025-04-26 16:58:57,188 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3522 states and 6780 transitions. [2025-04-26 16:58:57,188 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:57,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3522 states and 6780 transitions. [2025-04-26 16:58:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3522 states and 6780 transitions. [2025-04-26 16:58:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3522 to 3416. [2025-04-26 16:58:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3416 states, 3416 states have (on average 1.9437939110070257) internal successors, (in total 6640), 3415 states have internal predecessors, (6640), 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 16:58:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 6640 transitions. [2025-04-26 16:58:57,253 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3416 states and 6640 transitions. [2025-04-26 16:58:57,253 INFO L438 stractBuchiCegarLoop]: Abstraction has 3416 states and 6640 transitions. [2025-04-26 16:58:57,253 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:58:57,253 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3416 states and 6640 transitions. [2025-04-26 16:58:57,266 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 45 [2025-04-26 16:58:57,266 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:57,267 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:57,267 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:57,267 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:58:57,268 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L14: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[107] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[81] L27-->L32: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[83] L32-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[85] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[110] L14-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[87] L38-->L43: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[89] L43-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[91] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[113] L15-->L49: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[93] L49-->L54: Formula: (<= v_z1_4 v_y1_4) InVars {y1=v_y1_4, z1=v_z1_4} OutVars{y1=v_y1_4, z1=v_z1_4} AuxVars[] AssignedVars[]" "[95] L54-->thread3FINAL: Formula: (= v_f_5 (+ v_f_6 1)) InVars {f=v_f_6} OutVars{f=v_f_5} AuxVars[] AssignedVars[f]" "[97] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[116] L16-->$Ultimate##0: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[99] $Ultimate##0-->L61-1: Formula: (< 2 v_f_8) InVars {f=v_f_8} OutVars{f=v_f_8} AuxVars[] AssignedVars[]" [2025-04-26 16:58:57,268 INFO L754 eck$LassoCheckResult]: Loop: "[101] L61-1-->L63: Formula: (< v_y2_1 v_z2_3) InVars {z2=v_z2_3, y2=v_y2_1} OutVars{z2=v_z2_3, y2=v_y2_1} AuxVars[] AssignedVars[]" "[103] L63-->L64: Formula: (= v_y2_2 (+ v_y2_3 1)) InVars {y2=v_y2_3} OutVars{y2=v_y2_2} AuxVars[] AssignedVars[y2]" "[104] L64-->L61-1: Formula: (= v_c_8 (+ v_c_7 1)) InVars {c=v_c_8} OutVars{c=v_c_7} AuxVars[] AssignedVars[c]" [2025-04-26 16:58:57,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash 244915002, now seen corresponding path program 1 times [2025-04-26 16:58:57,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:57,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950725491] [2025-04-26 16:58:57,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:57,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:57,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:58:57,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:58:57,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:57,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:58:57,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:58:57,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:57,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash 130149, now seen corresponding path program 1 times [2025-04-26 16:58:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:57,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046820334] [2025-04-26 16:58:57,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:57,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:57,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:57,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:57,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:57,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:57,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:57,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,290 INFO L85 PathProgramCache]: Analyzing trace with hash -886510964, now seen corresponding path program 1 times [2025-04-26 16:58:57,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:57,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271447406] [2025-04-26 16:58:57,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:57,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:57,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:58:57,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:58:57,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:57,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:58:57,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:58:57,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:57,331 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:57,331 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:57,331 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:57,331 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:57,331 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:57,331 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,331 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:57,331 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:57,331 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc4v.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:57,331 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:57,331 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:57,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:57,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:57,356 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:57,356 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:57,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,358 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:57,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:58:57,361 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:57,361 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:57,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:57,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,379 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:57,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:58:57,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:57,382 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:57,405 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:57,405 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=0}, {c=7}, {c=-8}] Lambdas: [0, 1, 1] Nus: [0, 0] [2025-04-26 16:58:57,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:57,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,413 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:57,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:58:57,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:57,417 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:57,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:57,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,436 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:57,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:58:57,438 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:57,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:57,503 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:57,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:57,507 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:57,507 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:57,507 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:57,507 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:57,507 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:57,508 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,508 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:57,508 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:57,508 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc4v.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:57,508 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:57,508 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:57,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:57,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:57,535 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:57,535 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:57,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,538 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:57,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:58:57,541 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 16:58:57,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:57,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:57,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:57,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:57,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:57,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:57,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:57,553 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:58:57,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:57,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,561 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:57,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:58:57,564 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 16:58:57,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:57,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:57,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:57,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:57,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:57,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:57,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:57,577 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:57,580 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:57,580 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:57,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,582 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:57,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:58:57,584 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:57,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:57,588 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:57,588 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:57,588 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, z2) = -1*y2 + 1*z2 Supporting invariants [] [2025-04-26 16:58:57,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:57,595 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:57,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:58:57,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:58:57,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:57,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:57,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:57,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:57,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:57,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:57,636 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:57,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:57,661 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 16:58:57,662 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:57,662 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3416 states and 6640 transitions. cyclomatic complexity: 3430 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 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 16:58:57,746 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3416 states and 6640 transitions. cyclomatic complexity: 3430. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 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 6573 states and 12574 transitions. Complement of second has 6 states. [2025-04-26 16:58:57,749 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 16:58:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 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 16:58:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-04-26 16:58:57,751 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 15 letters. Loop has 3 letters. [2025-04-26 16:58:57,751 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,752 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 16:58:57,752 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,752 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 15 letters. Loop has 6 letters. [2025-04-26 16:58:57,752 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6573 states and 12574 transitions. [2025-04-26 16:58:57,790 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:57,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6573 states to 0 states and 0 transitions. [2025-04-26 16:58:57,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:58:57,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:58:57,791 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:58:57,791 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:57,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:57,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:57,791 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:57,791 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:58:57,791 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:58:57,791 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:57,791 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:58:57,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:58:57,805 INFO L201 PluginConnector]: Adding new model pc4v.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:58:57 BoogieIcfgContainer [2025-04-26 16:58:57,805 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:58:57,806 INFO L158 Benchmark]: Toolchain (without parser) took 3753.05ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 84.9MB in the beginning and 91.5MB in the end (delta: -6.5MB). Peak memory consumption was 1.3MB. Max. memory is 8.0GB. [2025-04-26 16:58:57,806 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:57,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.32ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:57,806 INFO L158 Benchmark]: Boogie Preprocessor took 21.89ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:58:57,806 INFO L158 Benchmark]: RCFGBuilder took 166.86ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 72.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:58:57,807 INFO L158 Benchmark]: BuchiAutomizer took 3528.26ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 72.3MB in the beginning and 91.5MB in the end (delta: -19.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:57,808 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.14ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.32ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.89ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 166.86ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 72.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3528.26ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 72.3MB in the beginning and 91.5MB in the end (delta: -19.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 435 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.2s 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, 240 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 394 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 180 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp70 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 552, Number of transitions in reduction automaton: 3466, Number of states in reduction automaton: 1813, 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 + z1 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * y1 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + z2 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 16:58:57,821 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...