/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 18:41:36,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:36,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:36,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:36,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:36,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:36,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:36,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:36,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:36,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:36,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:36,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:36,948 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:36,948 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:36,948 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:36,949 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:36,949 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:36,949 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:36,949 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:36,949 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:36,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:36,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:36,949 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:36,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:36,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:36,950 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:36,951 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:36,951 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:37,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:37,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:37,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:37,178 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:37,179 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:37,181 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 18:41:37,182 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 18:41:37,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:37,208 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:37,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:37,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:37,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:37,217 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 06:41:37" (1/1) ... [2025-04-26 18:41:37,238 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 06:41:37" (1/1) ... [2025-04-26 18:41:37,243 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:37,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:37,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:37,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:37,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:37,249 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 06:41:37" (1/1) ... [2025-04-26 18:41:37,250 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 06:41:37" (1/1) ... [2025-04-26 18:41:37,252 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 06:41:37" (1/1) ... [2025-04-26 18:41:37,252 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 06:41:37" (1/1) ... [2025-04-26 18:41:37,253 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 06:41:37" (1/1) ... [2025-04-26 18:41:37,254 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 06:41:37" (1/1) ... [2025-04-26 18:41:37,257 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 06:41:37" (1/1) ... [2025-04-26 18:41:37,260 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 06:41:37" (1/1) ... [2025-04-26 18:41:37,260 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 06:41:37" (1/1) ... [2025-04-26 18:41:37,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:37,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:37,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:37,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:37,272 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 06:41:37" (1/1) ... [2025-04-26 18:41:37,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:37,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:37,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:37,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:37,325 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:37,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:37,325 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:37,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:37,325 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:37,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:37,325 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:37,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:37,326 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:41:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:41:37,326 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:41:37,327 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:41:37,367 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:37,369 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:37,481 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:37,481 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:37,503 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:37,503 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:37,504 INFO L201 PluginConnector]: Adding new model mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:37 BoogieIcfgContainer [2025-04-26 18:41:37,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:37,504 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:37,504 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:37,511 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:37,511 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:37,511 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 06:41:37" (1/2) ... [2025-04-26 18:41:37,512 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13256e17 and model type mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:37, skipping insertion in model container [2025-04-26 18:41:37,512 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:37,512 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 06:41:37" (2/2) ... [2025-04-26 18:41:37,513 INFO L376 chiAutomizerObserver]: Analyzing ICFG mult-4.wvr.bpl [2025-04-26 18:41:37,570 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:41:37,605 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:37,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:37,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:37,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:37,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:37,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 108 flow [2025-04-26 18:41:37,673 INFO L116 PetriNetUnfolderBase]: 4/32 cut-off events. [2025-04-26 18:41:37,674 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:41:37,682 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 18:41:37,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 40 transitions, 108 flow [2025-04-26 18:41:37,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 88 flow [2025-04-26 18:41:37,688 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 41 places, 32 transitions, 88 flow [2025-04-26 18:41:37,688 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 32 transitions, 88 flow [2025-04-26 18:41:37,743 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 434 states, 432 states have (on average 3.837962962962963) internal successors, (in total 1658), 433 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:37,745 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 434 states, 432 states have (on average 3.837962962962963) internal successors, (in total 1658), 433 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:37,748 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:37,897 WARN L140 AmpleReduction]: Number of pruned transitions: 286 [2025-04-26 18:41:37,897 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:37,897 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 68 [2025-04-26 18:41:37,898 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:36 [2025-04-26 18:41:37,898 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:154 [2025-04-26 18:41:37,898 WARN L145 AmpleReduction]: Times succ was already a loop node:120 [2025-04-26 18:41:37,898 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:8 [2025-04-26 18:41:37,898 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:37,901 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 18:41:37,907 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:37,907 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:37,907 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:37,907 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:37,907 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:37,907 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:37,907 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:37,907 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:37,909 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 18:41:37,923 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 184 [2025-04-26 18:41:37,924 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:37,924 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:37,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:37,927 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:37,927 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:37,927 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 18:41:37,932 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 184 [2025-04-26 18:41:37,932 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:37,932 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:37,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:37,933 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:37,940 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 18:41:37,941 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 18:41:37,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:37,946 INFO L85 PathProgramCache]: Analyzing trace with hash 106026957, now seen corresponding path program 1 times [2025-04-26 18:41:37,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:37,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968274024] [2025-04-26 18:41:37,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:37,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:37,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:38,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:38,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,004 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:38,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:38,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:38,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:38,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:38,026 INFO L85 PathProgramCache]: Analyzing trace with hash 3811, now seen corresponding path program 1 times [2025-04-26 18:41:38,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:38,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049576870] [2025-04-26 18:41:38,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:38,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:38,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:38,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:38,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,035 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:38,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:38,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:38,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:38,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:38,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1187306577, now seen corresponding path program 1 times [2025-04-26 18:41:38,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:38,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920758151] [2025-04-26 18:41:38,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:38,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:38,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:38,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:38,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,080 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:38,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:38,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:38,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:38,164 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:38,164 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:38,164 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:38,164 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:38,164 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:38,165 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,165 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:38,165 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:38,165 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:38,165 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:38,165 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:38,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,261 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:38,262 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:38,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:38,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:38,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:41:38,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:38,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:38,287 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:38,287 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 18:41:38,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:38,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:38,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:38,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:41:38,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:38,301 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:38,318 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 18:41:38,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:38,321 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:38,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:41:38,324 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:38,324 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:38,392 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:38,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:41:38,396 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:38,396 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:38,397 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:38,397 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:38,397 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:38,397 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,397 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:38,397 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:38,397 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:38,397 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:38,397 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:38,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,437 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:38,440 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:38,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:38,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:38,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:41:38,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:38,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:38,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:38,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:38,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:38,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:38,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:38,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:38,464 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:38,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:41:38,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:38,471 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:38,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:41:38,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:38,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:38,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:38,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:38,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:38,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:38,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:38,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:38,486 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:38,489 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:38,490 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:38,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:38,492 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:38,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:41:38,499 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:38,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:41:38,503 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:38,503 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:38,503 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N1, i1) = 1*N1 - 1*i1 Supporting invariants [] [2025-04-26 18:41:38,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:38,511 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:38,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:38,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:38,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:38,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:38,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:38,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:38,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:38,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:38,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:38,555 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:38,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:38,590 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:38,592 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 18:41:38,676 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 18:41:38,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-04-26 18:41:38,684 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:41:38,685 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:38,685 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:41:38,685 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:38,685 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:41:38,685 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:38,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 542 states and 1055 transitions. [2025-04-26 18:41:38,696 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 144 [2025-04-26 18:41:38,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 542 states to 283 states and 528 transitions. [2025-04-26 18:41:38,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2025-04-26 18:41:38,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2025-04-26 18:41:38,703 INFO L74 IsDeterministic]: Start isDeterministic. Operand 283 states and 528 transitions. [2025-04-26 18:41:38,704 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:38,704 INFO L218 hiAutomatonCegarLoop]: Abstraction has 283 states and 528 transitions. [2025-04-26 18:41:38,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states and 528 transitions. [2025-04-26 18:41:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 261. [2025-04-26 18:41:38,734 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 18:41:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 490 transitions. [2025-04-26 18:41:38,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 261 states and 490 transitions. [2025-04-26 18:41:38,736 INFO L438 stractBuchiCegarLoop]: Abstraction has 261 states and 490 transitions. [2025-04-26 18:41:38,736 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:38,736 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 490 transitions. [2025-04-26 18:41:38,738 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 144 [2025-04-26 18:41:38,738 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:38,738 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:38,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:38,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:38,739 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 18:41:38,739 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 18:41:38,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:38,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1187306559, now seen corresponding path program 1 times [2025-04-26 18:41:38,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:38,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541701733] [2025-04-26 18:41:38,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:38,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:38,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:38,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:38,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:38,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:38,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:38,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:38,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:38,750 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2025-04-26 18:41:38,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:38,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050364878] [2025-04-26 18:41:38,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:38,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:38,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:38,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:38,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:38,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:38,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:38,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:38,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1459700515, now seen corresponding path program 1 times [2025-04-26 18:41:38,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:38,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255442784] [2025-04-26 18:41:38,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:38,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:38,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:38,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:38,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:38,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:38,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255442784] [2025-04-26 18:41:38,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255442784] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:38,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:38,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:38,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360404552] [2025-04-26 18:41:38,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:38,888 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:38,888 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:38,888 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:38,888 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:38,888 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:38,888 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,888 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:38,888 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:38,888 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:38,888 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:38,888 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:38,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,924 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:38,925 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:38,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:38,927 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:38,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:41:38,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:38,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:38,947 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:38,948 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 18:41:38,953 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 18:41:38,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:38,955 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:38,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:41:38,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:38,957 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:38,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:41:38,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:38,975 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:38,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:41:38,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:38,977 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:39,040 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:39,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:41:39,044 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:39,044 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:39,044 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:39,044 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:39,045 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:39,045 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,045 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:39,045 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:39,045 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:39,045 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:39,045 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:39,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,078 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:39,078 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:39,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:39,081 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:39,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:41:39,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:39,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:39,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:39,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:39,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:39,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:39,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:39,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:39,099 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:39,105 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 18:41:39,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:39,107 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:39,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:41:39,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:39,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:39,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:39,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:39,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:39,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:39,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:39,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:39,124 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:39,127 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:39,127 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:39,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:39,129 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:39,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:41:39,131 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:39,134 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 18:41:39,134 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:39,134 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:39,134 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N2) = -1*i2 + 1*N2 Supporting invariants [] [2025-04-26 18:41:39,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:39,141 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:39,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:39,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:39,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:39,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:39,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:39,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:39,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:39,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:39,179 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:39,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:39,193 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:39,193 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 18:41:39,258 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 18:41:39,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:39,260 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 18:41:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-26 18:41:39,261 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:41:39,261 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:39,261 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:41:39,261 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:39,261 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:41:39,261 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:39,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 1063 transitions. [2025-04-26 18:41:39,265 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 82 [2025-04-26 18:41:39,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 330 states and 622 transitions. [2025-04-26 18:41:39,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2025-04-26 18:41:39,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2025-04-26 18:41:39,271 INFO L74 IsDeterministic]: Start isDeterministic. Operand 330 states and 622 transitions. [2025-04-26 18:41:39,271 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:39,271 INFO L218 hiAutomatonCegarLoop]: Abstraction has 330 states and 622 transitions. [2025-04-26 18:41:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 622 transitions. [2025-04-26 18:41:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 306. [2025-04-26 18:41:39,279 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 18:41:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 582 transitions. [2025-04-26 18:41:39,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 306 states and 582 transitions. [2025-04-26 18:41:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:39,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:41:39,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:41:39,282 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 18:41:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:39,330 INFO L93 Difference]: Finished difference Result 613 states and 1104 transitions. [2025-04-26 18:41:39,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 613 states and 1104 transitions. [2025-04-26 18:41:39,333 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 152 [2025-04-26 18:41:39,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 613 states to 595 states and 1086 transitions. [2025-04-26 18:41:39,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2025-04-26 18:41:39,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2025-04-26 18:41:39,337 INFO L74 IsDeterministic]: Start isDeterministic. Operand 595 states and 1086 transitions. [2025-04-26 18:41:39,337 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:39,337 INFO L218 hiAutomatonCegarLoop]: Abstraction has 595 states and 1086 transitions. [2025-04-26 18:41:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states and 1086 transitions. [2025-04-26 18:41:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 384. [2025-04-26 18:41:39,355 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 18:41:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 703 transitions. [2025-04-26 18:41:39,357 INFO L240 hiAutomatonCegarLoop]: Abstraction has 384 states and 703 transitions. [2025-04-26 18:41:39,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:41:39,357 INFO L438 stractBuchiCegarLoop]: Abstraction has 384 states and 703 transitions. [2025-04-26 18:41:39,357 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:39,358 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 384 states and 703 transitions. [2025-04-26 18:41:39,359 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 82 [2025-04-26 18:41:39,359 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:39,359 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:39,359 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:39,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:39,360 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]" "[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[]" "[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 18:41:39,360 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 18:41:39,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1682091434, now seen corresponding path program 1 times [2025-04-26 18:41:39,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:39,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427615693] [2025-04-26 18:41:39,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:39,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:39,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:39,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:39,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:39,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:39,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:39,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:39,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 18:41:39,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:39,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516949887] [2025-04-26 18:41:39,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:39,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:39,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:39,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:39,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,394 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:39,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:39,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:39,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:39,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1582161672, now seen corresponding path program 2 times [2025-04-26 18:41:39,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:39,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014707891] [2025-04-26 18:41:39,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:39,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:39,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-26 18:41:39,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:39,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:39,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,405 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:39,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:39,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:39,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:39,454 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:39,454 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:39,454 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:39,454 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:39,454 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:39,454 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,454 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:39,454 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:39,454 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:41:39,454 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:39,454 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:39,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,482 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:39,482 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:39,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:39,484 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:39,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:41:39,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:39,487 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:39,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:41:39,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:39,505 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:39,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:39,506 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:39,506 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:39,568 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:39,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:41:39,573 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:39,573 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:39,573 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:39,573 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:39,573 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:39,573 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,573 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:39,573 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:39,573 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:41:39,573 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:39,573 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:39,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,602 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:39,602 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:39,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:39,606 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:39,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:41:39,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:39,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:39,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:39,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:39,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:39,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:39,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:39,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:39,624 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:39,626 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:41:39,626 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:39,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:39,628 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:39,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:41:39,630 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:39,634 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 18:41:39,634 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:39,634 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:39,634 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M1, j1) = 1*M1 - 1*j1 Supporting invariants [] [2025-04-26 18:41:39,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:39,641 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:39,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:39,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:39,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:39,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:39,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:39,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:39,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:39,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:39,683 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:39,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:39,695 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:39,695 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.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:39,751 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.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1023 states and 1990 transitions. Complement of second has 6 states. [2025-04-26 18:41:39,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-04-26 18:41:39,752 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:41:39,752 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:39,752 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:41:39,752 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:39,752 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:41:39,752 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:39,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1023 states and 1990 transitions. [2025-04-26 18:41:39,759 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 84 [2025-04-26 18:41:39,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1023 states to 615 states and 1170 transitions. [2025-04-26 18:41:39,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 247 [2025-04-26 18:41:39,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 264 [2025-04-26 18:41:39,763 INFO L74 IsDeterministic]: Start isDeterministic. Operand 615 states and 1170 transitions. [2025-04-26 18:41:39,763 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:39,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 615 states and 1170 transitions. [2025-04-26 18:41:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states and 1170 transitions. [2025-04-26 18:41:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 480. [2025-04-26 18:41:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 480 states have (on average 1.925) internal successors, (in total 924), 479 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 924 transitions. [2025-04-26 18:41:39,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 480 states and 924 transitions. [2025-04-26 18:41:39,773 INFO L438 stractBuchiCegarLoop]: Abstraction has 480 states and 924 transitions. [2025-04-26 18:41:39,773 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:39,773 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 480 states and 924 transitions. [2025-04-26 18:41:39,775 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 54 [2025-04-26 18:41:39,775 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:39,775 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:39,775 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:39,776 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:39,776 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]" "[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[]" "[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]" "[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 18:41:39,776 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 18:41:39,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1582161656, now seen corresponding path program 1 times [2025-04-26 18:41:39,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:39,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387981242] [2025-04-26 18:41:39,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:39,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:39,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:39,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:39,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,783 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:39,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:39,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:39,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:39,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,798 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 18:41:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:39,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162116671] [2025-04-26 18:41:39,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:39,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:39,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:39,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:39,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:39,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:39,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:39,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:39,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,807 INFO L85 PathProgramCache]: Analyzing trace with hash -38925398, now seen corresponding path program 1 times [2025-04-26 18:41:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:39,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726308841] [2025-04-26 18:41:39,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:39,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:39,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:39,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:39,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:39,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:39,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:39,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:39,857 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:39,857 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:39,857 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:39,857 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:39,857 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:39,857 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,857 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:39,857 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:39,857 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 18:41:39,857 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:39,857 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:39,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,887 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:39,887 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:39,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:39,889 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:39,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:41:39,890 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:39,890 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:39,908 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:39,908 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 18:41:39,913 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 18:41:39,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:39,915 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:39,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:41:39,917 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:39,917 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:39,932 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 18:41:39,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:39,934 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:39,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:41:39,936 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:39,936 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:39,999 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:40,004 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 18:41:40,004 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:40,004 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:40,004 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:40,004 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:40,004 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:40,004 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:40,004 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:40,004 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:40,004 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 18:41:40,004 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:40,004 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:40,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:40,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:40,042 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:40,042 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:40,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:40,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:40,065 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:40,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:41:40,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:40,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:40,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:40,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:40,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:40,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:40,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:40,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:40,079 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:40,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:41:40,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:40,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:40,086 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 18:41:40,087 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 18:41:40,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:40,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:40,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:40,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:40,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:40,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:40,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:40,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:40,104 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:40,106 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:41:40,106 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:40,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:40,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:40,108 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 18:41:40,109 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 18:41:40,110 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:40,113 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 18:41:40,113 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:40,113 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:40,113 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M2, j2) = 1*M2 - 1*j2 Supporting invariants [] [2025-04-26 18:41:40,119 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 18:41:40,119 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:40,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:40,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:40,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:40,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:40,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:40,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:40,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:40,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:40,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:40,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:40,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:40,174 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:40,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:40,189 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:40,189 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 480 states and 924 transitions. cyclomatic complexity: 541 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:40,237 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 480 states and 924 transitions. cyclomatic complexity: 541. 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 906 states and 1807 transitions. Complement of second has 6 states. [2025-04-26 18:41:40,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-26 18:41:40,238 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:41:40,238 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:40,238 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 18:41:40,238 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:40,239 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 18:41:40,239 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:40,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 906 states and 1807 transitions. [2025-04-26 18:41:40,244 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:40,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 906 states to 0 states and 0 transitions. [2025-04-26 18:41:40,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:40,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:40,244 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:40,244 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:40,244 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:40,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:40,244 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:40,244 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:40,245 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:40,245 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:40,245 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:40,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:41:40,257 INFO L201 PluginConnector]: Adding new model mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:40 BoogieIcfgContainer [2025-04-26 18:41:40,257 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:40,258 INFO L158 Benchmark]: Toolchain (without parser) took 3050.10ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 96.0MB in the beginning and 52.6MB in the end (delta: 43.5MB). Peak memory consumption was 30.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:40,258 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.79ms. Allocated memory is still 167.8MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:40,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.71ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 94.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:40,258 INFO L158 Benchmark]: Boogie Preprocessor took 26.06ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 93.2MB in the end (delta: 966.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:40,258 INFO L158 Benchmark]: RCFGBuilder took 232.22ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 82.6MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:40,259 INFO L158 Benchmark]: BuchiAutomizer took 2752.96ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 82.4MB in the beginning and 52.6MB in the end (delta: 29.9MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. [2025-04-26 18:41:40,261 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.79ms. Allocated memory is still 167.8MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.71ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 94.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.06ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 93.2MB in the end (delta: 966.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 232.22ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 82.6MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2752.96ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 82.4MB in the beginning and 52.6MB in the end (delta: 29.9MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.6s. 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, 392 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, 292 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 202 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 97 mSDtfsCounter, 172 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.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 297, 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 18:41:40,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...