/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/mult-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:04,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:04,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:04,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:04,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:04,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:04,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:04,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:04,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:04,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:04,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:04,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:04,863 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:04,863 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:04,863 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:04,863 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:04,863 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:04,863 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:04,864 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:04,864 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:04,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:04,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:04,864 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:04,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:04,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:04,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:04,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:04,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:04,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:04,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:04,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:04,864 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:04,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:04,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:04,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:04,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:04,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:04,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:04,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:04,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:04,866 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:04,866 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:04,866 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:05,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:05,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:05,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:05,107 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:05,108 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:05,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/mult-4.wvr.bpl [2025-04-26 16:56:05,111 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/mult-4.wvr.bpl' [2025-04-26 16:56:05,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:05,129 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:05,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:05,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:05,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:05,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,165 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:05,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:05,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:05,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:05,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:05,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,181 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:05,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:05,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:05,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:05,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:05,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,223 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:56:05,228 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:56:05,247 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:05,247 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:05,247 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:05,247 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:05,247 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:05,247 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:05,247 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:05,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:05,248 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:05,248 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:05,248 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:56:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:56:05,248 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:56:05,249 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:56:05,287 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:05,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:05,404 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:05,405 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:05,433 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:05,433 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:05,433 INFO L201 PluginConnector]: Adding new model mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:05 BoogieIcfgContainer [2025-04-26 16:56:05,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:05,434 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:05,434 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:05,440 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:05,440 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:05,441 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/2) ... [2025-04-26 16:56:05,442 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f41c60d and model type mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:05, skipping insertion in model container [2025-04-26 16:56:05,442 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:05,442 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:05" (2/2) ... [2025-04-26 16:56:05,444 INFO L376 chiAutomizerObserver]: Analyzing ICFG mult-4.wvr.bpl [2025-04-26 16:56:05,498 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:56:05,537 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:05,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:05,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,539 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:56:05,540 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:56:05,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 108 flow [2025-04-26 16:56:05,612 INFO L116 PetriNetUnfolderBase]: 4/32 cut-off events. [2025-04-26 16:56:05,614 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:56:05,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 32 events. 4/32 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-26 16:56:05,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 40 transitions, 108 flow [2025-04-26 16:56:05,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 88 flow [2025-04-26 16:56:05,622 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 41 places, 32 transitions, 88 flow [2025-04-26 16:56:05,627 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:05,814 WARN L140 AmpleReduction]: Number of pruned transitions: 286 [2025-04-26 16:56:05,815 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:05,815 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 68 [2025-04-26 16:56:05,815 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:36 [2025-04-26 16:56:05,815 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:154 [2025-04-26 16:56:05,815 WARN L145 AmpleReduction]: Times succ was already a loop node:120 [2025-04-26 16:56:05,815 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:8 [2025-04-26 16:56:05,815 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:05,819 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 259 states, 257 states have (on average 1.933852140077821) internal successors, (in total 497), 258 states have internal predecessors, (497), 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:56:05,825 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:05,825 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:05,825 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:05,825 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:05,825 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:05,826 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:05,826 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:05,826 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:05,828 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 259 states, 257 states have (on average 1.933852140077821) internal successors, (in total 497), 258 states have internal predecessors, (497), 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:56:05,847 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 184 [2025-04-26 16:56:05,847 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:05,847 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:05,851 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:05,851 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:05,851 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:05,852 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 259 states, 257 states have (on average 1.933852140077821) internal successors, (in total 497), 258 states have internal predecessors, (497), 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:56:05,859 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 184 [2025-04-26 16:56:05,859 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:05,859 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:05,859 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:05,859 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:05,866 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L70: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[60] L71-->L72: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[84] L72-->L73: Formula: (< 0 v_C_3) InVars {C=v_C_3} OutVars{C=v_C_3} AuxVars[] AssignedVars[]" "[106] L73-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:05,867 INFO L754 eck$LassoCheckResult]: Loop: "[89] L24-1-->L24: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[91] L24-->L24-1: Formula: (and (= v_i1_6 (+ v_i1_7 1)) (= v_counter_13 (+ v_counter_14 v_C_6))) InVars {i1=v_i1_7, counter=v_counter_14, C=v_C_6} OutVars{i1=v_i1_6, counter=v_counter_13, C=v_C_6} AuxVars[] AssignedVars[counter, i1]" [2025-04-26 16:56:05,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:05,872 INFO L85 PathProgramCache]: Analyzing trace with hash 106026957, now seen corresponding path program 1 times [2025-04-26 16:56:05,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:05,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019266927] [2025-04-26 16:56:05,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:05,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:05,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:05,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:05,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:05,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:05,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:05,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:05,976 INFO L85 PathProgramCache]: Analyzing trace with hash 3811, now seen corresponding path program 1 times [2025-04-26 16:56:05,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:05,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132744642] [2025-04-26 16:56:05,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:05,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:05,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:05,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:05,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,985 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:05,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:05,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:05,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:05,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:05,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1187306577, now seen corresponding path program 1 times [2025-04-26 16:56:05,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:05,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356560885] [2025-04-26 16:56:05,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:05,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:06,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:06,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:06,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:06,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,099 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:06,100 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:06,100 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:06,100 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:06,100 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:06,100 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,100 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:06,100 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:06,100 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:06,100 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:06,100 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:06,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,205 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:06,206 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:06,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,215 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:56:06,217 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:56:06,218 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:06,218 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:06,234 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:06,235 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=0, C=0} Honda state: {counter=0, C=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:06,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,243 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:56:06,244 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:56:06,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:06,245 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:06,261 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:56:06,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,288 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:56:06,289 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:56:06,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:06,290 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:06,358 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:06,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:56:06,363 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:06,363 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:06,363 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:06,363 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:06,363 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:06,363 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,363 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:06,363 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:06,363 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:06,363 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:06,363 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:06,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,406 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:06,409 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:06,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,412 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:56:06,412 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:56:06,414 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:56:06,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:06,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:06,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:06,433 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:06,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:56:06,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,441 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:56:06,442 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:56:06,443 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:56:06,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:06,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:06,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:06,456 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:06,460 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:06,460 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:06,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,478 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:56:06,480 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:56:06,482 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:06,486 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:56:06,486 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:06,486 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:06,486 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N1, i1) = 1*N1 - 1*i1 Supporting invariants [] [2025-04-26 16:56:06,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:56:06,494 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:06,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:06,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:06,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:06,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:06,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:06,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:06,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:06,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:06,565 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:56:06,581 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:06,583 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 259 states, 257 states have (on average 1.933852140077821) internal successors, (in total 497), 258 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,664 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 259 states, 257 states have (on average 1.933852140077821) internal successors, (in total 497), 258 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 542 states and 1055 transitions. Complement of second has 7 states. [2025-04-26 16:56:06,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-04-26 16:56:06,671 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:56:06,672 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,672 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:56:06,672 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,672 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:56:06,672 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 542 states and 1055 transitions. [2025-04-26 16:56:06,680 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 144 [2025-04-26 16:56:06,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 542 states to 283 states and 528 transitions. [2025-04-26 16:56:06,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2025-04-26 16:56:06,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2025-04-26 16:56:06,686 INFO L74 IsDeterministic]: Start isDeterministic. Operand 283 states and 528 transitions. [2025-04-26 16:56:06,686 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:06,686 INFO L218 hiAutomatonCegarLoop]: Abstraction has 283 states and 528 transitions. [2025-04-26 16:56:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states and 528 transitions. [2025-04-26 16:56:06,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 261. [2025-04-26 16:56:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 261 states have (on average 1.8773946360153257) internal successors, (in total 490), 260 states have internal predecessors, (490), 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:56:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 490 transitions. [2025-04-26 16:56:06,719 INFO L240 hiAutomatonCegarLoop]: Abstraction has 261 states and 490 transitions. [2025-04-26 16:56:06,719 INFO L438 stractBuchiCegarLoop]: Abstraction has 261 states and 490 transitions. [2025-04-26 16:56:06,719 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:06,719 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 490 transitions. [2025-04-26 16:56:06,722 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 144 [2025-04-26 16:56:06,722 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:06,722 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:06,723 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:06,723 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:06,723 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L70: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[60] L71-->L72: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[84] L72-->L73: Formula: (< 0 v_C_3) InVars {C=v_C_3} OutVars{C=v_C_3} AuxVars[] AssignedVars[]" "[106] L73-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L24-1-->L24: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[109] L73-1-->L35-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:56:06,723 INFO L754 eck$LassoCheckResult]: Loop: "[93] L35-1-->L35: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[95] L35-->L35-1: Formula: (and (< 0 v_counter_22) (= v_i2_10 (+ v_i2_11 1)) (= v_counter_22 (+ v_counter_21 v_C_10))) InVars {i2=v_i2_11, counter=v_counter_22, C=v_C_10} OutVars{i2=v_i2_10, counter=v_counter_21, C=v_C_10} AuxVars[] AssignedVars[counter, i2]" [2025-04-26 16:56:06,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1187306559, now seen corresponding path program 1 times [2025-04-26 16:56:06,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074720976] [2025-04-26 16:56:06,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:06,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:06,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,731 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:06,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:06,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,740 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2025-04-26 16:56:06,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016809703] [2025-04-26 16:56:06,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,747 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1459700515, now seen corresponding path program 1 times [2025-04-26 16:56:06,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077901528] [2025-04-26 16:56:06,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:06,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:06,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:06,827 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:56:06,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:06,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077901528] [2025-04-26 16:56:06,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077901528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:06,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:06,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:06,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501509781] [2025-04-26 16:56:06,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:06,859 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:06,859 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:06,859 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:06,859 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:06,859 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:06,859 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,859 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:06,859 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:06,859 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:06,859 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:06,859 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:06,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,893 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:06,893 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:06,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,895 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:56:06,897 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:56:06,898 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:06,898 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:06,916 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:06,916 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=1, C=0} Honda state: {counter=1, C=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:06,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:56:06,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,924 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:56:06,925 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:56:06,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:06,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:06,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:56:06,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,945 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:56:06,946 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:56:06,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:06,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:07,014 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:07,018 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:56:07,018 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:07,018 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:07,018 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:07,018 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:07,018 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:07,018 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,018 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:07,018 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:07,018 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:07,018 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:07,018 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:07,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,050 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:07,050 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:07,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,052 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:56:07,055 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:56:07,056 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:56:07,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:07,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:07,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:07,069 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:07,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:07,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,076 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:56:07,077 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:56:07,078 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:56:07,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:07,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:07,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:07,092 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:07,094 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:07,094 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:07,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,097 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:56:07,098 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:56:07,099 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:07,103 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:56:07,103 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:07,103 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:07,103 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N2) = -1*i2 + 1*N2 Supporting invariants [] [2025-04-26 16:56:07,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:56:07,110 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:07,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:07,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:07,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:07,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:07,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:07,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:07,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:07,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:07,147 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:07,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:07,161 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:56:07,161 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:07,161 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 261 states and 490 transitions. cyclomatic complexity: 305 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:07,222 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 261 states and 490 transitions. cyclomatic complexity: 305. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 563 states and 1063 transitions. Complement of second has 6 states. [2025-04-26 16:56:07,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-26 16:56:07,223 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:56:07,223 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,223 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:56:07,223 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,223 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:56:07,223 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 1063 transitions. [2025-04-26 16:56:07,226 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 82 [2025-04-26 16:56:07,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 330 states and 622 transitions. [2025-04-26 16:56:07,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2025-04-26 16:56:07,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2025-04-26 16:56:07,229 INFO L74 IsDeterministic]: Start isDeterministic. Operand 330 states and 622 transitions. [2025-04-26 16:56:07,229 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:07,229 INFO L218 hiAutomatonCegarLoop]: Abstraction has 330 states and 622 transitions. [2025-04-26 16:56:07,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 622 transitions. [2025-04-26 16:56:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 306. [2025-04-26 16:56:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 306 states have (on average 1.9019607843137254) internal successors, (in total 582), 305 states have internal predecessors, (582), 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:56:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 582 transitions. [2025-04-26 16:56:07,237 INFO L240 hiAutomatonCegarLoop]: Abstraction has 306 states and 582 transitions. [2025-04-26 16:56:07,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:07,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:56:07,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:56:07,239 INFO L87 Difference]: Start difference. First operand 306 states and 582 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:07,294 INFO L93 Difference]: Finished difference Result 613 states and 1104 transitions. [2025-04-26 16:56:07,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 613 states and 1104 transitions. [2025-04-26 16:56:07,297 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 152 [2025-04-26 16:56:07,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 613 states to 595 states and 1086 transitions. [2025-04-26 16:56:07,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2025-04-26 16:56:07,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2025-04-26 16:56:07,301 INFO L74 IsDeterministic]: Start isDeterministic. Operand 595 states and 1086 transitions. [2025-04-26 16:56:07,301 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:07,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 595 states and 1086 transitions. [2025-04-26 16:56:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states and 1086 transitions. [2025-04-26 16:56:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 384. [2025-04-26 16:56:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 384 states have (on average 1.8307291666666667) internal successors, (in total 703), 383 states have internal predecessors, (703), 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:56:07,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 703 transitions. [2025-04-26 16:56:07,311 INFO L240 hiAutomatonCegarLoop]: Abstraction has 384 states and 703 transitions. [2025-04-26 16:56:07,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:56:07,315 INFO L438 stractBuchiCegarLoop]: Abstraction has 384 states and 703 transitions. [2025-04-26 16:56:07,316 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:07,316 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 384 states and 703 transitions. [2025-04-26 16:56:07,317 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 82 [2025-04-26 16:56:07,317 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:07,317 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:07,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:07,317 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:07,318 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L70: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[60] L71-->L72: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[84] L72-->L73: Formula: (< 0 v_C_3) InVars {C=v_C_3} OutVars{C=v_C_3} AuxVars[] AssignedVars[]" "[106] L73-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L24-1-->L24: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[91] L24-->L24-1: Formula: (and (= v_i1_6 (+ v_i1_7 1)) (= v_counter_13 (+ v_counter_14 v_C_6))) InVars {i1=v_i1_7, counter=v_counter_14, C=v_C_6} OutVars{i1=v_i1_6, counter=v_counter_13, C=v_C_6} AuxVars[] AssignedVars[counter, i1]" "[89] L24-1-->L24: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[109] L73-1-->L35-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[93] L35-1-->L35: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[112] L74-->L47-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:56:07,318 INFO L754 eck$LassoCheckResult]: Loop: "[97] L47-1-->L47: Formula: (< v_j1_2 v_M1_2) InVars {M1=v_M1_2, j1=v_j1_2} OutVars{M1=v_M1_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[99] L47-->L47-1: Formula: (and (= v_j1_6 (+ v_j1_7 1)) (= v_counter_25 (+ v_counter_26 v_C_12))) InVars {counter=v_counter_26, C=v_C_12, j1=v_j1_7} OutVars{counter=v_counter_25, C=v_C_12, j1=v_j1_6} AuxVars[] AssignedVars[counter, j1]" [2025-04-26 16:56:07,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1698836970, now seen corresponding path program 1 times [2025-04-26 16:56:07,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:07,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563470072] [2025-04-26 16:56:07,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:07,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:07,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:07,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:07,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,326 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:07,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:07,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:07,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:07,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:56:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:07,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126105365] [2025-04-26 16:56:07,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:07,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:07,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:07,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:07,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:07,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:07,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:07,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:07,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,341 INFO L85 PathProgramCache]: Analyzing trace with hash -494752584, now seen corresponding path program 1 times [2025-04-26 16:56:07,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:07,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109207893] [2025-04-26 16:56:07,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:07,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:07,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:07,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:07,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:07,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:07,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:07,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:07,379 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:07,380 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:07,380 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:07,380 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:07,380 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:07,380 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,380 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:07,380 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:07,380 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:07,380 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:07,380 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:07,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,412 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:07,412 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:07,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,414 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:56:07,415 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:56:07,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:07,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:07,433 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:56:07,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,435 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:56:07,436 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:56:07,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:07,440 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:07,504 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:07,509 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:56:07,509 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:07,509 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:07,509 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:07,509 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:07,509 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:07,509 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,509 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:07,509 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:07,509 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:07,509 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:07,509 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:07,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,536 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:07,536 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:07,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,538 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:56:07,544 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:56:07,546 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:56:07,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:07,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:07,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:07,559 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:07,560 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:07,560 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:07,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,562 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:56:07,564 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:56:07,565 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:07,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:56:07,568 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:07,568 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:07,568 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M1, j1) = 1*M1 - 1*j1 Supporting invariants [] [2025-04-26 16:56:07,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:56:07,574 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:07,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:07,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:07,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:07,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:07,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:07,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:07,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:07,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:07,620 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:07,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:07,632 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:56:07,632 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:07,632 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 384 states and 703 transitions. cyclomatic complexity: 397 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:07,686 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 384 states and 703 transitions. cyclomatic complexity: 397. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 834 states and 1561 transitions. Complement of second has 6 states. [2025-04-26 16:56:07,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-26 16:56:07,687 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:56:07,687 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,687 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:56:07,687 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,687 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:56:07,687 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 834 states and 1561 transitions. [2025-04-26 16:56:07,692 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 42 [2025-04-26 16:56:07,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 834 states to 435 states and 810 transitions. [2025-04-26 16:56:07,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2025-04-26 16:56:07,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 157 [2025-04-26 16:56:07,695 INFO L74 IsDeterministic]: Start isDeterministic. Operand 435 states and 810 transitions. [2025-04-26 16:56:07,695 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:07,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 435 states and 810 transitions. [2025-04-26 16:56:07,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states and 810 transitions. [2025-04-26 16:56:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 412. [2025-04-26 16:56:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 412 states have (on average 1.8859223300970873) internal successors, (in total 777), 411 states have internal predecessors, (777), 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:56:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 777 transitions. [2025-04-26 16:56:07,703 INFO L240 hiAutomatonCegarLoop]: Abstraction has 412 states and 777 transitions. [2025-04-26 16:56:07,703 INFO L438 stractBuchiCegarLoop]: Abstraction has 412 states and 777 transitions. [2025-04-26 16:56:07,703 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:07,703 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 412 states and 777 transitions. [2025-04-26 16:56:07,704 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 42 [2025-04-26 16:56:07,704 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:07,704 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:07,704 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:07,704 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:07,705 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L70: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[60] L71-->L72: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[84] L72-->L73: Formula: (< 0 v_C_3) InVars {C=v_C_3} OutVars{C=v_C_3} AuxVars[] AssignedVars[]" "[106] L73-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L24-1-->L24: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[91] L24-->L24-1: Formula: (and (= v_i1_6 (+ v_i1_7 1)) (= v_counter_13 (+ v_counter_14 v_C_6))) InVars {i1=v_i1_7, counter=v_counter_14, C=v_C_6} OutVars{i1=v_i1_6, counter=v_counter_13, C=v_C_6} AuxVars[] AssignedVars[counter, i1]" "[89] L24-1-->L24: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[109] L73-1-->L35-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[93] L35-1-->L35: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[112] L74-->L47-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[97] L47-1-->L47: Formula: (< v_j1_2 v_M1_2) InVars {M1=v_M1_2, j1=v_j1_2} OutVars{M1=v_M1_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[115] L75-->L58-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:56:07,705 INFO L754 eck$LassoCheckResult]: Loop: "[101] L58-1-->L58: Formula: (< v_j2_3 v_M2_3) InVars {j2=v_j2_3, M2=v_M2_3} OutVars{j2=v_j2_3, M2=v_M2_3} AuxVars[] AssignedVars[]" "[103] L58-->L58-1: Formula: (and (< 0 v_counter_34) (= v_counter_34 (+ v_counter_33 v_C_16)) (= (+ v_j2_11 1) v_j2_10)) InVars {j2=v_j2_11, counter=v_counter_34, C=v_C_16} OutVars{j2=v_j2_10, counter=v_counter_33, C=v_C_16} AuxVars[] AssignedVars[counter, j2]" [2025-04-26 16:56:07,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,705 INFO L85 PathProgramCache]: Analyzing trace with hash -494752568, now seen corresponding path program 1 times [2025-04-26 16:56:07,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:07,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957851282] [2025-04-26 16:56:07,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:07,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:07,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:07,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:07,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:07,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:07,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:07,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:07,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,719 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 16:56:07,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:07,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617351004] [2025-04-26 16:56:07,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:07,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:07,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:07,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:07,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,722 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:07,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:07,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:07,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:07,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1284155242, now seen corresponding path program 1 times [2025-04-26 16:56:07,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:07,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905540425] [2025-04-26 16:56:07,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:07,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:07,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:07,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:07,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,731 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:07,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:07,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:07,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:07,763 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:07,764 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:07,764 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:07,764 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:07,764 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:07,764 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,764 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:07,764 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:07,764 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:07,764 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:07,764 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:07,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,796 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:07,796 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:07,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,798 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:56:07,800 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:56:07,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:07,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:07,818 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:07,818 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=1, C=0} Honda state: {counter=1, C=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:07,824 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:56:07,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,829 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:56:07,830 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:56:07,831 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:07,831 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:07,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:07,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,850 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:56:07,851 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:56:07,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:07,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:07,916 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:07,920 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:56:07,921 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:07,921 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:07,921 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:07,921 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:07,921 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:07,921 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,921 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:07,921 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:07,921 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:07,921 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:07,921 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:07,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,953 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:07,953 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:07,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,956 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:56:07,958 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:56:07,958 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:56:07,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:07,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:07,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:07,970 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:07,975 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:56:07,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,977 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:56:07,978 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:56:07,979 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:56:07,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:07,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:07,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:07,993 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:07,995 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:07,995 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:07,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,997 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:56:07,998 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:56:07,998 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:08,001 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:56:08,002 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:08,002 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:08,002 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M2, j2) = 1*M2 - 1*j2 Supporting invariants [] [2025-04-26 16:56:08,007 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:56:08,008 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:08,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:08,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:08,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:08,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:08,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:08,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:08,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:08,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:08,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:08,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:08,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:08,056 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:08,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:08,069 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:56:08,069 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:08,070 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 412 states and 777 transitions. cyclomatic complexity: 445 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:08,122 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 412 states and 777 transitions. cyclomatic complexity: 445. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 757 states and 1474 transitions. Complement of second has 6 states. [2025-04-26 16:56:08,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-26 16:56:08,123 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:56:08,123 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:08,123 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 16:56:08,123 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:08,124 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:56:08,124 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:08,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 757 states and 1474 transitions. [2025-04-26 16:56:08,128 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:08,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 757 states to 0 states and 0 transitions. [2025-04-26 16:56:08,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:08,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:08,129 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:08,129 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:08,129 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:08,129 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:08,129 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:08,129 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:08,129 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:08,129 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:08,129 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:08,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:56:08,141 INFO L201 PluginConnector]: Adding new model mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:08 BoogieIcfgContainer [2025-04-26 16:56:08,141 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:08,142 INFO L158 Benchmark]: Toolchain (without parser) took 3012.23ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.1MB in the beginning and 62.9MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2025-04-26 16:56:08,142 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.73ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:08,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.78ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:08,142 INFO L158 Benchmark]: Boogie Preprocessor took 26.83ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 82.2MB in the end (delta: 953.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:08,142 INFO L158 Benchmark]: RCFGBuilder took 238.44ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 71.6MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:08,143 INFO L158 Benchmark]: BuchiAutomizer took 2706.89ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 71.5MB in the beginning and 62.9MB in the end (delta: 8.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2025-04-26 16:56:08,145 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.73ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.78ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.83ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 82.2MB in the end (delta: 953.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 238.44ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 71.6MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2706.89ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 71.5MB in the beginning and 62.9MB in the end (delta: 8.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 280 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 209 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 91 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 283, Number of transitions in reduction automaton: 497, Number of states in reduction automaton: 259, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N1 + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. One deterministic module has affine ranking function -1 * j1 + M1 and consists of 4 locations. One deterministic module has affine ranking function -1 * j2 + M2 and consists of 4 locations. 1 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:56:08,159 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...