/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/mult-dist.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:48,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:48,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:48,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:48,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:48,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:48,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:48,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:48,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:48,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:48,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:48,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:48,747 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:48,747 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:48,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:48,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:48,749 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:48,749 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:48,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:48,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:48,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:48,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:48,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:48,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:48,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:48,749 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:48,749 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:48,749 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:48,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:48,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:48,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:48,956 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:48,957 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:48,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/mult-dist.wvr.bpl [2025-04-26 18:39:48,961 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/mult-dist.wvr.bpl' [2025-04-26 18:39:48,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:48,981 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:48,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:48,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:48,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:48,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:48" (1/1) ... [2025-04-26 18:39:49,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:48" (1/1) ... [2025-04-26 18:39:49,015 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:49,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:49,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:49,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:49,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:49,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:48" (1/1) ... [2025-04-26 18:39:49,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:48" (1/1) ... [2025-04-26 18:39:49,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:48" (1/1) ... [2025-04-26 18:39:49,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:48" (1/1) ... [2025-04-26 18:39:49,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:48" (1/1) ... [2025-04-26 18:39:49,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:48" (1/1) ... [2025-04-26 18:39:49,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:48" (1/1) ... [2025-04-26 18:39:49,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:48" (1/1) ... [2025-04-26 18:39:49,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:48" (1/1) ... [2025-04-26 18:39:49,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:49,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:49,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:49,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:49,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:48" (1/1) ... [2025-04-26 18:39:49,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:49,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:49,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:39:49,105 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:49,106 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:49,106 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:49,106 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:39:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:39:49,107 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:39:49,143 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:49,145 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:49,223 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:49,223 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:49,237 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:49,238 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:49,238 INFO L201 PluginConnector]: Adding new model mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:49 BoogieIcfgContainer [2025-04-26 18:39:49,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:49,242 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:49,242 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:49,248 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:49,248 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:49,248 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:48" (1/2) ... [2025-04-26 18:39:49,249 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d2b4662 and model type mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:49, skipping insertion in model container [2025-04-26 18:39:49,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:49,250 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:49" (2/2) ... [2025-04-26 18:39:49,251 INFO L376 chiAutomizerObserver]: Analyzing ICFG mult-dist.wvr.bpl [2025-04-26 18:39:49,303 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:39:49,343 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:49,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:49,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,345 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:49,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:39:49,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 18:39:49,412 INFO L116 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-04-26 18:39:49,413 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:39:49,420 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 18:39:49,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 18:39:49,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 64 flow [2025-04-26 18:39:49,423 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 23 transitions, 64 flow [2025-04-26 18:39:49,424 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 23 transitions, 64 flow [2025-04-26 18:39:49,440 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 111 states, 109 states have (on average 2.853211009174312) internal successors, (in total 311), 110 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:49,440 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 111 states, 109 states have (on average 2.853211009174312) internal successors, (in total 311), 110 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:49,442 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:49,490 WARN L140 AmpleReduction]: Number of pruned transitions: 87 [2025-04-26 18:39:49,491 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:49,491 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 18:39:49,491 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:20 [2025-04-26 18:39:49,491 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:51 [2025-04-26 18:39:49,491 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 18:39:49,491 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:2 [2025-04-26 18:39:49,491 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:49,492 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 18:39:49,501 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:49,501 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:49,501 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:49,501 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:49,501 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:49,501 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:49,502 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:49,502 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:49,503 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 18:39:49,513 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:39:49,514 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:49,514 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:49,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:49,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:49,516 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:49,517 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 18:39:49,520 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:39:49,520 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:49,520 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:49,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:49,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:49,523 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L56: Formula: (and (= v_x_1_3 0) (= v_x_3_1 v_x_1_3) (= v_i_1_5 v_x_1_3) (<= 0 v_b_3) (= v_i_2_5 v_x_1_3) (= v_i_3_1 v_x_1_3) (= v_x_2_3 v_x_1_3) (<= 0 v_a_3) (<= 0 v_c_3)) InVars {x_1=v_x_1_3, a=v_a_3, x_2=v_x_2_3, x_3=v_x_3_1, i_2=v_i_2_5, i_3=v_i_3_1, i_1=v_i_1_5, c=v_c_3, b=v_b_3} OutVars{x_1=v_x_1_3, a=v_a_3, x_2=v_x_2_3, x_3=v_x_3_1, i_2=v_i_2_5, i_3=v_i_3_1, i_1=v_i_1_5, c=v_c_3, b=v_b_3} AuxVars[] AssignedVars[]" "[75] L56-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:39:49,524 INFO L754 eck$LassoCheckResult]: Loop: "[62] L23-1-->L23: Formula: (< v_i_1_1 v_a_1) InVars {a=v_a_1, i_1=v_i_1_1} OutVars{a=v_a_1, i_1=v_i_1_1} AuxVars[] AssignedVars[]" "[64] L23-->L23-1: Formula: (and (= (+ v_i_1_7 1) v_i_1_6) (= (+ v_c_5 v_x_1_6) v_x_1_5)) InVars {x_1=v_x_1_6, c=v_c_5, i_1=v_i_1_7} OutVars{x_1=v_x_1_5, c=v_c_5, i_1=v_i_1_6} AuxVars[] AssignedVars[x_1, i_1]" [2025-04-26 18:39:49,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:49,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2710, now seen corresponding path program 1 times [2025-04-26 18:39:49,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:49,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674676505] [2025-04-26 18:39:49,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:49,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:49,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:49,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:49,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:49,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:49,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:49,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:49,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:49,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2025-04-26 18:39:49,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:49,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706934339] [2025-04-26 18:39:49,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:49,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:49,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:49,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:49,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:49,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:49,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:49,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:49,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:49,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2606296, now seen corresponding path program 1 times [2025-04-26 18:39:49,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:49,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158361597] [2025-04-26 18:39:49,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:49,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:49,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:49,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:49,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:49,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:49,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:49,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:49,732 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:49,733 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:49,733 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:49,733 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:49,733 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:39:49,733 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,733 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:49,733 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:49,733 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-dist.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:39:49,733 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:49,734 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:49,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,813 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:49,813 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:39:49,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,818 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:49,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:39:49,820 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:49,820 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:49,841 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:39:49,841 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x_1=0, c=0} Honda state: {x_1=0, c=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:39:49,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:49,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:49,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:39:49,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:49,876 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:49,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:39:49,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:49,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:39:49,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:39:49,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:49,971 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:39:49,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:39:49,976 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:49,976 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:49,976 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:49,976 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:49,976 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:49,977 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,977 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:49,977 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:49,977 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-dist.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:39:49,977 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:49,977 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:49,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,015 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:50,018 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:50,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,021 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:50,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:39:50,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:50,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:50,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:50,041 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:50,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:50,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,049 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:50,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:39:50,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:50,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:50,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:50,064 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:50,067 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:39:50,067 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:39:50,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:50,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:39:50,073 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:50,076 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 18:39:50,076 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:39:50,076 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:50,077 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(a, i_1) = 1*a - 1*i_1 Supporting invariants [] [2025-04-26 18:39:50,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:39:50,084 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:50,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:50,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:50,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:50,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:50,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:50,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:50,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:50,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:50,126 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:50,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:50,156 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:50,157 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 18:39:50,252 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 257 states and 526 transitions. Complement of second has 7 states. [2025-04-26 18:39:50,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:50,256 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 18:39:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2025-04-26 18:39:50,260 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:39:50,260 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:50,261 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:39:50,261 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:50,261 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:39:50,261 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:50,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 526 transitions. [2025-04-26 18:39:50,268 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:39:50,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 116 states and 238 transitions. [2025-04-26 18:39:50,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-04-26 18:39:50,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2025-04-26 18:39:50,273 INFO L74 IsDeterministic]: Start isDeterministic. Operand 116 states and 238 transitions. [2025-04-26 18:39:50,273 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:50,274 INFO L218 hiAutomatonCegarLoop]: Abstraction has 116 states and 238 transitions. [2025-04-26 18:39:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 238 transitions. [2025-04-26 18:39:50,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2025-04-26 18:39:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 2.0495049504950495) internal successors, (in total 207), 100 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:50,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 207 transitions. [2025-04-26 18:39:50,293 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 207 transitions. [2025-04-26 18:39:50,293 INFO L438 stractBuchiCegarLoop]: Abstraction has 101 states and 207 transitions. [2025-04-26 18:39:50,293 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:50,293 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 207 transitions. [2025-04-26 18:39:50,294 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:39:50,294 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:50,294 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:50,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:39:50,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:50,295 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L56: Formula: (and (= v_x_1_3 0) (= v_x_3_1 v_x_1_3) (= v_i_1_5 v_x_1_3) (<= 0 v_b_3) (= v_i_2_5 v_x_1_3) (= v_i_3_1 v_x_1_3) (= v_x_2_3 v_x_1_3) (<= 0 v_a_3) (<= 0 v_c_3)) InVars {x_1=v_x_1_3, a=v_a_3, x_2=v_x_2_3, x_3=v_x_3_1, i_2=v_i_2_5, i_3=v_i_3_1, i_1=v_i_1_5, c=v_c_3, b=v_b_3} OutVars{x_1=v_x_1_3, a=v_a_3, x_2=v_x_2_3, x_3=v_x_3_1, i_2=v_i_2_5, i_3=v_i_3_1, i_1=v_i_1_5, c=v_c_3, b=v_b_3} AuxVars[] AssignedVars[]" "[75] L56-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L23-1-->thread1FINAL: Formula: (<= v_a_2 v_i_1_4) InVars {a=v_a_2, i_1=v_i_1_4} OutVars{a=v_a_2, i_1=v_i_1_4} AuxVars[] AssignedVars[]" "[63] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[78] L56-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:39:50,295 INFO L754 eck$LassoCheckResult]: Loop: "[66] L34-1-->L34: Formula: (< v_i_2_1 v_b_1) InVars {i_2=v_i_2_1, b=v_b_1} OutVars{i_2=v_i_2_1, b=v_b_1} AuxVars[] AssignedVars[]" "[68] L34-->L34-1: Formula: (and (= v_i_2_6 (+ v_i_2_7 1)) (= v_x_2_5 (+ v_c_7 v_x_2_6))) InVars {i_2=v_i_2_7, x_2=v_x_2_6, c=v_c_7} OutVars{i_2=v_i_2_6, x_2=v_x_2_5, c=v_c_7} AuxVars[] AssignedVars[x_2, i_2]" [2025-04-26 18:39:50,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,295 INFO L85 PathProgramCache]: Analyzing trace with hash 80794262, now seen corresponding path program 1 times [2025-04-26 18:39:50,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:50,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543100726] [2025-04-26 18:39:50,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:50,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:50,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:50,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:50,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,300 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:50,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:50,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:50,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:50,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,304 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2025-04-26 18:39:50,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:50,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606583930] [2025-04-26 18:39:50,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:50,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:50,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:50,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:50,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:50,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:50,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:50,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:50,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,310 INFO L85 PathProgramCache]: Analyzing trace with hash 333876568, now seen corresponding path program 1 times [2025-04-26 18:39:50,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:50,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434283575] [2025-04-26 18:39:50,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:50,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:50,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:50,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:50,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,315 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:50,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:50,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:50,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:50,338 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:50,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:50,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:50,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:50,338 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:39:50,339 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,339 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:50,339 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:50,339 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-dist.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:39:50,339 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:50,339 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:50,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,365 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:50,366 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:39:50,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:50,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:39:50,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:50,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:50,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:50,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,389 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:50,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:39:50,393 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:39:50,393 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:50,460 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:39:50,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:39:50,464 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:50,465 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:50,465 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:50,465 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:50,465 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:50,465 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,465 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:50,465 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:50,465 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-dist.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:39:50,465 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:50,465 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:50,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,494 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:50,494 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:50,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,497 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:50,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:39:50,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:50,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:50,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:50,513 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:50,516 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:39:50,516 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:39:50,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,518 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:50,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:39:50,521 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:50,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:50,524 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:39:50,524 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:50,525 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(b, i_2) = 1*b - 1*i_2 Supporting invariants [] [2025-04-26 18:39:50,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:50,531 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:50,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:50,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:50,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:50,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:50,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:50,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:50,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:50,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:50,570 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:50,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:50,583 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:50,583 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 207 transitions. cyclomatic complexity: 133 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:50,641 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 207 transitions. cyclomatic complexity: 133. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 257 states and 529 transitions. Complement of second has 6 states. [2025-04-26 18:39:50,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 18:39:50,642 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:39:50,642 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:50,642 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:39:50,642 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:50,642 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:39:50,643 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:50,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 529 transitions. [2025-04-26 18:39:50,645 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:39:50,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 120 states and 241 transitions. [2025-04-26 18:39:50,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2025-04-26 18:39:50,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2025-04-26 18:39:50,647 INFO L74 IsDeterministic]: Start isDeterministic. Operand 120 states and 241 transitions. [2025-04-26 18:39:50,647 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:50,647 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120 states and 241 transitions. [2025-04-26 18:39:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 241 transitions. [2025-04-26 18:39:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 107. [2025-04-26 18:39:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 2.046728971962617) internal successors, (in total 219), 106 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 219 transitions. [2025-04-26 18:39:50,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 219 transitions. [2025-04-26 18:39:50,651 INFO L438 stractBuchiCegarLoop]: Abstraction has 107 states and 219 transitions. [2025-04-26 18:39:50,651 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:50,651 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 219 transitions. [2025-04-26 18:39:50,652 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:39:50,652 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:50,652 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:50,652 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:50,652 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:50,653 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L56: Formula: (and (= v_x_1_3 0) (= v_x_3_1 v_x_1_3) (= v_i_1_5 v_x_1_3) (<= 0 v_b_3) (= v_i_2_5 v_x_1_3) (= v_i_3_1 v_x_1_3) (= v_x_2_3 v_x_1_3) (<= 0 v_a_3) (<= 0 v_c_3)) InVars {x_1=v_x_1_3, a=v_a_3, x_2=v_x_2_3, x_3=v_x_3_1, i_2=v_i_2_5, i_3=v_i_3_1, i_1=v_i_1_5, c=v_c_3, b=v_b_3} OutVars{x_1=v_x_1_3, a=v_a_3, x_2=v_x_2_3, x_3=v_x_3_1, i_2=v_i_2_5, i_3=v_i_3_1, i_1=v_i_1_5, c=v_c_3, b=v_b_3} AuxVars[] AssignedVars[]" "[75] L56-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L23-1-->thread1FINAL: Formula: (<= v_a_2 v_i_1_4) InVars {a=v_a_2, i_1=v_i_1_4} OutVars{a=v_a_2, i_1=v_i_1_4} AuxVars[] AssignedVars[]" "[63] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[78] L56-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[65] L34-1-->thread2FINAL: Formula: (<= v_b_2 v_i_2_4) InVars {i_2=v_i_2_4, b=v_b_2} OutVars{i_2=v_i_2_4, b=v_b_2} AuxVars[] AssignedVars[]" "[67] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[81] L57-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:39:50,653 INFO L754 eck$LassoCheckResult]: Loop: "[70] L45-1-->L45: Formula: (< v_i_3_3 (+ v_a_5 v_b_5)) InVars {a=v_a_5, i_3=v_i_3_3, b=v_b_5} OutVars{a=v_a_5, i_3=v_i_3_3, b=v_b_5} AuxVars[] AssignedVars[]" "[72] L45-->L45-1: Formula: (and (= (+ v_i_3_7 1) v_i_3_6) (= (+ v_c_9 v_x_3_6) v_x_3_5)) InVars {i_3=v_i_3_7, x_3=v_x_3_6, c=v_c_9} OutVars{i_3=v_i_3_6, x_3=v_x_3_5, c=v_c_9} AuxVars[] AssignedVars[x_3, i_3]" [2025-04-26 18:39:50,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1760238105, now seen corresponding path program 1 times [2025-04-26 18:39:50,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:50,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119633506] [2025-04-26 18:39:50,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:50,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:50,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:50,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:50,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:50,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:50,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:50,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2025-04-26 18:39:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:50,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357153015] [2025-04-26 18:39:50,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:50,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:50,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:50,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:50,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:50,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:50,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:50,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:50,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,669 INFO L85 PathProgramCache]: Analyzing trace with hash -628293477, now seen corresponding path program 1 times [2025-04-26 18:39:50,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:50,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128122461] [2025-04-26 18:39:50,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:50,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:50,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:50,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:50,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:50,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:50,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128122461] [2025-04-26 18:39:50,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128122461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:50,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:50,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:39:50,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594672929] [2025-04-26 18:39:50,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:50,795 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:50,795 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:50,795 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:50,795 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:50,796 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:39:50,796 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,796 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:50,796 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:50,796 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-dist.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:39:50,796 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:50,796 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:50,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,822 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:50,823 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:39:50,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,825 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:50,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:39:50,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:50,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:50,841 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:39:50,841 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x_3=0, c=0} Honda state: {x_3=0, c=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:39:50,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:39:50,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,849 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:50,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:39:50,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:50,852 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:50,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:50,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,870 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:50,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:39:50,872 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:39:50,872 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:50,955 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:39:50,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:50,960 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:50,960 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:50,960 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:50,960 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:50,960 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:50,960 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,960 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:50,960 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:50,961 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-dist.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:39:50,961 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:50,961 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:50,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,996 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:50,996 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:50,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,998 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:51,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:39:51,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:51,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:51,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:51,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:51,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:51,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:51,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:51,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:51,013 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:51,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:39:51,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:51,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:51,022 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:51,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:39:51,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:51,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:51,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:51,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:51,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:51,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:51,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:51,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:51,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:51,040 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:39:51,040 INFO L437 ModelExtractionUtils]: 0 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:39:51,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:51,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:51,042 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:51,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:39:51,044 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:51,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:51,047 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:39:51,047 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:51,047 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(a, b, i_3) = 1*a + 1*b - 1*i_3 Supporting invariants [] [2025-04-26 18:39:51,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:39:51,053 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:51,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:51,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:51,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:51,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:51,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:51,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:51,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:51,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:51,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:51,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:51,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:51,086 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:51,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:51,098 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:51,099 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 219 transitions. cyclomatic complexity: 133 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:51,145 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 219 transitions. cyclomatic complexity: 133. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 242 states and 494 transitions. Complement of second has 6 states. [2025-04-26 18:39:51,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 18:39:51,146 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:39:51,146 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:51,146 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:39:51,146 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:51,146 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:39:51,146 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:51,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 494 transitions. [2025-04-26 18:39:51,148 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:51,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 0 states and 0 transitions. [2025-04-26 18:39:51,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:51,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:51,149 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:51,149 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:51,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:51,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:51,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:51,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:39:51,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:39:51,150 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:51,152 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:39:51,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:39:51,152 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:51,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:39:51,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:51,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:51,152 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:51,152 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:51,152 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:51,152 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:51,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:39:51,152 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:51,153 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:51,153 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:51,153 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:51,153 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:51,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:39:51,163 INFO L201 PluginConnector]: Adding new model mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:51 BoogieIcfgContainer [2025-04-26 18:39:51,163 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:51,164 INFO L158 Benchmark]: Toolchain (without parser) took 2184.23ms. Allocated memory was 163.6MB in the beginning and 155.2MB in the end (delta: -8.4MB). Free memory was 89.2MB in the beginning and 32.3MB in the end (delta: 57.0MB). Peak memory consumption was 52.8MB. Max. memory is 8.0GB. [2025-04-26 18:39:51,164 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.86ms. Allocated memory is still 163.6MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:51,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.63ms. Allocated memory is still 163.6MB. Free memory was 89.2MB in the beginning and 87.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:51,164 INFO L158 Benchmark]: Boogie Preprocessor took 22.75ms. Allocated memory is still 163.6MB. Free memory was 87.4MB in the beginning and 86.5MB in the end (delta: 894.5kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:51,164 INFO L158 Benchmark]: RCFGBuilder took 197.92ms. Allocated memory is still 163.6MB. Free memory was 86.5MB in the beginning and 76.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:51,165 INFO L158 Benchmark]: BuchiAutomizer took 1921.32ms. Allocated memory was 163.6MB in the beginning and 155.2MB in the end (delta: -8.4MB). Free memory was 76.7MB in the beginning and 32.3MB in the end (delta: 44.4MB). Peak memory consumption was 40.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:51,166 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.86ms. Allocated memory is still 163.6MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.63ms. Allocated memory is still 163.6MB. Free memory was 89.2MB in the beginning and 87.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.75ms. Allocated memory is still 163.6MB. Free memory was 87.4MB in the beginning and 86.5MB in the end (delta: 894.5kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 197.92ms. Allocated memory is still 163.6MB. Free memory was 86.5MB in the beginning and 76.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1921.32ms. Allocated memory was 163.6MB in the beginning and 155.2MB in the end (delta: -8.4MB). Free memory was 76.7MB in the beginning and 32.3MB in the end (delta: 44.4MB). Peak memory consumption was 40.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 28 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, 92 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 36 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp71 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 153, 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 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function a + -1 * i_1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i_2 + b and consists of 4 locations. One deterministic module has affine ranking function -1 * i_3 + b + a and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:39:51,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...