/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 ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sorted.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:22,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:22,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:22,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:22,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:22,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:22,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:22,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:22,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:22,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:22,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:22,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:22,634 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:22,634 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:22,634 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:22,634 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:22,634 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:22,634 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:22,635 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:22,635 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:22,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:22,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:22,636 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:22,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:22,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:22,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:22,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:22,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:22,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:22,636 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:22,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:22,636 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:22,636 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:22,636 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:22,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:22,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:22,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:22,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:22,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:22,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:22,637 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:22,637 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:22,637 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:22,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:22,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:22,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:22,952 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:22,952 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:22,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sorted.wvr.bpl [2025-04-26 18:41:22,955 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sorted.wvr.bpl' [2025-04-26 18:41:22,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:22,974 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:22,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:22,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:22,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:22,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,012 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:23,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:23,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:23,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:23,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:23,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:23,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:23,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:23,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:23,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:23,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:23,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:23,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:23,091 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:23,091 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:23,091 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:23,091 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:23,091 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:23,091 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:23,091 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:23,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:23,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:23,091 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:23,091 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:23,091 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:23,092 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:41:23,124 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:23,125 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:23,208 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:23,208 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:23,222 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:23,222 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:23,223 INFO L201 PluginConnector]: Adding new model sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:23 BoogieIcfgContainer [2025-04-26 18:41:23,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:23,223 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:23,223 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:23,228 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:23,228 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:23,229 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/2) ... [2025-04-26 18:41:23,232 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53dee614 and model type sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:23, skipping insertion in model container [2025-04-26 18:41:23,232 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:23,232 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:23" (2/2) ... [2025-04-26 18:41:23,233 INFO L376 chiAutomizerObserver]: Analyzing ICFG sorted.wvr.bpl [2025-04-26 18:41:23,292 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:41:23,330 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:23,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:23,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:23,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:23,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:23,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 18:41:23,402 INFO L116 PetriNetUnfolderBase]: 3/29 cut-off events. [2025-04-26 18:41:23,407 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:41:23,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 18:41:23,411 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 18:41:23,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2025-04-26 18:41:23,414 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 36 places, 29 transitions, 76 flow [2025-04-26 18:41:23,417 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 76 flow [2025-04-26 18:41:23,434 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 117 states, 115 states have (on average 2.756521739130435) internal successors, (in total 317), 116 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:23,435 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 117 states, 115 states have (on average 2.756521739130435) internal successors, (in total 317), 116 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:23,436 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:23,484 WARN L140 AmpleReduction]: Number of pruned transitions: 87 [2025-04-26 18:41:23,484 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:23,484 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 18:41:23,484 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:26 [2025-04-26 18:41:23,484 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:51 [2025-04-26 18:41:23,484 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 18:41:23,484 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:7 [2025-04-26 18:41:23,484 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:23,485 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 117 states, 115 states have (on average 2.0) internal successors, (in total 230), 116 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:23,493 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:23,494 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:23,494 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:23,494 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:23,494 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:23,494 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:23,494 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:23,494 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:23,495 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 117 states, 115 states have (on average 2.0) internal successors, (in total 230), 116 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:23,512 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:41:23,512 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:23,512 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:23,515 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:23,515 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:23,515 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:23,515 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 117 states, 115 states have (on average 2.0) internal successors, (in total 230), 116 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:23,519 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:41:23,519 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:23,519 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:23,519 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:23,519 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:23,523 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[48] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[68] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[50] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[45] L59-->L60: Formula: v_sorted1_3 InVars {sorted1=v_sorted1_3} OutVars{sorted1=v_sorted1_3} AuxVars[] AssignedVars[]" "[63] L60-->L61: Formula: v_sorted2_3 InVars {sorted2=v_sorted2_3} OutVars{sorted2=v_sorted2_3} AuxVars[] AssignedVars[]" "[46] L61-->L62: Formula: v_sorted3_1 InVars {sorted3=v_sorted3_1} OutVars{sorted3=v_sorted3_1} AuxVars[] AssignedVars[]" "[87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:23,523 INFO L754 eck$LassoCheckResult]: Loop: "[74] L23-1-->L23: Formula: (< (+ v_i_1 1) v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[76] L23-->L23-1: Formula: (let ((.cse0 (+ v_i_8 1))) (and (= .cse0 v_i_7) (let ((.cse2 (select v_A_4 v_i_8)) (.cse1 (select v_A_4 .cse0))) (or (and (or (not v_sorted1_6) (<= .cse1 .cse2)) (not v_sorted1_5)) (and (< .cse2 .cse1) v_sorted1_6 v_sorted1_5))))) InVars {A=v_A_4, i=v_i_8, sorted1=v_sorted1_6} OutVars{A=v_A_4, i=v_i_7, sorted1=v_sorted1_5} AuxVars[] AssignedVars[i, sorted1]" [2025-04-26 18:41:23,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1101224648, now seen corresponding path program 1 times [2025-04-26 18:41:23,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:23,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310332718] [2025-04-26 18:41:23,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:23,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:23,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:23,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:23,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:23,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:23,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:23,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:23,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2025-04-26 18:41:23,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:23,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891139283] [2025-04-26 18:41:23,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:23,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:23,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:23,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:23,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:23,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:23,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:23,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:23,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1714929542, now seen corresponding path program 1 times [2025-04-26 18:41:23,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:23,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161653869] [2025-04-26 18:41:23,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:23,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:23,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:23,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:23,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:23,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:23,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:23,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:23,868 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:23,868 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:23,868 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:23,869 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:23,869 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:23,869 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:23,869 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:23,869 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:23,869 INFO L132 ssoRankerPreferences]: Filename of dumped script: sorted.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:23,869 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:23,869 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:23,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,172 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:24,175 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:24,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:24,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:41:24,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:24,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,209 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:24,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:41:24,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:24,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,238 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:41:24,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:24,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:41:24,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:24,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,266 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,274 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:24,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:41:24,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:24,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,295 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:24,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:41:24,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:24,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,316 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:41:24,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,336 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 18:41:24,336 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:41:24,357 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:41:24,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,364 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:24,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:41:24,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:24,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,386 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:24,409 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 18:41:24,409 INFO L437 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:41:24,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,412 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:24,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:41:24,415 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:24,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,432 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:24,432 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:24,433 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 18:41:24,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:41:24,443 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:24,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:24,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:24,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:24,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:24,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:24,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:24,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:24,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:24,500 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:24,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:24,534 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:24,535 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 117 states, 115 states have (on average 2.0) internal successors, (in total 230), 116 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:24,633 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 117 states, 115 states have (on average 2.0) internal successors, (in total 230), 116 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 263 states and 532 transitions. Complement of second has 7 states. [2025-04-26 18:41:24,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2025-04-26 18:41:24,644 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:41:24,645 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,645 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:41:24,645 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,645 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:41:24,645 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 532 transitions. [2025-04-26 18:41:24,651 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:24,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 122 states and 244 transitions. [2025-04-26 18:41:24,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-04-26 18:41:24,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2025-04-26 18:41:24,655 INFO L74 IsDeterministic]: Start isDeterministic. Operand 122 states and 244 transitions. [2025-04-26 18:41:24,655 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:24,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 244 transitions. [2025-04-26 18:41:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 244 transitions. [2025-04-26 18:41:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2025-04-26 18:41:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.9906542056074767) internal successors, (in total 213), 106 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 213 transitions. [2025-04-26 18:41:24,678 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 213 transitions. [2025-04-26 18:41:24,678 INFO L438 stractBuchiCegarLoop]: Abstraction has 107 states and 213 transitions. [2025-04-26 18:41:24,678 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:24,680 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 213 transitions. [2025-04-26 18:41:24,683 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:24,683 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:24,683 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:24,683 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:24,683 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:24,684 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[48] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[68] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[50] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[45] L59-->L60: Formula: v_sorted1_3 InVars {sorted1=v_sorted1_3} OutVars{sorted1=v_sorted1_3} AuxVars[] AssignedVars[]" "[63] L60-->L61: Formula: v_sorted2_3 InVars {sorted2=v_sorted2_3} OutVars{sorted2=v_sorted2_3} AuxVars[] AssignedVars[]" "[46] L61-->L62: Formula: v_sorted3_1 InVars {sorted3=v_sorted3_1} OutVars{sorted3=v_sorted3_1} AuxVars[] AssignedVars[]" "[87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L23-1-->thread1FINAL: Formula: (<= v_N_2 (+ v_i_5 1)) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[75] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[90] L62-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:41:24,684 INFO L754 eck$LassoCheckResult]: Loop: "[78] L34-1-->L34: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[80] L34-->L34-1: Formula: (let ((.cse0 (+ v_j_8 1))) (and (= .cse0 v_j_7) (let ((.cse2 (select v_A_6 .cse0)) (.cse1 (select v_A_6 v_j_8))) (or (and (< .cse1 .cse2) v_sorted2_5 v_sorted2_6) (and (or (not v_sorted2_6) (<= .cse2 .cse1)) (not v_sorted2_5)))))) InVars {A=v_A_6, sorted2=v_sorted2_6, j=v_j_8} OutVars{A=v_A_6, sorted2=v_sorted2_5, j=v_j_7} AuxVars[] AssignedVars[j, sorted2]" [2025-04-26 18:41:24,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1623209152, now seen corresponding path program 1 times [2025-04-26 18:41:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:24,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730045662] [2025-04-26 18:41:24,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:24,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:24,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:24,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:24,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:24,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:24,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:24,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,696 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2025-04-26 18:41:24,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:24,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9584667] [2025-04-26 18:41:24,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:24,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:24,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:24,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:24,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:24,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:24,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:24,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,709 INFO L85 PathProgramCache]: Analyzing trace with hash -830864126, now seen corresponding path program 1 times [2025-04-26 18:41:24,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:24,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149832212] [2025-04-26 18:41:24,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:24,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:24,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:24,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:24,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:24,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149832212] [2025-04-26 18:41:24,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149832212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:24,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:24,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:41:24,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504711020] [2025-04-26 18:41:24,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:24,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:24,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:41:24,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:41:24,854 INFO L87 Difference]: Start difference. First operand 107 states and 213 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 5 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 18:41:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:24,925 INFO L93 Difference]: Finished difference Result 120 states and 229 transitions. [2025-04-26 18:41:24,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 229 transitions. [2025-04-26 18:41:24,927 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 48 [2025-04-26 18:41:24,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 229 transitions. [2025-04-26 18:41:24,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2025-04-26 18:41:24,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2025-04-26 18:41:24,928 INFO L74 IsDeterministic]: Start isDeterministic. Operand 120 states and 229 transitions. [2025-04-26 18:41:24,928 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:24,928 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120 states and 229 transitions. [2025-04-26 18:41:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 229 transitions. [2025-04-26 18:41:24,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2025-04-26 18:41:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.9636363636363636) internal successors, (in total 216), 109 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 216 transitions. [2025-04-26 18:41:24,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 216 transitions. [2025-04-26 18:41:24,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:41:24,938 INFO L438 stractBuchiCegarLoop]: Abstraction has 110 states and 216 transitions. [2025-04-26 18:41:24,938 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:24,939 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 216 transitions. [2025-04-26 18:41:24,939 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:24,939 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:24,939 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:24,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:24,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:24,940 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[48] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[68] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[50] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[45] L59-->L60: Formula: v_sorted1_3 InVars {sorted1=v_sorted1_3} OutVars{sorted1=v_sorted1_3} AuxVars[] AssignedVars[]" "[63] L60-->L61: Formula: v_sorted2_3 InVars {sorted2=v_sorted2_3} OutVars{sorted2=v_sorted2_3} AuxVars[] AssignedVars[]" "[46] L61-->L62: Formula: v_sorted3_1 InVars {sorted3=v_sorted3_1} OutVars{sorted3=v_sorted3_1} AuxVars[] AssignedVars[]" "[87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] L23-1-->L23: Formula: (< (+ v_i_1 1) v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[90] L62-1-->L34-1: 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]" "[76] L23-->L23-1: Formula: (let ((.cse0 (+ v_i_8 1))) (and (= .cse0 v_i_7) (let ((.cse2 (select v_A_4 v_i_8)) (.cse1 (select v_A_4 .cse0))) (or (and (or (not v_sorted1_6) (<= .cse1 .cse2)) (not v_sorted1_5)) (and (< .cse2 .cse1) v_sorted1_6 v_sorted1_5))))) InVars {A=v_A_4, i=v_i_8, sorted1=v_sorted1_6} OutVars{A=v_A_4, i=v_i_7, sorted1=v_sorted1_5} AuxVars[] AssignedVars[i, sorted1]" "[73] L23-1-->thread1FINAL: Formula: (<= v_N_2 (+ v_i_5 1)) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:24,940 INFO L754 eck$LassoCheckResult]: Loop: "[78] L34-1-->L34: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[80] L34-->L34-1: Formula: (let ((.cse0 (+ v_j_8 1))) (and (= .cse0 v_j_7) (let ((.cse2 (select v_A_6 .cse0)) (.cse1 (select v_A_6 v_j_8))) (or (and (< .cse1 .cse2) v_sorted2_5 v_sorted2_6) (and (or (not v_sorted2_6) (<= .cse2 .cse1)) (not v_sorted2_5)))))) InVars {A=v_A_6, sorted2=v_sorted2_6, j=v_j_8} OutVars{A=v_A_6, sorted2=v_sorted2_5, j=v_j_7} AuxVars[] AssignedVars[j, sorted2]" [2025-04-26 18:41:24,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1220167685, now seen corresponding path program 1 times [2025-04-26 18:41:24,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:24,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378421000] [2025-04-26 18:41:24,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:24,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:24,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:24,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:24,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,953 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:24,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:24,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:24,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:24,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,961 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 2 times [2025-04-26 18:41:24,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:24,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732357347] [2025-04-26 18:41:24,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:24,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:24,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:24,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:24,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:24,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:24,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:24,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:24,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash 55075975, now seen corresponding path program 1 times [2025-04-26 18:41:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:24,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034073839] [2025-04-26 18:41:24,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:24,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:24,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:24,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:24,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:24,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:24,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:24,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:25,216 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:25,217 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:25,217 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:25,217 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:25,217 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:25,217 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:25,217 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:25,217 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:25,217 INFO L132 ssoRankerPreferences]: Filename of dumped script: sorted.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:41:25,217 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:25,217 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:25,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,523 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:25,524 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:25,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:25,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:25,526 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:25,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:41:25,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:25,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:25,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:25,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:25,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:25,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:25,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:25,542 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:25,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:41:25,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:25,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:25,549 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:25,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:41:25,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 18:41:25,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:25,562 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:41:25,563 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:41:25,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:25,578 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-04-26 18:41:25,579 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:41:25,606 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:25,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:41:25,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:25,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:25,615 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:25,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:41:25,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:25,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:25,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:25,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:25,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:25,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:25,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:25,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:25,640 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:25,640 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:41:25,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:25,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:25,642 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:25,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:41:25,643 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:25,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:41:25,658 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:25,659 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:25,659 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 18:41:25,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:41:25,665 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:25,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:25,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:25,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:25,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:25,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:25,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:25,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:25,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:25,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:25,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:25,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:25,706 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:25,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:25,716 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:25,716 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 216 transitions. cyclomatic complexity: 133 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:25,767 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 216 transitions. cyclomatic complexity: 133. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 241 states and 500 transitions. Complement of second has 6 states. [2025-04-26 18:41:25,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-04-26 18:41:25,770 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:41:25,770 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:25,770 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:41:25,770 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:25,771 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 18:41:25,771 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:25,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 500 transitions. [2025-04-26 18:41:25,774 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:41:25,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 141 states and 274 transitions. [2025-04-26 18:41:25,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2025-04-26 18:41:25,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2025-04-26 18:41:25,776 INFO L74 IsDeterministic]: Start isDeterministic. Operand 141 states and 274 transitions. [2025-04-26 18:41:25,776 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:25,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 141 states and 274 transitions. [2025-04-26 18:41:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 274 transitions. [2025-04-26 18:41:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2025-04-26 18:41:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 2.0256410256410255) internal successors, (in total 237), 116 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 237 transitions. [2025-04-26 18:41:25,783 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 237 transitions. [2025-04-26 18:41:25,783 INFO L438 stractBuchiCegarLoop]: Abstraction has 117 states and 237 transitions. [2025-04-26 18:41:25,783 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:25,783 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 237 transitions. [2025-04-26 18:41:25,785 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:41:25,785 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:25,786 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:25,786 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:25,786 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:25,787 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[48] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[68] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[50] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[45] L59-->L60: Formula: v_sorted1_3 InVars {sorted1=v_sorted1_3} OutVars{sorted1=v_sorted1_3} AuxVars[] AssignedVars[]" "[63] L60-->L61: Formula: v_sorted2_3 InVars {sorted2=v_sorted2_3} OutVars{sorted2=v_sorted2_3} AuxVars[] AssignedVars[]" "[46] L61-->L62: Formula: v_sorted3_1 InVars {sorted3=v_sorted3_1} OutVars{sorted3=v_sorted3_1} AuxVars[] AssignedVars[]" "[87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L23-1-->thread1FINAL: Formula: (<= v_N_2 (+ v_i_5 1)) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[75] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[90] L62-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[77] L34-1-->thread2FINAL: Formula: (<= v_M_2 v_j_5) InVars {M=v_M_2, j=v_j_5} OutVars{M=v_M_2, j=v_j_5} AuxVars[] AssignedVars[]" "[79] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[93] L63-->L45-1: 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 18:41:25,787 INFO L754 eck$LassoCheckResult]: Loop: "[82] L45-1-->L45: Formula: (< (+ v_k_2 1) v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[84] L45-->L45-1: Formula: (let ((.cse0 (+ v_k_8 1))) (and (= .cse0 v_k_7) (let ((.cse2 (select v_A_8 v_k_8)) (.cse1 (select v_A_8 .cse0))) (or (and (not v_sorted3_5) (or (not v_sorted3_6) (<= .cse1 .cse2))) (and (< .cse2 .cse1) v_sorted3_5 v_sorted3_6))))) InVars {A=v_A_8, k=v_k_8, sorted3=v_sorted3_6} OutVars{A=v_A_8, k=v_k_7, sorted3=v_sorted3_5} AuxVars[] AssignedVars[k, sorted3]" [2025-04-26 18:41:25,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:25,788 INFO L85 PathProgramCache]: Analyzing trace with hash 13014971, now seen corresponding path program 1 times [2025-04-26 18:41:25,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:25,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161954873] [2025-04-26 18:41:25,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:25,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:25,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:25,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:25,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:25,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:25,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:25,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:25,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:25,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:25,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:25,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:25,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash 3587, now seen corresponding path program 1 times [2025-04-26 18:41:25,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:25,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492279621] [2025-04-26 18:41:25,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:25,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:25,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:25,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:25,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:25,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:25,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:25,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:25,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:25,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:25,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:25,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:25,814 INFO L85 PathProgramCache]: Analyzing trace with hash -377512131, now seen corresponding path program 1 times [2025-04-26 18:41:25,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:25,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901927591] [2025-04-26 18:41:25,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:25,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:25,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:41:25,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:41:25,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:25,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:25,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:25,907 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901927591] [2025-04-26 18:41:25,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901927591] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:25,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:25,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:41:25,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683223181] [2025-04-26 18:41:25,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:25,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:25,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:41:25,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:41:25,956 INFO L87 Difference]: Start difference. First operand 117 states and 237 transitions. cyclomatic complexity: 139 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (in total 16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:26,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:26,018 INFO L93 Difference]: Finished difference Result 124 states and 244 transitions. [2025-04-26 18:41:26,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 244 transitions. [2025-04-26 18:41:26,019 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:41:26,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 118 states and 238 transitions. [2025-04-26 18:41:26,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-04-26 18:41:26,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 18:41:26,020 INFO L74 IsDeterministic]: Start isDeterministic. Operand 118 states and 238 transitions. [2025-04-26 18:41:26,020 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:26,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 118 states and 238 transitions. [2025-04-26 18:41:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 238 transitions. [2025-04-26 18:41:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2025-04-26 18:41:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 2.0258620689655173) internal successors, (in total 235), 115 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 235 transitions. [2025-04-26 18:41:26,028 INFO L240 hiAutomatonCegarLoop]: Abstraction has 116 states and 235 transitions. [2025-04-26 18:41:26,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:41:26,030 INFO L438 stractBuchiCegarLoop]: Abstraction has 116 states and 235 transitions. [2025-04-26 18:41:26,030 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:26,030 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 235 transitions. [2025-04-26 18:41:26,032 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:41:26,032 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:26,032 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:26,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:26,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:26,032 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[48] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[68] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[50] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[45] L59-->L60: Formula: v_sorted1_3 InVars {sorted1=v_sorted1_3} OutVars{sorted1=v_sorted1_3} AuxVars[] AssignedVars[]" "[63] L60-->L61: Formula: v_sorted2_3 InVars {sorted2=v_sorted2_3} OutVars{sorted2=v_sorted2_3} AuxVars[] AssignedVars[]" "[46] L61-->L62: Formula: v_sorted3_1 InVars {sorted3=v_sorted3_1} OutVars{sorted3=v_sorted3_1} AuxVars[] AssignedVars[]" "[87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] L23-1-->L23: Formula: (< (+ v_i_1 1) v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[90] L62-1-->L34-1: 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]" "[76] L23-->L23-1: Formula: (let ((.cse0 (+ v_i_8 1))) (and (= .cse0 v_i_7) (let ((.cse2 (select v_A_4 v_i_8)) (.cse1 (select v_A_4 .cse0))) (or (and (or (not v_sorted1_6) (<= .cse1 .cse2)) (not v_sorted1_5)) (and (< .cse2 .cse1) v_sorted1_6 v_sorted1_5))))) InVars {A=v_A_4, i=v_i_8, sorted1=v_sorted1_6} OutVars{A=v_A_4, i=v_i_7, sorted1=v_sorted1_5} AuxVars[] AssignedVars[i, sorted1]" "[93] L63-->L45-1: 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]" "[73] L23-1-->thread1FINAL: Formula: (<= v_N_2 (+ v_i_5 1)) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[77] L34-1-->thread2FINAL: Formula: (<= v_M_2 v_j_5) InVars {M=v_M_2, j=v_j_5} OutVars{M=v_M_2, j=v_j_5} AuxVars[] AssignedVars[]" [2025-04-26 18:41:26,032 INFO L754 eck$LassoCheckResult]: Loop: "[82] L45-1-->L45: Formula: (< (+ v_k_2 1) v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[84] L45-->L45-1: Formula: (let ((.cse0 (+ v_k_8 1))) (and (= .cse0 v_k_7) (let ((.cse2 (select v_A_8 v_k_8)) (.cse1 (select v_A_8 .cse0))) (or (and (not v_sorted3_5) (or (not v_sorted3_6) (<= .cse1 .cse2))) (and (< .cse2 .cse1) v_sorted3_5 v_sorted3_6))))) InVars {A=v_A_8, k=v_k_8, sorted3=v_sorted3_6} OutVars{A=v_A_8, k=v_k_7, sorted3=v_sorted3_5} AuxVars[] AssignedVars[k, sorted3]" [2025-04-26 18:41:26,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:26,033 INFO L85 PathProgramCache]: Analyzing trace with hash 55095037, now seen corresponding path program 1 times [2025-04-26 18:41:26,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:26,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246064123] [2025-04-26 18:41:26,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:26,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:26,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:26,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:26,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:26,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:26,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:26,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:26,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash 3587, now seen corresponding path program 2 times [2025-04-26 18:41:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:26,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590247720] [2025-04-26 18:41:26,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:26,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:26,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:26,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:26,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:26,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:26,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:26,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:26,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:26,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1406725631, now seen corresponding path program 1 times [2025-04-26 18:41:26,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:26,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671286711] [2025-04-26 18:41:26,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:26,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:26,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:41:26,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:41:26,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,078 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:26,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:41:26,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:41:26,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:26,291 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:26,291 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:26,291 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:26,291 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:26,291 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:26,291 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,291 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:26,291 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:26,291 INFO L132 ssoRankerPreferences]: Filename of dumped script: sorted.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:41:26,291 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:26,291 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:26,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,556 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:26,556 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:26,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,560 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:26,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:41:26,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:26,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:26,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:26,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:26,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:26,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:26,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:26,575 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:26,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:41:26,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,582 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:26,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:41:26,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:26,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:26,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:26,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:26,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:26,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:26,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:26,596 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:26,601 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 18:41:26,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,603 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:26,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:26,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:26,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:26,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:26,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:26,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:26,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:26,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:26,619 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:26,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:41:26,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,626 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:26,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:41:26,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:26,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:26,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:26,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:26,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:26,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:26,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:26,642 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:26,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:26,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,650 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:26,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:41:26,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:26,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:26,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:26,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:26,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:26,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:26,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:26,666 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:26,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:26,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,673 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 18:41:26,674 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 18:41:26,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:26,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:26,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:26,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:26,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:26,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:26,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:26,688 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:26,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:41:26,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,696 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 18:41:26,697 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 18:41:26,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:26,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:26,708 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:41:26,708 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:41:26,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:26,720 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-04-26 18:41:26,720 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:41:26,746 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:26,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:41:26,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,755 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 18:41:26,755 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 18:41:26,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:26,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:26,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:26,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:26,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:26,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:26,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:26,771 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:26,777 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:26,777 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:26,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,779 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 18:41:26,781 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 18:41:26,782 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:26,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:41:26,797 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:26,797 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:26,798 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 18:41:26,803 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 18:41:26,809 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:26,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:26,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:26,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:26,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:26,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:26,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:26,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:26,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:26,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:26,848 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:26,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:26,861 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:26,861 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 235 transitions. cyclomatic complexity: 138 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:26,901 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 235 transitions. cyclomatic complexity: 138. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 219 states and 426 transitions. Complement of second has 6 states. [2025-04-26 18:41:26,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-26 18:41:26,902 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:41:26,902 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:26,902 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 18:41:26,902 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:26,902 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 18:41:26,902 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:26,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 426 transitions. [2025-04-26 18:41:26,904 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:26,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 0 states and 0 transitions. [2025-04-26 18:41:26,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:26,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:26,904 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:26,905 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:26,905 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:26,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:26,905 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:26,905 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:26,905 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:26,905 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:26,905 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:26,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:41:26,916 INFO L201 PluginConnector]: Adding new model sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:26 BoogieIcfgContainer [2025-04-26 18:41:26,916 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:26,916 INFO L158 Benchmark]: Toolchain (without parser) took 3942.03ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 87.1MB in the beginning and 67.5MB in the end (delta: 19.6MB). Peak memory consumption was 31.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:26,916 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.71ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:26,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.69ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 85.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:26,917 INFO L158 Benchmark]: Boogie Preprocessor took 26.94ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 84.1MB in the end (delta: 921.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:26,917 INFO L158 Benchmark]: RCFGBuilder took 181.59ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 72.9MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:26,917 INFO L158 Benchmark]: BuchiAutomizer took 3692.34ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 72.9MB in the beginning and 67.5MB in the end (delta: 5.4MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. [2025-04-26 18:41:26,918 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.71ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.69ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 85.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.94ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 84.1MB in the end (delta: 921.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 181.59ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 72.9MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3692.34ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 72.9MB in the beginning and 67.5MB in the end (delta: 5.4MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 51 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 212 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 236 IncrementalHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 75 mSDtfsCounter, 236 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital90 mio100 ax100 hnf100 lsp120 ukn56 mio100 lsp64 div100 bol131 ite100 ukn100 eq117 hnf95 smp100 dnf281 smp49 tf100 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 57ms VariablesStem: 7 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 36 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 158, Number of transitions in reduction automaton: 230, Number of states in reduction automaton: 117, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:26,931 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...