/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/bench/exp3x3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:31,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:31,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:31,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:31,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:31,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:31,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:31,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:31,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:31,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:31,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:31,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:31,842 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:31,843 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:31,843 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:31,843 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:31,843 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:31,843 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:31,843 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:31,843 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:31,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:31,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:31,844 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:31,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:31,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:31,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:31,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:31,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:31,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:31,844 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:31,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:31,844 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:31,844 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:31,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:31,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:31,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:31,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:31,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:31,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:31,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:31,845 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:31,845 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:31,845 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:32,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:32,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:32,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:32,100 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:32,100 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:32,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp3x3.wvr.bpl [2025-04-26 16:54:32,101 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp3x3.wvr.bpl' [2025-04-26 16:54:32,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:32,117 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:32,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:32,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:32,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:32,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,148 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:32,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:32,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:32,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:32,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:32,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:32,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:32,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:32,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:32,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:32,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:32,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:54:32,237 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:32,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:32,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:32,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:54:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:54:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:54:32,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:54:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:54:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:54:32,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:54:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:54:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:54:32,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:54:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:54:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:54:32,239 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:54:32,277 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:32,279 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:32,389 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:32,389 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:32,397 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:32,397 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:54:32,397 INFO L201 PluginConnector]: Adding new model exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:32 BoogieIcfgContainer [2025-04-26 16:54:32,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:32,398 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:32,398 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:32,402 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:32,402 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:32,403 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/2) ... [2025-04-26 16:54:32,403 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@100b6c65 and model type exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:32, skipping insertion in model container [2025-04-26 16:54:32,404 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:32,404 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:32" (2/2) ... [2025-04-26 16:54:32,404 INFO L376 chiAutomizerObserver]: Analyzing ICFG exp3x3.wvr.bpl [2025-04-26 16:54:32,475 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:54:32,505 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:32,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:32,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:32,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:54:32,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 53 transitions, 148 flow [2025-04-26 16:54:32,582 INFO L116 PetriNetUnfolderBase]: 6/41 cut-off events. [2025-04-26 16:54:32,583 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:54:32,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 41 events. 6/41 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-26 16:54:32,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 53 transitions, 148 flow [2025-04-26 16:54:32,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 41 transitions, 118 flow [2025-04-26 16:54:32,590 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 54 places, 41 transitions, 118 flow [2025-04-26 16:54:32,595 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:33,722 WARN L140 AmpleReduction]: Number of pruned transitions: 15147 [2025-04-26 16:54:33,723 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:54:33,723 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3312 [2025-04-26 16:54:33,723 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:35 [2025-04-26 16:54:33,724 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:3483 [2025-04-26 16:54:33,724 WARN L145 AmpleReduction]: Times succ was already a loop node:9330 [2025-04-26 16:54:33,724 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1260 [2025-04-26 16:54:33,724 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:33,758 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 6831 states, 6829 states have (on average 3.6473861473129303) internal successors, (in total 24908), 6830 states have internal predecessors, (24908), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:33,766 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:33,766 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:33,766 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:33,766 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:33,766 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:33,766 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:33,766 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:33,766 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:33,793 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6831 states, 6829 states have (on average 3.6473861473129303) internal successors, (in total 24908), 6830 states have internal predecessors, (24908), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:33,985 INFO L131 ngComponentsAnalysis]: Automaton has 1267 accepting balls. 6636 [2025-04-26 16:54:33,985 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:33,985 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:33,989 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:33,989 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:33,989 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:34,008 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6831 states, 6829 states have (on average 3.6473861473129303) internal successors, (in total 24908), 6830 states have internal predecessors, (24908), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:34,107 INFO L131 ngComponentsAnalysis]: Automaton has 1267 accepting balls. 6636 [2025-04-26 16:54:34,107 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:34,107 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:34,107 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:34,107 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:34,112 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" [2025-04-26 16:54:34,112 INFO L754 eck$LassoCheckResult]: Loop: "[101] L20-->L21: Formula: (< v_x1_1 v_n_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[103] L21-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:54:34,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash 3985, now seen corresponding path program 1 times [2025-04-26 16:54:34,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:34,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538142053] [2025-04-26 16:54:34,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:34,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:34,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:34,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:34,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:34,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:34,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:34,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:34,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 16:54:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:34,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777260835] [2025-04-26 16:54:34,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:34,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:34,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:34,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:34,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,213 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:34,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:34,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:34,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:34,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:34,219 INFO L85 PathProgramCache]: Analyzing trace with hash 3832819, now seen corresponding path program 1 times [2025-04-26 16:54:34,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:34,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282200412] [2025-04-26 16:54:34,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:34,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:34,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:34,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,228 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:34,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:34,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:34,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:34,436 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:34,437 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:34,437 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:34,437 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:34,437 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:34,437 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,438 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:34,438 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:34,438 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:34,438 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:34,438 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:34,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,552 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:34,553 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:34,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:34,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:34,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:54:34,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:34,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:34,575 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:34,575 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork5_thidvar0=0} Honda state: {thread1Thread1of1ForFork5_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:34,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:54:34,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:34,585 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:34,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:54:34,588 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:34,588 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:34,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:34,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:34,618 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:34,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:54:34,621 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:34,621 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:34,700 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:34,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:34,705 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:34,705 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:34,705 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:34,705 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:34,705 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:34,705 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,705 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:34,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:34,705 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:34,705 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:34,705 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:34,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,791 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:34,794 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:34,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:34,797 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:34,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:54:34,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:34,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:34,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:34,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:34,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:34,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:34,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:34,823 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:34,830 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 16:54:34,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:34,833 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:34,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:54:34,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:34,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:34,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:34,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:34,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:34,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:34,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:34,859 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:34,866 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:54:34,866 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:34,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:34,869 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:34,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:54:34,871 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:34,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:34,888 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:54:34,889 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:34,889 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, n) = -1*x1 + 1*n Supporting invariants [1*x1 - 1 >= 0] [2025-04-26 16:54:34,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:34,901 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:34,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:34,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:34,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:34,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:34,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:54:34,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:34,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:34,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:34,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:34,962 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:34,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:35,015 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 16:54:35,034 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 6831 states, 6829 states have (on average 3.6473861473129303) internal successors, (in total 24908), 6830 states have internal predecessors, (24908), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:35,467 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 6831 states, 6829 states have (on average 3.6473861473129303) internal successors, (in total 24908), 6830 states have internal predecessors, (24908), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 16383 states and 59498 transitions. Complement of second has 8 states. [2025-04-26 16:54:35,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-04-26 16:54:35,478 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 92 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:54:35,479 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:35,479 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 92 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:54:35,479 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:35,479 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 92 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:54:35,479 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:35,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16383 states and 59498 transitions. [2025-04-26 16:54:35,759 INFO L131 ngComponentsAnalysis]: Automaton has 903 accepting balls. 3906 [2025-04-26 16:54:35,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16383 states to 9299 states and 33695 transitions. [2025-04-26 16:54:35,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3968 [2025-04-26 16:54:35,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5967 [2025-04-26 16:54:35,973 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9299 states and 33695 transitions. [2025-04-26 16:54:35,974 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:35,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9299 states and 33695 transitions. [2025-04-26 16:54:36,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9299 states and 33695 transitions. [2025-04-26 16:54:36,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9299 to 7969. [2025-04-26 16:54:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7969 states, 7969 states have (on average 3.619400175680763) internal successors, (in total 28843), 7968 states have internal predecessors, (28843), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7969 states to 7969 states and 28843 transitions. [2025-04-26 16:54:36,377 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7969 states and 28843 transitions. [2025-04-26 16:54:36,377 INFO L438 stractBuchiCegarLoop]: Abstraction has 7969 states and 28843 transitions. [2025-04-26 16:54:36,377 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:36,377 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7969 states and 28843 transitions. [2025-04-26 16:54:36,440 INFO L131 ngComponentsAnalysis]: Automaton has 903 accepting balls. 3906 [2025-04-26 16:54:36,440 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:36,440 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:36,441 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:54:36,441 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:36,442 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:54:36,442 INFO L754 eck$LassoCheckResult]: Loop: "[105] L28-->L29: Formula: (< v_x2_1 v_n_3) InVars {x2=v_x2_1, n=v_n_3} OutVars{x2=v_x2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[107] L29-->L28: Formula: (= v_x2_2 (* v_x2_3 2)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:54:36,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:36,442 INFO L85 PathProgramCache]: Analyzing trace with hash 118816523, now seen corresponding path program 1 times [2025-04-26 16:54:36,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:36,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755073893] [2025-04-26 16:54:36,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:36,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:36,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:36,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:36,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:36,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:36,450 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:36,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:36,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:36,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:36,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:36,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:36,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:36,459 INFO L85 PathProgramCache]: Analyzing trace with hash 4323, now seen corresponding path program 1 times [2025-04-26 16:54:36,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:36,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920520988] [2025-04-26 16:54:36,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:36,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:36,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:36,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:36,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:36,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:36,465 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:36,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:36,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:36,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:36,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:36,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:36,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:36,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1781435027, now seen corresponding path program 1 times [2025-04-26 16:54:36,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:36,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002924723] [2025-04-26 16:54:36,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:36,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:36,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:36,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:36,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:36,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:36,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:36,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002924723] [2025-04-26 16:54:36,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002924723] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:36,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:36,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:54:36,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484292051] [2025-04-26 16:54:36,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:36,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:54:36,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:54:36,549 INFO L87 Difference]: Start difference. First operand 7969 states and 28843 transitions. cyclomatic complexity: 22109 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:36,786 INFO L93 Difference]: Finished difference Result 8850 states and 31406 transitions. [2025-04-26 16:54:36,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8850 states and 31406 transitions. [2025-04-26 16:54:36,844 INFO L131 ngComponentsAnalysis]: Automaton has 1148 accepting balls. 4766 [2025-04-26 16:54:36,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8850 states to 8850 states and 31406 transitions. [2025-04-26 16:54:36,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5516 [2025-04-26 16:54:36,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5516 [2025-04-26 16:54:36,969 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8850 states and 31406 transitions. [2025-04-26 16:54:36,969 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:36,969 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8850 states and 31406 transitions. [2025-04-26 16:54:36,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8850 states and 31406 transitions. [2025-04-26 16:54:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8850 to 7972. [2025-04-26 16:54:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7972 states, 7972 states have (on average 3.6184144505770197) internal successors, (in total 28846), 7971 states have internal predecessors, (28846), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7972 states to 7972 states and 28846 transitions. [2025-04-26 16:54:37,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7972 states and 28846 transitions. [2025-04-26 16:54:37,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:54:37,169 INFO L438 stractBuchiCegarLoop]: Abstraction has 7972 states and 28846 transitions. [2025-04-26 16:54:37,169 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:37,169 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7972 states and 28846 transitions. [2025-04-26 16:54:37,203 INFO L131 ngComponentsAnalysis]: Automaton has 903 accepting balls. 3906 [2025-04-26 16:54:37,203 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:37,203 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:37,204 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:54:37,204 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:37,204 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[101] L20-->L21: Formula: (< v_x1_1 v_n_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[103] L21-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[100] L20-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" [2025-04-26 16:54:37,204 INFO L754 eck$LassoCheckResult]: Loop: "[105] L28-->L29: Formula: (< v_x2_1 v_n_3) InVars {x2=v_x2_1, n=v_n_3} OutVars{x2=v_x2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[107] L29-->L28: Formula: (= v_x2_2 (* v_x2_3 2)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:54:37,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash -611602841, now seen corresponding path program 1 times [2025-04-26 16:54:37,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:37,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185577935] [2025-04-26 16:54:37,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:37,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:37,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:37,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:37,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:37,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:37,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:37,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:37,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:37,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:37,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:37,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:37,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:37,218 INFO L85 PathProgramCache]: Analyzing trace with hash 4323, now seen corresponding path program 2 times [2025-04-26 16:54:37,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:37,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82352286] [2025-04-26 16:54:37,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:37,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:37,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:37,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:37,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:37,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:37,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:37,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:37,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:37,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:37,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:37,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:37,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:37,227 INFO L85 PathProgramCache]: Analyzing trace with hash 660192713, now seen corresponding path program 1 times [2025-04-26 16:54:37,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:37,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748141046] [2025-04-26 16:54:37,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:37,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:37,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:37,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:37,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:37,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:37,236 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:37,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:37,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:37,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:37,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:37,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:37,336 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:37,336 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:37,336 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:37,336 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:37,336 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:37,336 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,336 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:37,336 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:37,336 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:54:37,336 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:37,336 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:37,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:37,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:37,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:37,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:37,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:37,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:37,454 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:37,455 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:37,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,457 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:54:37,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:37,460 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:37,471 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:37,471 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar1=0} Honda state: {thread2Thread1of1ForFork0_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:37,477 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 16:54:37,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,479 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:54:37,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:37,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:37,497 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:37,497 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar0=0} Honda state: {thread2Thread1of1ForFork0_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:37,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:37,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,507 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:54:37,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:37,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:37,529 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:37,529 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x6=1, x5=1} Honda state: {x6=1, x5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:37,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:37,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,537 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:54:37,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:37,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:37,550 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:37,550 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork5_thidvar0=0} Honda state: {thread1Thread1of1ForFork5_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:37,557 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 16:54:37,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,559 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:54:37,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:37,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:37,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:37,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,592 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:54:37,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:37,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:37,682 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:37,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:37,686 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:37,687 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:37,687 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:37,687 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:37,687 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:37,687 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,687 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:37,687 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:37,687 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:54:37,687 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:37,687 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:37,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:37,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:37,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:37,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:37,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:37,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:37,839 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:37,840 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:37,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,842 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:54:37,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:37,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:37,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:37,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:37,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:37,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:37,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:37,862 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:37,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:37,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,870 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:54:37,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:37,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:37,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:37,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:37,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:37,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:37,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:37,888 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:37,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:54:37,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,895 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:54:37,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:37,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:37,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:37,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:37,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:37,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:37,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:37,914 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:37,919 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 16:54:37,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,922 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:54:37,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:37,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:37,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:37,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:37,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:37,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:37,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:37,949 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:37,955 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:54:37,956 INFO L437 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:54:37,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,958 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:54:37,960 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:37,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:37,977 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:54:37,977 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:37,977 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, n) = -1*x2 + 1*n Supporting invariants [1*x2 - 1 >= 0] [2025-04-26 16:54:37,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:37,988 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:38,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:38,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:38,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:38,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:38,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:38,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:38,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:38,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:38,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:38,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:38,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:38,076 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:38,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:38,093 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 16:54:38,093 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7972 states and 28846 transitions. cyclomatic complexity: 22109 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:38,341 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7972 states and 28846 transitions. cyclomatic complexity: 22109. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 18608 states and 71901 transitions. Complement of second has 7 states. [2025-04-26 16:54:38,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-04-26 16:54:38,342 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:54:38,342 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:38,342 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:54:38,342 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:38,342 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:54:38,342 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:38,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18608 states and 71901 transitions. [2025-04-26 16:54:38,658 INFO L131 ngComponentsAnalysis]: Automaton has 580 accepting balls. 2030 [2025-04-26 16:54:38,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18608 states to 14220 states and 52185 transitions. [2025-04-26 16:54:38,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5213 [2025-04-26 16:54:38,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7690 [2025-04-26 16:54:38,848 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14220 states and 52185 transitions. [2025-04-26 16:54:38,848 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:38,848 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14220 states and 52185 transitions. [2025-04-26 16:54:38,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14220 states and 52185 transitions. [2025-04-26 16:54:39,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14220 to 11423. [2025-04-26 16:54:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11423 states, 11423 states have (on average 3.7874463801103038) internal successors, (in total 43264), 11422 states have internal predecessors, (43264), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11423 states to 11423 states and 43264 transitions. [2025-04-26 16:54:39,161 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11423 states and 43264 transitions. [2025-04-26 16:54:39,161 INFO L438 stractBuchiCegarLoop]: Abstraction has 11423 states and 43264 transitions. [2025-04-26 16:54:39,161 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:39,161 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11423 states and 43264 transitions. [2025-04-26 16:54:39,219 INFO L131 ngComponentsAnalysis]: Automaton has 580 accepting balls. 2030 [2025-04-26 16:54:39,219 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:39,219 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:39,220 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:39,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:39,221 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[104] L28-->thread2FINAL: Formula: (<= v_n_4 v_x2_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[129] L70-->L36: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" [2025-04-26 16:54:39,221 INFO L754 eck$LassoCheckResult]: Loop: "[109] L36-->L37: Formula: (< v_x3_3 v_n_5) InVars {n=v_n_5, x3=v_x3_3} OutVars{n=v_n_5, x3=v_x3_3} AuxVars[] AssignedVars[]" "[111] L37-->L36: Formula: (= (* v_x3_5 2) v_x3_4) InVars {x3=v_x3_5} OutVars{x3=v_x3_4} AuxVars[] AssignedVars[x3]" [2025-04-26 16:54:39,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash 610088148, now seen corresponding path program 1 times [2025-04-26 16:54:39,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:39,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095807968] [2025-04-26 16:54:39,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:39,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:39,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:39,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:39,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:39,230 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:39,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:39,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:39,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:39,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:39,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash 4451, now seen corresponding path program 1 times [2025-04-26 16:54:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:39,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944192869] [2025-04-26 16:54:39,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:39,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:39,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:39,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:39,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:39,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:39,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:39,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:39,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:39,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:39,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:39,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2115805834, now seen corresponding path program 1 times [2025-04-26 16:54:39,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:39,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661930592] [2025-04-26 16:54:39,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:39,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:39,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:39,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:39,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:39,256 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:39,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:39,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:39,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:39,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:39,429 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:39,429 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:39,429 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:39,429 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:39,429 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:39,429 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,430 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:39,430 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:39,430 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:54:39,430 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:39,430 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:39,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,541 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:39,542 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:39,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,546 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:39,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:54:39,547 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:39,547 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:39,566 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:39,566 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x6=1, x5=1} Honda state: {x6=1, x5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:39,572 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 16:54:39,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,574 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:39,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:54:39,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:39,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:39,588 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:39,588 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork5_thidvar0=0} Honda state: {thread1Thread1of1ForFork5_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:39,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:54:39,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,596 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:39,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:54:39,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:39,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:39,609 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:39,609 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar0=0} Honda state: {thread2Thread1of1ForFork0_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:39,615 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 16:54:39,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,617 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:39,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:54:39,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:39,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:39,629 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:39,629 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar2=0} Honda state: {thread3Thread1of1ForFork1_thidvar2=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:39,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:54:39,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,637 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:39,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:54:39,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:39,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:39,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:54:39,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,665 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:39,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:54:39,666 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:39,666 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:39,763 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:39,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:54:39,767 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:39,767 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:39,767 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:39,767 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:39,768 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:39,768 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,768 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:39,768 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:39,768 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:54:39,768 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:39,768 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:39,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,882 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:39,882 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:39,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,885 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:39,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:54:39,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:39,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:39,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:39,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:39,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:39,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:39,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:39,903 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:39,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:54:39,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,911 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:39,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:54:39,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:39,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:39,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:39,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:39,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:39,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:39,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:39,927 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:39,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:39,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,935 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:39,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:54:39,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:39,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:39,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:39,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:39,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:39,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:39,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:39,961 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:39,971 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:54:39,971 INFO L437 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:54:39,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,974 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:39,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:54:39,976 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:39,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:39,994 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:54:39,994 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:39,994 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x3) = 1*n - 1*x3 Supporting invariants [1*x3 - 1 >= 0] [2025-04-26 16:54:40,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:54:40,007 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:40,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:40,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:40,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:40,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:40,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:54:40,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:40,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:40,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:40,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:40,147 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:40,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:40,183 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 16:54:40,183 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11423 states and 43264 transitions. cyclomatic complexity: 33012 Second operand has 4 states, 4 states have (on average 2.5) 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 16:54:40,478 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11423 states and 43264 transitions. cyclomatic complexity: 33012. Second operand has 4 states, 4 states have (on average 2.5) 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 31177 states and 119689 transitions. Complement of second has 7 states. [2025-04-26 16:54:40,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) 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 16:54:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-04-26 16:54:40,480 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:54:40,480 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:40,480 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:54:40,480 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:40,481 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:54:40,481 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:40,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31177 states and 119689 transitions. [2025-04-26 16:54:40,876 INFO L131 ngComponentsAnalysis]: Automaton has 339 accepting balls. 966 [2025-04-26 16:54:41,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31177 states to 18684 states and 70064 transitions. [2025-04-26 16:54:41,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5208 [2025-04-26 16:54:41,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6208 [2025-04-26 16:54:41,176 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18684 states and 70064 transitions. [2025-04-26 16:54:41,176 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:41,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18684 states and 70064 transitions. [2025-04-26 16:54:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18684 states and 70064 transitions. [2025-04-26 16:54:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18684 to 17280. [2025-04-26 16:54:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17280 states, 17280 states have (on average 3.6591435185185186) internal successors, (in total 63230), 17279 states have internal predecessors, (63230), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17280 states to 17280 states and 63230 transitions. [2025-04-26 16:54:41,529 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17280 states and 63230 transitions. [2025-04-26 16:54:41,529 INFO L438 stractBuchiCegarLoop]: Abstraction has 17280 states and 63230 transitions. [2025-04-26 16:54:41,529 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:54:41,529 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17280 states and 63230 transitions. [2025-04-26 16:54:41,717 INFO L131 ngComponentsAnalysis]: Automaton has 339 accepting balls. 966 [2025-04-26 16:54:41,718 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:41,718 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:41,718 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:41,718 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:41,719 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[101] L20-->L21: Formula: (< v_x1_1 v_n_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[103] L21-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[129] L70-->L36: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[100] L20-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[132] L71-->L44: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" "[104] L28-->thread2FINAL: Formula: (<= v_n_4 v_x2_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" [2025-04-26 16:54:41,719 INFO L754 eck$LassoCheckResult]: Loop: "[113] L44-->L45: Formula: (< v_x4_3 v_n_7) InVars {x4=v_x4_3, n=v_n_7} OutVars{x4=v_x4_3, n=v_n_7} AuxVars[] AssignedVars[]" "[115] L45-->L44: Formula: (= (* v_x4_5 2) v_x4_4) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" [2025-04-26 16:54:41,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:41,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1183302104, now seen corresponding path program 1 times [2025-04-26 16:54:41,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:41,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600395584] [2025-04-26 16:54:41,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:41,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:41,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:41,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:41,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:41,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:41,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:41,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600395584] [2025-04-26 16:54:41,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600395584] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:41,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:41,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:54:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110669762] [2025-04-26 16:54:41,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:41,835 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:41,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:41,835 INFO L85 PathProgramCache]: Analyzing trace with hash 4579, now seen corresponding path program 1 times [2025-04-26 16:54:41,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:41,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052226128] [2025-04-26 16:54:41,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:41,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:41,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:41,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:41,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:41,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:41,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:41,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:41,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:41,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:41,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:41,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:41,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:41,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:54:41,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:54:41,901 INFO L87 Difference]: Start difference. First operand 17280 states and 63230 transitions. cyclomatic complexity: 47279 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 4 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 16:54:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:42,312 INFO L93 Difference]: Finished difference Result 21661 states and 76730 transitions. [2025-04-26 16:54:42,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21661 states and 76730 transitions. [2025-04-26 16:54:42,555 INFO L131 ngComponentsAnalysis]: Automaton has 490 accepting balls. 1400 [2025-04-26 16:54:42,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21661 states to 20866 states and 74391 transitions. [2025-04-26 16:54:42,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6370 [2025-04-26 16:54:42,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6370 [2025-04-26 16:54:42,699 INFO L74 IsDeterministic]: Start isDeterministic. Operand 20866 states and 74391 transitions. [2025-04-26 16:54:42,699 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:42,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20866 states and 74391 transitions. [2025-04-26 16:54:42,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20866 states and 74391 transitions. [2025-04-26 16:54:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20866 to 18936. [2025-04-26 16:54:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18936 states, 18936 states have (on average 3.6452788339670468) internal successors, (in total 69027), 18935 states have internal predecessors, (69027), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18936 states to 18936 states and 69027 transitions. [2025-04-26 16:54:43,212 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18936 states and 69027 transitions. [2025-04-26 16:54:43,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:54:43,213 INFO L438 stractBuchiCegarLoop]: Abstraction has 18936 states and 69027 transitions. [2025-04-26 16:54:43,213 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:54:43,213 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18936 states and 69027 transitions. [2025-04-26 16:54:43,320 INFO L131 ngComponentsAnalysis]: Automaton has 339 accepting balls. 966 [2025-04-26 16:54:43,321 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:43,321 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:43,321 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:43,321 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:43,322 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[104] L28-->thread2FINAL: Formula: (<= v_n_4 v_x2_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[129] L70-->L36: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" "[110] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[132] L71-->L44: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" [2025-04-26 16:54:43,322 INFO L754 eck$LassoCheckResult]: Loop: "[113] L44-->L45: Formula: (< v_x4_3 v_n_7) InVars {x4=v_x4_3, n=v_n_7} OutVars{x4=v_x4_3, n=v_n_7} AuxVars[] AssignedVars[]" "[115] L45-->L44: Formula: (= (* v_x4_5 2) v_x4_4) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" [2025-04-26 16:54:43,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:43,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1165472274, now seen corresponding path program 1 times [2025-04-26 16:54:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:43,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529644103] [2025-04-26 16:54:43,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:43,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:54:43,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:54:43,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:43,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:43,328 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:43,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:54:43,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:54:43,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:43,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:43,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:43,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash 4579, now seen corresponding path program 2 times [2025-04-26 16:54:43,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:43,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473581391] [2025-04-26 16:54:43,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:43,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:43,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:43,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:43,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:43,339 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:43,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:43,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:43,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:43,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:43,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:43,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:43,344 INFO L85 PathProgramCache]: Analyzing trace with hash 967612560, now seen corresponding path program 1 times [2025-04-26 16:54:43,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:43,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55568255] [2025-04-26 16:54:43,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:43,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:54:43,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:54:43,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:43,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:43,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:43,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55568255] [2025-04-26 16:54:43,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55568255] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:43,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:43,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:54:43,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252322759] [2025-04-26 16:54:43,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:43,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:43,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:54:43,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:54:43,402 INFO L87 Difference]: Start difference. First operand 18936 states and 69027 transitions. cyclomatic complexity: 51549 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:43,807 INFO L93 Difference]: Finished difference Result 35932 states and 129671 transitions. [2025-04-26 16:54:43,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35932 states and 129671 transitions. [2025-04-26 16:54:44,228 INFO L131 ngComponentsAnalysis]: Automaton has 511 accepting balls. 1372 [2025-04-26 16:54:44,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35932 states to 33833 states and 122985 transitions. [2025-04-26 16:54:44,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10785 [2025-04-26 16:54:44,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10785 [2025-04-26 16:54:44,521 INFO L74 IsDeterministic]: Start isDeterministic. Operand 33833 states and 122985 transitions. [2025-04-26 16:54:44,522 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:44,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33833 states and 122985 transitions. [2025-04-26 16:54:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33833 states and 122985 transitions. [2025-04-26 16:54:45,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33833 to 21983. [2025-04-26 16:54:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21983 states, 21983 states have (on average 3.669335395532912) internal successors, (in total 80663), 21982 states have internal predecessors, (80663), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21983 states to 21983 states and 80663 transitions. [2025-04-26 16:54:45,153 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21983 states and 80663 transitions. [2025-04-26 16:54:45,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:54:45,153 INFO L438 stractBuchiCegarLoop]: Abstraction has 21983 states and 80663 transitions. [2025-04-26 16:54:45,153 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:54:45,153 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21983 states and 80663 transitions. [2025-04-26 16:54:45,252 INFO L131 ngComponentsAnalysis]: Automaton has 339 accepting balls. 966 [2025-04-26 16:54:45,252 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:45,252 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:45,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:45,253 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:45,253 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[104] L28-->thread2FINAL: Formula: (<= v_n_4 v_x2_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[129] L70-->L36: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[109] L36-->L37: Formula: (< v_x3_3 v_n_5) InVars {n=v_n_5, x3=v_x3_3} OutVars{n=v_n_5, x3=v_x3_3} AuxVars[] AssignedVars[]" "[132] L71-->L44: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" "[111] L37-->L36: Formula: (= (* v_x3_5 2) v_x3_4) InVars {x3=v_x3_5} OutVars{x3=v_x3_4} AuxVars[] AssignedVars[x3]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" [2025-04-26 16:54:45,253 INFO L754 eck$LassoCheckResult]: Loop: "[113] L44-->L45: Formula: (< v_x4_3 v_n_7) InVars {x4=v_x4_3, n=v_n_7} OutVars{x4=v_x4_3, n=v_n_7} AuxVars[] AssignedVars[]" "[115] L45-->L44: Formula: (= (* v_x4_5 2) v_x4_4) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" [2025-04-26 16:54:45,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:45,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1769851736, now seen corresponding path program 1 times [2025-04-26 16:54:45,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:45,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470908294] [2025-04-26 16:54:45,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:45,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:45,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:45,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:45,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:45,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:45,260 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:45,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:45,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:45,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:45,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:45,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:45,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:45,267 INFO L85 PathProgramCache]: Analyzing trace with hash 4579, now seen corresponding path program 3 times [2025-04-26 16:54:45,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:45,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382726458] [2025-04-26 16:54:45,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:45,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:45,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:45,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:45,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:45,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:45,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:45,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:45,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:45,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:45,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:45,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:45,276 INFO L85 PathProgramCache]: Analyzing trace with hash -20465462, now seen corresponding path program 1 times [2025-04-26 16:54:45,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:45,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383529575] [2025-04-26 16:54:45,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:45,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:45,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:45,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:45,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:45,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:45,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:45,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:45,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:45,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:45,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:45,437 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:45,437 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:45,437 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:45,437 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:45,438 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:45,438 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:45,438 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:45,438 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:45,438 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:54:45,438 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:45,438 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:45,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,563 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:45,563 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:45,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:45,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:45,566 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:45,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:54:45,567 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:45,567 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:45,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:45,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:45,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:45,594 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:45,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:54:45,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:45,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:45,696 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:45,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:54:45,701 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:45,701 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:45,701 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:45,701 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:45,701 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:45,701 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:45,701 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:45,701 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:45,701 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:54:45,701 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:45,701 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:45,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,974 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:45,974 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:45,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:45,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:45,976 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:45,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:54:45,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:45,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:45,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:45,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:45,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:45,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:45,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:45,999 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:46,004 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:54:46,005 INFO L437 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:54:46,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:46,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:46,021 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:46,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:54:46,048 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:46,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:54:46,064 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:54:46,064 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:46,064 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x4) = 1*n - 1*x4 Supporting invariants [1*x4 - 1 >= 0] [2025-04-26 16:54:46,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:54:46,071 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:46,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:46,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:46,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:46,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:46,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:46,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:46,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:46,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:46,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:46,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:46,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:46,177 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:46,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:46,188 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 16:54:46,188 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21983 states and 80663 transitions. cyclomatic complexity: 60451 Second operand has 4 states, 4 states have (on average 3.5) 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 16:54:46,599 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21983 states and 80663 transitions. cyclomatic complexity: 60451. Second operand has 4 states, 4 states have (on average 3.5) 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 40406 states and 146650 transitions. Complement of second has 7 states. [2025-04-26 16:54:46,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) 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 16:54:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-04-26 16:54:46,600 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:54:46,600 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:46,600 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:54:46,600 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:46,600 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:54:46,600 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:46,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40406 states and 146650 transitions. [2025-04-26 16:54:47,091 INFO L131 ngComponentsAnalysis]: Automaton has 172 accepting balls. 406 [2025-04-26 16:54:47,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40406 states to 28842 states and 102569 transitions. [2025-04-26 16:54:47,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8332 [2025-04-26 16:54:47,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9324 [2025-04-26 16:54:47,319 INFO L74 IsDeterministic]: Start isDeterministic. Operand 28842 states and 102569 transitions. [2025-04-26 16:54:47,319 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:47,319 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28842 states and 102569 transitions. [2025-04-26 16:54:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28842 states and 102569 transitions. [2025-04-26 16:54:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28842 to 25206. [2025-04-26 16:54:47,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25206 states, 25206 states have (on average 3.6002539077997304) internal successors, (in total 90748), 25205 states have internal predecessors, (90748), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25206 states to 25206 states and 90748 transitions. [2025-04-26 16:54:48,016 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25206 states and 90748 transitions. [2025-04-26 16:54:48,016 INFO L438 stractBuchiCegarLoop]: Abstraction has 25206 states and 90748 transitions. [2025-04-26 16:54:48,016 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:54:48,017 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25206 states and 90748 transitions. [2025-04-26 16:54:48,136 INFO L131 ngComponentsAnalysis]: Automaton has 172 accepting balls. 406 [2025-04-26 16:54:48,136 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:48,136 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:48,136 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:48,136 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:48,137 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[104] L28-->thread2FINAL: Formula: (<= v_n_4 v_x2_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[129] L70-->L36: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" "[110] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[132] L71-->L44: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" "[112] L44-->thread4FINAL: Formula: (<= v_n_8 v_x4_6) InVars {x4=v_x4_6, n=v_n_8} OutVars{x4=v_x4_6, n=v_n_8} AuxVars[] AssignedVars[]" "[114] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[135] L72-->L52: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" [2025-04-26 16:54:48,137 INFO L754 eck$LassoCheckResult]: Loop: "[117] L52-->L53: Formula: (< v_x5_6 v_n_10) InVars {x5=v_x5_6, n=v_n_10} OutVars{x5=v_x5_6, n=v_n_10} AuxVars[] AssignedVars[]" "[119] L53-->L52: Formula: (= v_x5_3 (* v_x5_4 2)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-04-26 16:54:48,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash -68782569, now seen corresponding path program 1 times [2025-04-26 16:54:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:48,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924951496] [2025-04-26 16:54:48,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:48,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:48,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:48,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:48,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:48,142 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:48,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:48,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:48,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:48,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:48,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:48,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:48,150 INFO L85 PathProgramCache]: Analyzing trace with hash 4707, now seen corresponding path program 1 times [2025-04-26 16:54:48,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:48,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366871951] [2025-04-26 16:54:48,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:48,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:48,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:48,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:48,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:48,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:48,153 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:48,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:48,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:48,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:48,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:48,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:48,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:48,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1675535623, now seen corresponding path program 1 times [2025-04-26 16:54:48,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:48,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028885644] [2025-04-26 16:54:48,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:48,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:48,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:48,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:48,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:48,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:48,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:48,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:48,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:48,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:48,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:48,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:48,530 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:48,530 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:48,530 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:48,530 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:48,530 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:48,530 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:48,530 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:48,530 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:48,530 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:54:48,530 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:48,530 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:48,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,683 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:48,683 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:48,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:48,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:48,685 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:48,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:54:48,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:48,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:48,697 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:48,698 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar0=0} Honda state: {thread3Thread1of1ForFork1_thidvar0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:48,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:54:48,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:48,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:48,704 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:48,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:54:48,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:48,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:48,716 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:48,716 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar1=0} Honda state: {thread3Thread1of1ForFork1_thidvar1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:48,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:54:48,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:48,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:48,724 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:48,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:54:48,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:48,726 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:48,736 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:48,737 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar0=0} Honda state: {thread2Thread1of1ForFork0_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:48,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:54:48,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:48,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:48,745 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:48,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:54:48,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:48,749 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:48,760 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:48,760 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork5_thidvar0=0} Honda state: {thread1Thread1of1ForFork5_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:48,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:54:48,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:48,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:48,767 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:48,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:54:48,769 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:48,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:48,779 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:48,780 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar1=0} Honda state: {thread2Thread1of1ForFork0_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:48,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:54:48,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:48,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:48,787 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:48,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:54:48,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:48,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:48,799 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:48,800 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar2=0} Honda state: {thread3Thread1of1ForFork1_thidvar2=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:48,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:54:48,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:48,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:48,807 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:48,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:54:48,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:48,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:48,820 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:48,821 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork2_thidvar3=0} Honda state: {thread4Thread1of1ForFork2_thidvar3=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:48,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:54:48,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:48,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:48,827 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:48,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:54:48,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:48,829 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:48,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:54:48,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:48,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:48,855 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:48,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:54:48,857 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:48,857 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:48,928 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:48,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:48,933 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:48,933 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:48,933 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:48,933 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:48,933 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:48,933 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:48,933 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:48,933 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:48,933 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:54:48,933 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:48,933 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:48,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:48,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:49,067 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:49,067 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:49,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:49,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:49,070 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:49,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:54:49,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:49,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:49,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:49,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:49,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:49,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:49,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:49,089 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:49,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 16:54:49,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:49,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:49,099 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:49,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:54:49,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:49,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:49,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:49,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:49,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:49,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:49,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:49,118 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:49,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 16:54:49,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:49,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:49,126 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:49,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:54:49,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:49,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:49,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:49,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:49,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:49,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:49,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:49,143 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:49,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:49,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:49,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:49,154 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:49,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:54:49,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:49,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:49,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:49,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:49,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:49,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:49,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:49,169 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:49,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 16:54:49,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:49,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:49,178 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:49,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:54:49,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:49,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:49,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:49,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:49,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:49,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:49,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:49,194 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:49,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 16:54:49,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:49,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:49,202 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:49,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:54:49,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:49,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:49,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:49,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:49,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:49,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:49,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:49,217 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:49,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 16:54:49,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:49,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:49,225 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:49,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:54:49,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:49,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:49,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:49,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:49,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:49,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:49,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:49,242 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:49,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 16:54:49,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:49,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:49,250 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:49,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:54:49,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:49,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:49,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:49,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:49,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:49,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:49,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:49,271 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:49,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:49,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:49,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:49,281 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:49,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:54:49,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:49,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:49,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:49,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:49,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:49,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:49,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:49,297 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:49,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:49,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:49,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:49,306 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:49,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:54:49,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:49,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:49,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:49,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:49,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:49,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:49,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:49,329 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:49,339 INFO L436 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-04-26 16:54:49,339 INFO L437 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-04-26 16:54:49,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:49,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:49,343 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:49,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:54:49,344 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:49,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 16:54:49,364 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:54:49,364 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:49,364 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x5) = 1*n - 1*x5 Supporting invariants [1*x5 - 1 >= 0] [2025-04-26 16:54:49,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 16:54:49,375 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:49,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:49,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:49,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:49,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:49,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:49,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:54:49,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:49,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:49,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:49,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:49,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:49,483 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:49,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:49,497 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 16:54:49,498 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25206 states and 90748 transitions. cyclomatic complexity: 67405 Second operand has 4 states, 4 states have (on average 4.0) 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 16:54:50,131 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25206 states and 90748 transitions. cyclomatic complexity: 67405. Second operand has 4 states, 4 states have (on average 4.0) 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 63811 states and 228095 transitions. Complement of second has 7 states. [2025-04-26 16:54:50,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:50,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) 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 16:54:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-04-26 16:54:50,133 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 104 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:54:50,133 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:50,133 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 104 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 16:54:50,133 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:50,133 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 104 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:54:50,133 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:50,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63811 states and 228095 transitions. [2025-04-26 16:54:51,028 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 16:54:51,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63811 states to 29942 states and 105242 transitions. [2025-04-26 16:54:51,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6843 [2025-04-26 16:54:51,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7094 [2025-04-26 16:54:51,263 INFO L74 IsDeterministic]: Start isDeterministic. Operand 29942 states and 105242 transitions. [2025-04-26 16:54:51,263 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:51,263 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29942 states and 105242 transitions. [2025-04-26 16:54:51,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29942 states and 105242 transitions. [2025-04-26 16:54:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29942 to 28653. [2025-04-26 16:54:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28653 states, 28653 states have (on average 3.412487348619691) internal successors, (in total 97778), 28652 states have internal predecessors, (97778), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28653 states to 28653 states and 97778 transitions. [2025-04-26 16:54:51,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28653 states and 97778 transitions. [2025-04-26 16:54:51,886 INFO L438 stractBuchiCegarLoop]: Abstraction has 28653 states and 97778 transitions. [2025-04-26 16:54:51,886 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:54:51,886 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28653 states and 97778 transitions. [2025-04-26 16:54:52,157 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 16:54:52,157 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:52,157 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:52,157 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:52,158 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:52,158 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[104] L28-->thread2FINAL: Formula: (<= v_n_4 v_x2_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[129] L70-->L36: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[109] L36-->L37: Formula: (< v_x3_3 v_n_5) InVars {n=v_n_5, x3=v_x3_3} OutVars{n=v_n_5, x3=v_x3_3} AuxVars[] AssignedVars[]" "[132] L71-->L44: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" "[111] L37-->L36: Formula: (= (* v_x3_5 2) v_x3_4) InVars {x3=v_x3_5} OutVars{x3=v_x3_4} AuxVars[] AssignedVars[x3]" "[135] L72-->L52: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" "[138] L73-->L60: Formula: (and (= v_thread6Thread1of1ForFork4_thidvar1_2 6) (= v_thread6Thread1of1ForFork4_thidvar2_2 6) (= v_thread6Thread1of1ForFork4_thidvar3_2 6) (= v_thread6Thread1of1ForFork4_thidvar0_2 6) (= v_thread6Thread1of1ForFork4_thidvar5_2 6) (= v_thread6Thread1of1ForFork4_thidvar4_2 6)) InVars {} OutVars{thread6Thread1of1ForFork4_thidvar0=v_thread6Thread1of1ForFork4_thidvar0_2, thread6Thread1of1ForFork4_thidvar1=v_thread6Thread1of1ForFork4_thidvar1_2, thread6Thread1of1ForFork4_thidvar2=v_thread6Thread1of1ForFork4_thidvar2_2, thread6Thread1of1ForFork4_thidvar3=v_thread6Thread1of1ForFork4_thidvar3_2, thread6Thread1of1ForFork4_thidvar4=v_thread6Thread1of1ForFork4_thidvar4_2, thread6Thread1of1ForFork4_thidvar5=v_thread6Thread1of1ForFork4_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_thidvar0, thread6Thread1of1ForFork4_thidvar1, thread6Thread1of1ForFork4_thidvar2, thread6Thread1of1ForFork4_thidvar3, thread6Thread1of1ForFork4_thidvar4, thread6Thread1of1ForFork4_thidvar5]" "[112] L44-->thread4FINAL: Formula: (<= v_n_8 v_x4_6) InVars {x4=v_x4_6, n=v_n_8} OutVars{x4=v_x4_6, n=v_n_8} AuxVars[] AssignedVars[]" "[116] L52-->thread5FINAL: Formula: (<= v_n_9 v_x5_5) InVars {x5=v_x5_5, n=v_n_9} OutVars{x5=v_x5_5, n=v_n_9} AuxVars[] AssignedVars[]" [2025-04-26 16:54:52,158 INFO L754 eck$LassoCheckResult]: Loop: "[121] L60-->L61: Formula: (< v_x6_3 v_n_11) InVars {x6=v_x6_3, n=v_n_11} OutVars{x6=v_x6_3, n=v_n_11} AuxVars[] AssignedVars[]" "[123] L61-->L60: Formula: (= v_x6_4 (* v_x6_5 2)) InVars {x6=v_x6_5} OutVars{x6=v_x6_4} AuxVars[] AssignedVars[x6]" [2025-04-26 16:54:52,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:52,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1832339301, now seen corresponding path program 1 times [2025-04-26 16:54:52,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:52,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749791758] [2025-04-26 16:54:52,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:52,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:52,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:52,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:52,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:52,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:52,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749791758] [2025-04-26 16:54:52,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749791758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:52,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:52,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:54:52,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165004832] [2025-04-26 16:54:52,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:52,195 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:52,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:52,196 INFO L85 PathProgramCache]: Analyzing trace with hash 4835, now seen corresponding path program 1 times [2025-04-26 16:54:52,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:52,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62480567] [2025-04-26 16:54:52,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:52,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:52,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:52,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:52,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:52,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:52,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:52,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:52,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:52,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:52,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:54:52,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:54:52,209 INFO L87 Difference]: Start difference. First operand 28653 states and 97778 transitions. cyclomatic complexity: 71058 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (in total 16), 4 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 16:54:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:52,543 INFO L93 Difference]: Finished difference Result 45826 states and 154102 transitions. [2025-04-26 16:54:52,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45826 states and 154102 transitions. [2025-04-26 16:54:53,051 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 252 [2025-04-26 16:54:53,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45826 states to 44188 states and 149005 transitions. [2025-04-26 16:54:53,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10766 [2025-04-26 16:54:53,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10766 [2025-04-26 16:54:53,510 INFO L74 IsDeterministic]: Start isDeterministic. Operand 44188 states and 149005 transitions. [2025-04-26 16:54:53,510 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:53,510 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44188 states and 149005 transitions. [2025-04-26 16:54:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44188 states and 149005 transitions. [2025-04-26 16:54:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44188 to 31651. [2025-04-26 16:54:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31651 states, 31651 states have (on average 3.397207039272061) internal successors, (in total 107525), 31650 states have internal predecessors, (107525), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31651 states to 31651 states and 107525 transitions. [2025-04-26 16:54:54,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31651 states and 107525 transitions. [2025-04-26 16:54:54,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:54:54,436 INFO L438 stractBuchiCegarLoop]: Abstraction has 31651 states and 107525 transitions. [2025-04-26 16:54:54,436 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:54:54,436 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31651 states and 107525 transitions. [2025-04-26 16:54:54,568 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 16:54:54,569 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:54,569 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:54,569 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:54,569 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:54,570 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[101] L20-->L21: Formula: (< v_x1_1 v_n_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[103] L21-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[129] L70-->L36: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[100] L20-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[132] L71-->L44: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" "[105] L28-->L29: Formula: (< v_x2_1 v_n_3) InVars {x2=v_x2_1, n=v_n_3} OutVars{x2=v_x2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[112] L44-->thread4FINAL: Formula: (<= v_n_8 v_x4_6) InVars {x4=v_x4_6, n=v_n_8} OutVars{x4=v_x4_6, n=v_n_8} AuxVars[] AssignedVars[]" "[107] L29-->L28: Formula: (= v_x2_2 (* v_x2_3 2)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[135] L72-->L52: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" "[104] L28-->thread2FINAL: Formula: (<= v_n_4 v_x2_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[138] L73-->L60: Formula: (and (= v_thread6Thread1of1ForFork4_thidvar1_2 6) (= v_thread6Thread1of1ForFork4_thidvar2_2 6) (= v_thread6Thread1of1ForFork4_thidvar3_2 6) (= v_thread6Thread1of1ForFork4_thidvar0_2 6) (= v_thread6Thread1of1ForFork4_thidvar5_2 6) (= v_thread6Thread1of1ForFork4_thidvar4_2 6)) InVars {} OutVars{thread6Thread1of1ForFork4_thidvar0=v_thread6Thread1of1ForFork4_thidvar0_2, thread6Thread1of1ForFork4_thidvar1=v_thread6Thread1of1ForFork4_thidvar1_2, thread6Thread1of1ForFork4_thidvar2=v_thread6Thread1of1ForFork4_thidvar2_2, thread6Thread1of1ForFork4_thidvar3=v_thread6Thread1of1ForFork4_thidvar3_2, thread6Thread1of1ForFork4_thidvar4=v_thread6Thread1of1ForFork4_thidvar4_2, thread6Thread1of1ForFork4_thidvar5=v_thread6Thread1of1ForFork4_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_thidvar0, thread6Thread1of1ForFork4_thidvar1, thread6Thread1of1ForFork4_thidvar2, thread6Thread1of1ForFork4_thidvar3, thread6Thread1of1ForFork4_thidvar4, thread6Thread1of1ForFork4_thidvar5]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" "[116] L52-->thread5FINAL: Formula: (<= v_n_9 v_x5_5) InVars {x5=v_x5_5, n=v_n_9} OutVars{x5=v_x5_5, n=v_n_9} AuxVars[] AssignedVars[]" [2025-04-26 16:54:54,570 INFO L754 eck$LassoCheckResult]: Loop: "[121] L60-->L61: Formula: (< v_x6_3 v_n_11) InVars {x6=v_x6_3, n=v_n_11} OutVars{x6=v_x6_3, n=v_n_11} AuxVars[] AssignedVars[]" "[123] L61-->L60: Formula: (= v_x6_4 (* v_x6_5 2)) InVars {x6=v_x6_5} OutVars{x6=v_x6_4} AuxVars[] AssignedVars[x6]" [2025-04-26 16:54:54,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:54,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1082432591, now seen corresponding path program 1 times [2025-04-26 16:54:54,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:54,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993484670] [2025-04-26 16:54:54,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:54,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:54,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:54,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:54,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:54,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:54,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:54,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:54,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:54,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:54,581 INFO L85 PathProgramCache]: Analyzing trace with hash 4835, now seen corresponding path program 2 times [2025-04-26 16:54:54,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:54,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417678111] [2025-04-26 16:54:54,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:54,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:54,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:54,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:54,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:54,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:54,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:54,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:54,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:54,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:54,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash -835630445, now seen corresponding path program 1 times [2025-04-26 16:54:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:54,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081625545] [2025-04-26 16:54:54,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:54,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:54,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:54,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:54,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:54,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:54,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:54,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081625545] [2025-04-26 16:54:54,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081625545] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:54,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:54,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:54:54,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846491157] [2025-04-26 16:54:54,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:54,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:54,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:54:54,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:54:54,634 INFO L87 Difference]: Start difference. First operand 31651 states and 107525 transitions. cyclomatic complexity: 77984 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:55,109 INFO L93 Difference]: Finished difference Result 59490 states and 203529 transitions. [2025-04-26 16:54:55,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59490 states and 203529 transitions. [2025-04-26 16:54:55,714 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 16:54:56,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59490 states to 53258 states and 182679 transitions. [2025-04-26 16:54:56,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12453 [2025-04-26 16:54:56,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12453 [2025-04-26 16:54:56,151 INFO L74 IsDeterministic]: Start isDeterministic. Operand 53258 states and 182679 transitions. [2025-04-26 16:54:56,151 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:56,151 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53258 states and 182679 transitions. [2025-04-26 16:54:56,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53258 states and 182679 transitions. [2025-04-26 16:54:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53258 to 35014. [2025-04-26 16:54:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35014 states, 35014 states have (on average 3.357000057120009) internal successors, (in total 117542), 35013 states have internal predecessors, (117542), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35014 states to 35014 states and 117542 transitions. [2025-04-26 16:54:57,035 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35014 states and 117542 transitions. [2025-04-26 16:54:57,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:54:57,036 INFO L438 stractBuchiCegarLoop]: Abstraction has 35014 states and 117542 transitions. [2025-04-26 16:54:57,036 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:54:57,036 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35014 states and 117542 transitions. [2025-04-26 16:54:57,395 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 16:54:57,395 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:57,395 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:57,396 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:57,396 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:57,396 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[101] L20-->L21: Formula: (< v_x1_1 v_n_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[103] L21-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[129] L70-->L36: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[100] L20-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[132] L71-->L44: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" "[105] L28-->L29: Formula: (< v_x2_1 v_n_3) InVars {x2=v_x2_1, n=v_n_3} OutVars{x2=v_x2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[112] L44-->thread4FINAL: Formula: (<= v_n_8 v_x4_6) InVars {x4=v_x4_6, n=v_n_8} OutVars{x4=v_x4_6, n=v_n_8} AuxVars[] AssignedVars[]" "[107] L29-->L28: Formula: (= v_x2_2 (* v_x2_3 2)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[135] L72-->L52: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" "[104] L28-->thread2FINAL: Formula: (<= v_n_4 v_x2_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[138] L73-->L60: Formula: (and (= v_thread6Thread1of1ForFork4_thidvar1_2 6) (= v_thread6Thread1of1ForFork4_thidvar2_2 6) (= v_thread6Thread1of1ForFork4_thidvar3_2 6) (= v_thread6Thread1of1ForFork4_thidvar0_2 6) (= v_thread6Thread1of1ForFork4_thidvar5_2 6) (= v_thread6Thread1of1ForFork4_thidvar4_2 6)) InVars {} OutVars{thread6Thread1of1ForFork4_thidvar0=v_thread6Thread1of1ForFork4_thidvar0_2, thread6Thread1of1ForFork4_thidvar1=v_thread6Thread1of1ForFork4_thidvar1_2, thread6Thread1of1ForFork4_thidvar2=v_thread6Thread1of1ForFork4_thidvar2_2, thread6Thread1of1ForFork4_thidvar3=v_thread6Thread1of1ForFork4_thidvar3_2, thread6Thread1of1ForFork4_thidvar4=v_thread6Thread1of1ForFork4_thidvar4_2, thread6Thread1of1ForFork4_thidvar5=v_thread6Thread1of1ForFork4_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_thidvar0, thread6Thread1of1ForFork4_thidvar1, thread6Thread1of1ForFork4_thidvar2, thread6Thread1of1ForFork4_thidvar3, thread6Thread1of1ForFork4_thidvar4, thread6Thread1of1ForFork4_thidvar5]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" "[121] L60-->L61: Formula: (< v_x6_3 v_n_11) InVars {x6=v_x6_3, n=v_n_11} OutVars{x6=v_x6_3, n=v_n_11} AuxVars[] AssignedVars[]" "[116] L52-->thread5FINAL: Formula: (<= v_n_9 v_x5_5) InVars {x5=v_x5_5, n=v_n_9} OutVars{x5=v_x5_5, n=v_n_9} AuxVars[] AssignedVars[]" [2025-04-26 16:54:57,396 INFO L754 eck$LassoCheckResult]: Loop: "[123] L61-->L60: Formula: (= v_x6_4 (* v_x6_5 2)) InVars {x6=v_x6_5} OutVars{x6=v_x6_4} AuxVars[] AssignedVars[x6]" "[121] L60-->L61: Formula: (< v_x6_3 v_n_11) InVars {x6=v_x6_3, n=v_n_11} OutVars{x6=v_x6_3, n=v_n_11} AuxVars[] AssignedVars[]" [2025-04-26 16:54:57,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash 804328318, now seen corresponding path program 1 times [2025-04-26 16:54:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:57,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394910987] [2025-04-26 16:54:57,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:57,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:57,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:54:57,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:54:57,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:57,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:57,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394910987] [2025-04-26 16:54:57,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394910987] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:57,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:57,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:54:57,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75689053] [2025-04-26 16:54:57,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:57,428 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:57,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash 4895, now seen corresponding path program 3 times [2025-04-26 16:54:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:57,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676731178] [2025-04-26 16:54:57,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:57,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:57,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:57,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:57,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:57,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:57,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:57,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:57,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:57,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:57,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:57,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:57,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:54:57,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:54:57,442 INFO L87 Difference]: Start difference. First operand 35014 states and 117542 transitions. cyclomatic complexity: 85031 Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:57,808 INFO L93 Difference]: Finished difference Result 57945 states and 197985 transitions. [2025-04-26 16:54:57,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57945 states and 197985 transitions. [2025-04-26 16:54:58,516 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 16:54:58,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57945 states to 49812 states and 172267 transitions. [2025-04-26 16:54:58,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10975 [2025-04-26 16:54:59,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10975 [2025-04-26 16:54:59,111 INFO L74 IsDeterministic]: Start isDeterministic. Operand 49812 states and 172267 transitions. [2025-04-26 16:54:59,111 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:59,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49812 states and 172267 transitions. [2025-04-26 16:54:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49812 states and 172267 transitions. [2025-04-26 16:54:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49812 to 31658. [2025-04-26 16:54:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31658 states, 31658 states have (on average 3.3943710910354414) internal successors, (in total 107459), 31657 states have internal predecessors, (107459), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31658 states to 31658 states and 107459 transitions. [2025-04-26 16:54:59,924 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31658 states and 107459 transitions. [2025-04-26 16:54:59,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:54:59,927 INFO L438 stractBuchiCegarLoop]: Abstraction has 31658 states and 107459 transitions. [2025-04-26 16:54:59,927 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:54:59,927 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31658 states and 107459 transitions. [2025-04-26 16:55:00,132 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 16:55:00,132 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:00,132 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:00,133 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:00,133 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:00,133 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[104] L28-->thread2FINAL: Formula: (<= v_n_4 v_x2_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[129] L70-->L36: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" "[110] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[132] L71-->L44: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" "[112] L44-->thread4FINAL: Formula: (<= v_n_8 v_x4_6) InVars {x4=v_x4_6, n=v_n_8} OutVars{x4=v_x4_6, n=v_n_8} AuxVars[] AssignedVars[]" "[114] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[135] L72-->L52: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" "[117] L52-->L53: Formula: (< v_x5_6 v_n_10) InVars {x5=v_x5_6, n=v_n_10} OutVars{x5=v_x5_6, n=v_n_10} AuxVars[] AssignedVars[]" "[138] L73-->L60: Formula: (and (= v_thread6Thread1of1ForFork4_thidvar1_2 6) (= v_thread6Thread1of1ForFork4_thidvar2_2 6) (= v_thread6Thread1of1ForFork4_thidvar3_2 6) (= v_thread6Thread1of1ForFork4_thidvar0_2 6) (= v_thread6Thread1of1ForFork4_thidvar5_2 6) (= v_thread6Thread1of1ForFork4_thidvar4_2 6)) InVars {} OutVars{thread6Thread1of1ForFork4_thidvar0=v_thread6Thread1of1ForFork4_thidvar0_2, thread6Thread1of1ForFork4_thidvar1=v_thread6Thread1of1ForFork4_thidvar1_2, thread6Thread1of1ForFork4_thidvar2=v_thread6Thread1of1ForFork4_thidvar2_2, thread6Thread1of1ForFork4_thidvar3=v_thread6Thread1of1ForFork4_thidvar3_2, thread6Thread1of1ForFork4_thidvar4=v_thread6Thread1of1ForFork4_thidvar4_2, thread6Thread1of1ForFork4_thidvar5=v_thread6Thread1of1ForFork4_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_thidvar0, thread6Thread1of1ForFork4_thidvar1, thread6Thread1of1ForFork4_thidvar2, thread6Thread1of1ForFork4_thidvar3, thread6Thread1of1ForFork4_thidvar4, thread6Thread1of1ForFork4_thidvar5]" "[119] L53-->L52: Formula: (= v_x5_3 (* v_x5_4 2)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" "[116] L52-->thread5FINAL: Formula: (<= v_n_9 v_x5_5) InVars {x5=v_x5_5, n=v_n_9} OutVars{x5=v_x5_5, n=v_n_9} AuxVars[] AssignedVars[]" [2025-04-26 16:55:00,134 INFO L754 eck$LassoCheckResult]: Loop: "[121] L60-->L61: Formula: (< v_x6_3 v_n_11) InVars {x6=v_x6_3, n=v_n_11} OutVars{x6=v_x6_3, n=v_n_11} AuxVars[] AssignedVars[]" "[123] L61-->L60: Formula: (= v_x6_4 (* v_x6_5 2)) InVars {x6=v_x6_5} OutVars{x6=v_x6_4} AuxVars[] AssignedVars[x6]" [2025-04-26 16:55:00,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash 423024361, now seen corresponding path program 1 times [2025-04-26 16:55:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:00,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101975223] [2025-04-26 16:55:00,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:00,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:55:00,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:55:00,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:00,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:00,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:00,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:55:00,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:55:00,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:00,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:00,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:00,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash 4835, now seen corresponding path program 4 times [2025-04-26 16:55:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:00,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911203865] [2025-04-26 16:55:00,142 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:55:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:00,144 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 16:55:00,144 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:00,144 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:55:00,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:00,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:00,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:00,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:00,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:00,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:00,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:00,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1495478325, now seen corresponding path program 1 times [2025-04-26 16:55:00,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:00,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920744151] [2025-04-26 16:55:00,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:00,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:00,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:55:00,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:55:00,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:00,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:00,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:00,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:55:00,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:55:00,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:00,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:00,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:00,408 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:00,409 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:00,409 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:00,409 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:00,409 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:00,409 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:00,409 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:00,409 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:00,409 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration12_Lasso [2025-04-26 16:55:00,409 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:00,409 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:00,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,587 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:00,587 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:00,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:00,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:00,589 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:00,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:55:00,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:00,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:00,601 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:55:00,602 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar1=0} Honda state: {thread3Thread1of1ForFork1_thidvar1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:55:00,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 16:55:00,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:00,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:00,608 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:00,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 16:55:00,611 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:00,611 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:00,621 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:55:00,621 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork5_thidvar0=0} Honda state: {thread1Thread1of1ForFork5_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:55:00,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 16:55:00,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:00,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:00,629 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:00,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 16:55:00,631 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:00,631 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:00,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 16:55:00,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:00,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:00,657 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:00,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 16:55:00,659 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:00,659 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:00,756 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:00,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 16:55:00,761 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:00,761 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:00,761 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:00,761 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:00,761 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:00,761 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:00,761 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:00,761 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:00,761 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration12_Lasso [2025-04-26 16:55:00,761 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:00,761 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:00,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:00,939 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:00,939 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:00,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:00,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:00,941 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:00,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 16:55:00,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:00,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:00,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:00,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:00,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:00,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:00,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:00,959 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:00,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-04-26 16:55:00,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:00,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:00,967 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:00,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 16:55:00,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:00,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:00,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:00,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:00,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:00,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:00,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:00,986 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:00,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-04-26 16:55:00,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:00,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:00,993 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:00,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 16:55:00,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:01,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:01,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:01,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:01,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:01,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:01,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:01,008 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:01,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-04-26 16:55:01,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:01,015 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:01,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 16:55:01,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:01,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:01,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:01,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:01,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:01,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:01,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:01,039 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:01,044 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:55:01,045 INFO L437 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:55:01,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:01,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:01,046 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:01,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 16:55:01,048 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:01,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-04-26 16:55:01,063 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:55:01,063 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:01,064 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x6, n) = -1*x6 + 1*n Supporting invariants [1*x6 - 1 >= 0] [2025-04-26 16:55:01,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 16:55:01,071 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:55:01,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:01,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:55:01,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:55:01,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:01,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:01,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:01,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:01,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:01,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:01,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:01,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:01,202 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:55:01,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:01,213 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 16:55:01,213 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31658 states and 107459 transitions. cyclomatic complexity: 77911 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:01,745 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31658 states and 107459 transitions. cyclomatic complexity: 77911. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 3 states have internal predecessors, (20), 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 57459 states and 191945 transitions. Complement of second has 7 states. [2025-04-26 16:55:01,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2025-04-26 16:55:01,746 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 102 transitions. Stem has 18 letters. Loop has 2 letters. [2025-04-26 16:55:01,746 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:01,746 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 102 transitions. Stem has 20 letters. Loop has 2 letters. [2025-04-26 16:55:01,746 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:01,746 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 102 transitions. Stem has 18 letters. Loop has 4 letters. [2025-04-26 16:55:01,747 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:01,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57459 states and 191945 transitions. [2025-04-26 16:55:02,475 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:02,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57459 states to 0 states and 0 transitions. [2025-04-26 16:55:02,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:02,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:02,475 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:02,475 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:02,475 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:02,475 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:02,475 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:02,475 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 16:55:02,475 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:02,475 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:02,475 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:02,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:02,487 INFO L201 PluginConnector]: Adding new model exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:02 BoogieIcfgContainer [2025-04-26 16:55:02,487 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:02,487 INFO L158 Benchmark]: Toolchain (without parser) took 30369.98ms. Allocated memory was 159.4MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 85.6MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2025-04-26 16:55:02,487 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:02,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.28ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 83.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:02,488 INFO L158 Benchmark]: Boogie Preprocessor took 29.69ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.7MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:55:02,488 INFO L158 Benchmark]: RCFGBuilder took 216.18ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 72.9MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:02,488 INFO L158 Benchmark]: BuchiAutomizer took 30088.53ms. Allocated memory was 159.4MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 72.7MB in the beginning and 3.9GB in the end (delta: -3.9GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2025-04-26 16:55:02,489 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.16ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.28ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 83.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.69ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.7MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 216.18ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 72.9MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 30088.53ms. Allocated memory was 159.4MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 72.7MB in the beginning and 3.9GB in the end (delta: -3.9GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.9s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 5.8s. Construction of modules took 0.6s. Büchi inclusion checks took 13.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 6.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 74049 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 8.4s Buchi closure took 0.4s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 908 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 908 mSDsluCounter, 735 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 366 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1099 IncrementalHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 369 mSDtfsCounter, 1099 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN3 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital64 mio100 ax100 hnf100 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s InitialAbstractionConstructionTime: 1.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 1223, Number of transitions in reduction automaton: 24908, Number of states in reduction automaton: 6831, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (6 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + n and consists of 6 locations. One deterministic module has affine ranking function n + -1 * x2 and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + n and consists of 5 locations. One deterministic module has affine ranking function -1 * x4 + n and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + n and consists of 5 locations. One deterministic module has affine ranking function n + -1 * x6 and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:55:02,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...