/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-equiv.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:04,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:04,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:04,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:04,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:04,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:04,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:04,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:04,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:04,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:04,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:04,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:04,884 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:04,884 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:04,884 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:04,884 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:04,884 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:04,884 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:04,884 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:04,884 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:04,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:04,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:04,886 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:04,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:04,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:04,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:04,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:04,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:04,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:04,886 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:04,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:04,887 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:04,887 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:04,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:04,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:04,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:04,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:04,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:04,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:04,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:04,887 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:04,887 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:04,887 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:05,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:05,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:05,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:05,112 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:05,113 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:05,115 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-equiv.wvr.bpl [2025-04-26 16:56:05,118 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/mult-equiv.wvr.bpl' [2025-04-26 16:56:05,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:05,135 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:05,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:05,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:05,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:05,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,169 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:05,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:05,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:05,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:05,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:05,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:05,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:05,204 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:05,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:05,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:05,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:05,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:05,267 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:05,267 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:05,267 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:05,268 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:05,268 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:05,268 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:05,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:05,268 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:05,268 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:05,269 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:05,309 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:05,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:05,396 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:05,396 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:05,420 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:05,421 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:05,422 INFO L201 PluginConnector]: Adding new model mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:05 BoogieIcfgContainer [2025-04-26 16:56:05,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:05,424 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:05,424 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:05,428 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:05,429 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:05,429 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/2) ... [2025-04-26 16:56:05,430 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5286051f and model type mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:05, skipping insertion in model container [2025-04-26 16:56:05,430 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:05,430 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:05" (2/2) ... [2025-04-26 16:56:05,431 INFO L376 chiAutomizerObserver]: Analyzing ICFG mult-equiv.wvr.bpl [2025-04-26 16:56:05,482 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:56:05,523 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:05,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:05,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:05,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:05,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 16:56:05,603 INFO L116 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-04-26 16:56:05,605 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:56:05,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 3/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 16:56:05,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 16:56:05,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 64 flow [2025-04-26 16:56:05,611 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 23 transitions, 64 flow [2025-04-26 16:56:05,619 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:05,748 WARN L140 AmpleReduction]: Number of pruned transitions: 87 [2025-04-26 16:56:05,748 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:05,748 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 34 [2025-04-26 16:56:05,748 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:26 [2025-04-26 16:56:05,748 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:50 [2025-04-26 16:56:05,749 WARN L145 AmpleReduction]: Times succ was already a loop node:64 [2025-04-26 16:56:05,749 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:4 [2025-04-26 16:56:05,749 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:05,750 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 111 states, 109 states have (on average 2.055045871559633) internal successors, (in total 224), 110 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:05,756 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:05,756 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:05,756 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:05,756 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:05,756 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:05,756 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:05,756 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:05,756 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:05,759 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 111 states, 109 states have (on average 2.055045871559633) internal successors, (in total 224), 110 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:05,774 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 80 [2025-04-26 16:56:05,775 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:05,775 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:05,782 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:05,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:05,782 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:05,783 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 111 states, 109 states have (on average 2.055045871559633) internal successors, (in total 224), 110 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:05,787 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 80 [2025-04-26 16:56:05,787 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:05,787 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:05,788 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:05,788 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:05,795 INFO L752 eck$LassoCheckResult]: Stem: "[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[]" "[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:05,795 INFO L754 eck$LassoCheckResult]: Loop: "[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[]" "[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {M=v_M_4, p=v_p_8, N=v_N_13} OutVars{M=v_M_4, p=v_p_7, N=v_N_12} AuxVars[] AssignedVars[p, N]" [2025-04-26 16:56:05,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:05,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2679, now seen corresponding path program 1 times [2025-04-26 16:56:05,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:05,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249484727] [2025-04-26 16:56:05,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:05,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:05,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:05,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:05,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:05,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:05,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:05,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:05,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:05,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2025-04-26 16:56:05,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:05,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462528255] [2025-04-26 16:56:05,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:05,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:05,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:05,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:05,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:05,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:05,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:05,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:05,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:05,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2576505, now seen corresponding path program 1 times [2025-04-26 16:56:05,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:05,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886512620] [2025-04-26 16:56:05,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:05,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:05,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:05,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:05,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,918 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:05,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:05,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:05,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:05,985 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:05,986 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:05,986 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:05,986 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:05,986 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:05,986 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:05,987 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:05,987 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:05,987 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-equiv.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:05,987 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:05,987 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:06,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,100 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:06,105 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:06,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:06,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:06,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:06,169 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:06,169 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {M=0, p=0} Honda state: {M=0, p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:06,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:06,187 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:06,187 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:06,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,213 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:06,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:06,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:06,241 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:06,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:56:06,246 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:06,246 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:06,246 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:06,246 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:06,246 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:06,246 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,246 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:06,246 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:06,246 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-equiv.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:06,246 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:06,246 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:06,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,292 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:06,296 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:06,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:06,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:06,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:06,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:06,321 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:06,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:56:06,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:06,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:06,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:06,345 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:06,348 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:06,348 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:06,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,351 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:56:06,353 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:06,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,357 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:06,357 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:06,357 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N) = 1*N Supporting invariants [] [2025-04-26 16:56:06,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,366 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:06,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:06,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:06,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:06,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:06,407 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:06,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:06,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:06,437 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:06,439 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 111 states, 109 states have (on average 2.055045871559633) internal successors, (in total 224), 110 states have internal predecessors, (224), 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 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,545 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 111 states, 109 states have (on average 2.055045871559633) internal successors, (in total 224), 110 states have internal predecessors, (224), 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 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 367 states and 769 transitions. Complement of second has 7 states. [2025-04-26 16:56:06,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-04-26 16:56:06,552 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:56:06,553 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,553 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:56:06,553 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,553 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:56:06,553 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 367 states and 769 transitions. [2025-04-26 16:56:06,560 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 64 [2025-04-26 16:56:06,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 367 states to 175 states and 373 transitions. [2025-04-26 16:56:06,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2025-04-26 16:56:06,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2025-04-26 16:56:06,571 INFO L74 IsDeterministic]: Start isDeterministic. Operand 175 states and 373 transitions. [2025-04-26 16:56:06,571 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:06,571 INFO L218 hiAutomatonCegarLoop]: Abstraction has 175 states and 373 transitions. [2025-04-26 16:56:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 373 transitions. [2025-04-26 16:56:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 142. [2025-04-26 16:56:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 2.183098591549296) internal successors, (in total 310), 141 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 310 transitions. [2025-04-26 16:56:06,592 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 310 transitions. [2025-04-26 16:56:06,592 INFO L438 stractBuchiCegarLoop]: Abstraction has 142 states and 310 transitions. [2025-04-26 16:56:06,592 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:06,592 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 310 transitions. [2025-04-26 16:56:06,594 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 64 [2025-04-26 16:56:06,594 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:06,594 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:06,594 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:06,594 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:06,595 INFO L752 eck$LassoCheckResult]: Stem: "[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[]" "[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:56:06,595 INFO L754 eck$LassoCheckResult]: Loop: "[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[68] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_N_17))) (and (= v_N_16 (ite .cse0 (+ (- 2) v_N_17) v_N_17)) (= v_p_11 (ite .cse0 (+ v_p_12 (* 2 v_M_6)) v_p_12)))) InVars {M=v_M_6, p=v_p_12, N=v_N_17} OutVars{M=v_M_6, p=v_p_11, N=v_N_16} AuxVars[] AssignedVars[p, N]" [2025-04-26 16:56:06,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash 83127, now seen corresponding path program 1 times [2025-04-26 16:56:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972916230] [2025-04-26 16:56:06,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:06,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:06,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:06,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:06,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,604 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2025-04-26 16:56:06,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038762633] [2025-04-26 16:56:06,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,615 INFO L85 PathProgramCache]: Analyzing trace with hash 79887161, now seen corresponding path program 1 times [2025-04-26 16:56:06,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576052135] [2025-04-26 16:56:06,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:06,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:06,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:06,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:06,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,660 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:06,660 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:06,660 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:06,660 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:06,660 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:06,660 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,660 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:06,660 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:06,660 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-equiv.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:06,660 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:06,660 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:06,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,687 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:06,687 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:06,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,690 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:56:06,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:06,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:06,703 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:06,703 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {M=0, p=0} Honda state: {M=0, p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:06,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,711 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:56:06,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:06,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:06,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,733 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:56:06,735 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:06,735 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:06,758 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:06,762 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 16:56:06,762 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:06,762 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:06,762 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:06,762 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:06,762 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:06,762 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,762 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:06,762 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:06,762 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-equiv.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:06,762 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:06,762 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:06,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,797 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:06,797 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:06,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,799 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:56:06,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:06,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:06,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:06,816 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:06,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:56:06,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,824 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:56:06,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:06,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:06,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:06,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:06,842 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:06,842 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:06,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,844 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:56:06,846 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:06,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,849 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:06,849 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:06,850 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N) = 1*N Supporting invariants [] [2025-04-26 16:56:06,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,856 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:06,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:06,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:06,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:06,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:06,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:06,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:06,884 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:06,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:06,896 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:06,896 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 310 transitions. cyclomatic complexity: 198 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,946 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 310 transitions. cyclomatic complexity: 198. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 412 states and 925 transitions. Complement of second has 6 states. [2025-04-26 16:56:06,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-26 16:56:06,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:56:06,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:56:06,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:56:06,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 412 states and 925 transitions. [2025-04-26 16:56:06,956 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 28 [2025-04-26 16:56:06,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 412 states to 217 states and 486 transitions. [2025-04-26 16:56:06,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2025-04-26 16:56:06,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-04-26 16:56:06,962 INFO L74 IsDeterministic]: Start isDeterministic. Operand 217 states and 486 transitions. [2025-04-26 16:56:06,962 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:06,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 217 states and 486 transitions. [2025-04-26 16:56:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states and 486 transitions. [2025-04-26 16:56:06,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 195. [2025-04-26 16:56:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 195 states have (on average 2.276923076923077) internal successors, (in total 444), 194 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 444 transitions. [2025-04-26 16:56:06,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 195 states and 444 transitions. [2025-04-26 16:56:06,970 INFO L438 stractBuchiCegarLoop]: Abstraction has 195 states and 444 transitions. [2025-04-26 16:56:06,970 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:06,970 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 444 transitions. [2025-04-26 16:56:06,971 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 28 [2025-04-26 16:56:06,971 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:06,971 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:06,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:56:06,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:06,972 INFO L752 eck$LassoCheckResult]: Stem: "[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[]" "[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] L52-1-->L30-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]" "[81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:56:06,972 INFO L754 eck$LassoCheckResult]: Loop: "[70] L41-1-->L41: Formula: (< 0 v_L_3) InVars {L=v_L_3} OutVars{L=v_L_3} AuxVars[] AssignedVars[]" "[72] L41-->L41-1: Formula: (and (= (+ v_M_8 v_q_6) v_q_5) (= (+ v_L_6 1) v_L_7)) InVars {q=v_q_6, M=v_M_8, L=v_L_7} OutVars{q=v_q_5, M=v_M_8, L=v_L_6} AuxVars[] AssignedVars[q, L]" [2025-04-26 16:56:06,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2577018, now seen corresponding path program 1 times [2025-04-26 16:56:06,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923401084] [2025-04-26 16:56:06,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:06,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:06,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,976 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:06,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:06,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,979 INFO L85 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2025-04-26 16:56:06,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863262953] [2025-04-26 16:56:06,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1818450756, now seen corresponding path program 1 times [2025-04-26 16:56:06,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431797124] [2025-04-26 16:56:06,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:06,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:06,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:07,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:07,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:07,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:07,021 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:07,021 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:07,022 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:07,022 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:07,022 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:07,022 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,022 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:07,022 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:07,022 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-equiv.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:07,022 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:07,022 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:07,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,046 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:07,046 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:07,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,048 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:56:07,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:07,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:07,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:56:07,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,068 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:56:07,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:07,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:07,091 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:07,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:56:07,095 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:07,095 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:07,095 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:07,095 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:07,096 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:07,096 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,096 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:07,096 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:07,096 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-equiv.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:07,096 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:07,096 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:07,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,131 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:07,131 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:07,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,133 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:56:07,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:07,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:07,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:07,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:07,148 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:07,150 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:07,150 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:07,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,152 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:56:07,153 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:07,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:56:07,156 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:07,156 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:07,156 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(L) = 1*L Supporting invariants [] [2025-04-26 16:56:07,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:07,162 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:07,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:07,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:07,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:07,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:07,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:07,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:07,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:07,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:07,183 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:07,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:07,195 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:07,195 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 195 states and 444 transitions. cyclomatic complexity: 284 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:07,236 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 195 states and 444 transitions. cyclomatic complexity: 284. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 416 states and 886 transitions. Complement of second has 6 states. [2025-04-26 16:56:07,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 16:56:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 16:56:07,238 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:56:07,238 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,238 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:56:07,238 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,239 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:56:07,239 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 416 states and 886 transitions. [2025-04-26 16:56:07,242 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:07,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 416 states to 0 states and 0 transitions. [2025-04-26 16:56:07,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:07,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:07,242 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:07,242 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:07,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:07,242 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:07,242 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:07,242 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:07,242 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:07,242 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:07,242 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:07,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:07,254 INFO L201 PluginConnector]: Adding new model mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:07 BoogieIcfgContainer [2025-04-26 16:56:07,254 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:07,255 INFO L158 Benchmark]: Toolchain (without parser) took 2119.41ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 85.7MB in the beginning and 29.7MB in the end (delta: 56.0MB). Peak memory consumption was 44.7MB. Max. memory is 8.0GB. [2025-04-26 16:56:07,256 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.72ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 86.6MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:07,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.75ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 83.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:07,256 INFO L158 Benchmark]: Boogie Preprocessor took 31.12ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 82.8MB in the end (delta: 991.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:07,256 INFO L158 Benchmark]: RCFGBuilder took 218.10ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 73.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:07,256 INFO L158 Benchmark]: BuchiAutomizer took 1830.10ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.1MB in the beginning and 29.7MB in the end (delta: 43.4MB). Peak memory consumption was 32.1MB. Max. memory is 8.0GB. [2025-04-26 16:56:07,257 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.72ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 86.6MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.75ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 83.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.12ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 82.8MB in the end (delta: 991.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 218.10ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 73.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1830.10ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.1MB in the beginning and 29.7MB in the end (delta: 43.4MB). Peak memory consumption was 32.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 55 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 38 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf95 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 229, Number of transitions in reduction automaton: 224, Number of states in reduction automaton: 111, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N and consists of 5 locations. One deterministic module has affine ranking function N and consists of 4 locations. One deterministic module has affine ranking function L and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:07,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...