/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/parallel/misc-1.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:38,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:38,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:38,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:38,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:38,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:38,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:38,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:38,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:38,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:38,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:38,611 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:38,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:38,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:38,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:38,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:38,612 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:38,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:38,612 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:38,612 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:38,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:38,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:38,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:38,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:38,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:38,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:38,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:38,612 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:38,613 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:38,613 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:38,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:38,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:38,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:38,818 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:38,819 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:38,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-1.wvr.bpl [2025-04-26 18:40:38,820 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-1.wvr.bpl' [2025-04-26 18:40:38,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:38,838 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:38,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:38,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:38,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:38,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:38" (1/1) ... [2025-04-26 18:40:38,863 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:38" (1/1) ... [2025-04-26 18:40:38,867 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:38,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:38,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:38,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:38,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:38,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:38" (1/1) ... [2025-04-26 18:40:38,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:38" (1/1) ... [2025-04-26 18:40:38,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:38" (1/1) ... [2025-04-26 18:40:38,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:38" (1/1) ... [2025-04-26 18:40:38,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:38" (1/1) ... [2025-04-26 18:40:38,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:38" (1/1) ... [2025-04-26 18:40:38,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:38" (1/1) ... [2025-04-26 18:40:38,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:38" (1/1) ... [2025-04-26 18:40:38,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:38" (1/1) ... [2025-04-26 18:40:38,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:38,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:38,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:38,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:38,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:38" (1/1) ... [2025-04-26 18:40:38,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:38,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:38,920 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:40:38,923 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:40:38,942 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:38,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:38,942 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:38,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:38,942 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:38,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:38,943 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:40:38,978 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:38,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:39,064 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:39,064 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:39,072 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:39,072 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:40:39,072 INFO L201 PluginConnector]: Adding new model misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:39 BoogieIcfgContainer [2025-04-26 18:40:39,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:39,073 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:39,073 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:39,078 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:39,078 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:39,078 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:38" (1/2) ... [2025-04-26 18:40:39,079 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@411a8705 and model type misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:39, skipping insertion in model container [2025-04-26 18:40:39,079 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:39,079 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:39" (2/2) ... [2025-04-26 18:40:39,080 INFO L376 chiAutomizerObserver]: Analyzing ICFG misc-1.wvr.bpl [2025-04-26 18:40:39,119 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:40:39,160 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:39,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:39,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:39,164 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:40:39,165 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:40:39,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 80 flow [2025-04-26 18:40:39,227 INFO L116 PetriNetUnfolderBase]: 4/29 cut-off events. [2025-04-26 18:40:39,229 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:40:39,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 4/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 66 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-26 18:40:39,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 80 flow [2025-04-26 18:40:39,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 29 transitions, 70 flow [2025-04-26 18:40:39,235 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 29 transitions, 70 flow [2025-04-26 18:40:39,235 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 29 transitions, 70 flow [2025-04-26 18:40:39,251 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 106 states, 104 states have (on average 2.1634615384615383) internal successors, (in total 225), 105 states have internal predecessors, (225), 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:40:39,252 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 106 states, 104 states have (on average 2.1634615384615383) internal successors, (in total 225), 105 states have internal predecessors, (225), 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:40:39,253 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:39,299 WARN L140 AmpleReduction]: Number of pruned transitions: 79 [2025-04-26 18:40:39,299 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:40:39,299 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 12 [2025-04-26 18:40:39,299 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:25 [2025-04-26 18:40:39,300 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:68 [2025-04-26 18:40:39,300 WARN L145 AmpleReduction]: Times succ was already a loop node:4 [2025-04-26 18:40:39,300 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:19 [2025-04-26 18:40:39,300 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:39,300 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 106 states, 104 states have (on average 1.4038461538461537) internal successors, (in total 146), 105 states have internal predecessors, (146), 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:40:39,305 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:39,306 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:39,306 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:39,306 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:39,306 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:39,306 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:39,306 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:39,306 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:39,307 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 106 states, 104 states have (on average 1.4038461538461537) internal successors, (in total 146), 105 states have internal predecessors, (146), 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:40:39,317 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 78 [2025-04-26 18:40:39,317 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:39,317 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:39,320 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:39,320 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:40:39,320 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:39,320 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 106 states, 104 states have (on average 1.4038461538461537) internal successors, (in total 146), 105 states have internal predecessors, (146), 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:40:39,323 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 78 [2025-04-26 18:40:39,323 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:39,323 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:39,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:39,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:40:39,327 INFO L752 eck$LassoCheckResult]: Stem: "[67] $Ultimate##0-->L60: Formula: (and (= v_bag1_8 v_sum1_5) (= v_bag1_8 v_sum2_5) (= v_bag1_8 0) (= v_j_9 v_bag1_8) (= v_i_9 v_bag1_8) (= v_bag2_8 v_bag1_8)) InVars {sum1=v_sum1_5, i=v_i_9, sum2=v_sum2_5, bag1=v_bag1_8, bag2=v_bag2_8, j=v_j_9} OutVars{sum1=v_sum1_5, i=v_i_9, sum2=v_sum2_5, bag1=v_bag1_8, bag2=v_bag2_8, j=v_j_9} AuxVars[] AssignedVars[]" "[94] L60-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:39,327 INFO L754 eck$LassoCheckResult]: Loop: "[73] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[75] L24-->L25: Formula: (< (+ v_bag1_1 (select v_A_1 v_i_2)) v_cap1_1) InVars {A=v_A_1, i=v_i_2, cap1=v_cap1_1, bag1=v_bag1_1} OutVars{A=v_A_1, i=v_i_2, cap1=v_cap1_1, bag1=v_bag1_1} AuxVars[] AssignedVars[]" "[78] L25-->L24-2: Formula: (= (+ (select v_A_2 v_i_3) v_bag1_3) v_bag1_2) InVars {A=v_A_2, i=v_i_3, bag1=v_bag1_3} OutVars{A=v_A_2, i=v_i_3, bag1=v_bag1_2} AuxVars[] AssignedVars[bag1]" "[80] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" [2025-04-26 18:40:39,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:39,330 INFO L85 PathProgramCache]: Analyzing trace with hash 3132, now seen corresponding path program 1 times [2025-04-26 18:40:39,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:39,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095039806] [2025-04-26 18:40:39,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:39,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:39,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:39,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:39,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:39,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:39,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:39,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:39,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:39,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:39,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:39,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:39,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash 3172837, now seen corresponding path program 1 times [2025-04-26 18:40:39,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:39,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462322177] [2025-04-26 18:40:39,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:39,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:39,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:39,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:39,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:39,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:39,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:39,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:39,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:39,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:39,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:39,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:39,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:39,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1400250208, now seen corresponding path program 1 times [2025-04-26 18:40:39,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:39,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805541330] [2025-04-26 18:40:39,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:39,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:39,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:39,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:39,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:39,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:39,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:39,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:39,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:39,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:39,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:39,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:39,595 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:39,595 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:39,595 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:39,595 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:39,596 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:39,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:39,596 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:39,596 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:39,596 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-1.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:39,596 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:39,596 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:39,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:39,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:39,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:39,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:39,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:39,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:39,807 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:39,809 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:39,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:39,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:39,814 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:40:39,816 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:40:39,818 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:40:39,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:39,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:39,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:39,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:39,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:39,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:39,874 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:39,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:40:39,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:39,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:39,892 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:40:39,894 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:40:39,894 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:40:39,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:39,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:39,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:39,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:39,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:39,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:39,914 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:39,923 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:40:39,923 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:40:39,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:39,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:39,927 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:40:39,928 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:40:39,930 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:39,947 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:40:39,948 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:39,948 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:39,949 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 18:40:39,954 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:40:39,957 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:39,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:39,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:39,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:39,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:39,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:39,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:39,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:40,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:40,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:40,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:40,004 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:40,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:40,038 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:40:40,053 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:40:40,055 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 106 states, 104 states have (on average 1.4038461538461537) internal successors, (in total 146), 105 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:40,124 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 106 states, 104 states have (on average 1.4038461538461537) internal successors, (in total 146), 105 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 214 states and 309 transitions. Complement of second has 7 states. [2025-04-26 18:40:40,125 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:40:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2025-04-26 18:40:40,131 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:40:40,131 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:40,131 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:40:40,131 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:40,131 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 18:40:40,131 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:40,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 309 transitions. [2025-04-26 18:40:40,136 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2025-04-26 18:40:40,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 78 states and 109 transitions. [2025-04-26 18:40:40,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-04-26 18:40:40,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-04-26 18:40:40,142 INFO L74 IsDeterministic]: Start isDeterministic. Operand 78 states and 109 transitions. [2025-04-26 18:40:40,142 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:40,142 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 109 transitions. [2025-04-26 18:40:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 109 transitions. [2025-04-26 18:40:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2025-04-26 18:40:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.4078947368421053) internal successors, (in total 107), 75 states have internal predecessors, (107), 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:40:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 107 transitions. [2025-04-26 18:40:40,165 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 107 transitions. [2025-04-26 18:40:40,165 INFO L438 stractBuchiCegarLoop]: Abstraction has 76 states and 107 transitions. [2025-04-26 18:40:40,165 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:40,165 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 107 transitions. [2025-04-26 18:40:40,166 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2025-04-26 18:40:40,166 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:40,166 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:40,166 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:40:40,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:40:40,166 INFO L752 eck$LassoCheckResult]: Stem: "[67] $Ultimate##0-->L60: Formula: (and (= v_bag1_8 v_sum1_5) (= v_bag1_8 v_sum2_5) (= v_bag1_8 0) (= v_j_9 v_bag1_8) (= v_i_9 v_bag1_8) (= v_bag2_8 v_bag1_8)) InVars {sum1=v_sum1_5, i=v_i_9, sum2=v_sum2_5, bag1=v_bag1_8, bag2=v_bag2_8, j=v_j_9} OutVars{sum1=v_sum1_5, i=v_i_9, sum2=v_sum2_5, bag1=v_bag1_8, bag2=v_bag2_8, j=v_j_9} AuxVars[] AssignedVars[]" "[94] L60-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[72] L23-->L35: Formula: (<= v_N_2 v_i_8) InVars {i=v_i_8, N=v_N_2} OutVars{i=v_i_8, N=v_N_2} AuxVars[] AssignedVars[]" "[74] L35-->thread1FINAL: Formula: (= (+ v_bag1_7 v_sum1_4) v_sum1_3) InVars {sum1=v_sum1_4, bag1=v_bag1_7} OutVars{sum1=v_sum1_3, bag1=v_bag1_7} AuxVars[] AssignedVars[sum1]" "[77] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[97] L60-1-->L41: 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:40:40,166 INFO L754 eck$LassoCheckResult]: Loop: "[83] L41-->L42: Formula: (< v_j_1 v_N_3) InVars {N=v_N_3, j=v_j_1} OutVars{N=v_N_3, j=v_j_1} AuxVars[] AssignedVars[]" "[85] L42-->L43: Formula: (< (+ (select v_A_5 v_j_2) v_bag2_2) v_cap2_1) InVars {A=v_A_5, cap2=v_cap2_1, bag2=v_bag2_2, j=v_j_2} OutVars{A=v_A_5, cap2=v_cap2_1, bag2=v_bag2_2, j=v_j_2} AuxVars[] AssignedVars[]" "[88] L43-->L42-2: Formula: (= (+ (select v_A_6 v_j_3) v_bag2_4) v_bag2_3) InVars {A=v_A_6, bag2=v_bag2_4, j=v_j_3} OutVars{A=v_A_6, bag2=v_bag2_3, j=v_j_3} AuxVars[] AssignedVars[bag2]" "[90] L42-2-->L41: Formula: (= v_j_6 (+ v_j_7 1)) InVars {j=v_j_7} OutVars{j=v_j_6} AuxVars[] AssignedVars[j]" [2025-04-26 18:40:40,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1400280974, now seen corresponding path program 1 times [2025-04-26 18:40:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016879567] [2025-04-26 18:40:40,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:40,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:40,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,178 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:40,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:40,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,183 INFO L85 PathProgramCache]: Analyzing trace with hash 3480677, now seen corresponding path program 1 times [2025-04-26 18:40:40,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393460229] [2025-04-26 18:40:40,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:40,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:40,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:40,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:40,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash 189526, now seen corresponding path program 1 times [2025-04-26 18:40:40,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119159492] [2025-04-26 18:40:40,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:40,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:40,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:40,263 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:40:40,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:40,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119159492] [2025-04-26 18:40:40,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119159492] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:40,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:40,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:40:40,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861362770] [2025-04-26 18:40:40,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:40,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:40,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:40:40,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:40:40,299 INFO L87 Difference]: Start difference. First operand 76 states and 107 transitions. cyclomatic complexity: 36 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:40:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:40,358 INFO L93 Difference]: Finished difference Result 84 states and 115 transitions. [2025-04-26 18:40:40,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 115 transitions. [2025-04-26 18:40:40,359 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2025-04-26 18:40:40,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 80 states and 111 transitions. [2025-04-26 18:40:40,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-04-26 18:40:40,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-04-26 18:40:40,362 INFO L74 IsDeterministic]: Start isDeterministic. Operand 80 states and 111 transitions. [2025-04-26 18:40:40,362 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:40,362 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 111 transitions. [2025-04-26 18:40:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 111 transitions. [2025-04-26 18:40:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2025-04-26 18:40:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.394736842105263) internal successors, (in total 106), 75 states have internal predecessors, (106), 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:40:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2025-04-26 18:40:40,365 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 106 transitions. [2025-04-26 18:40:40,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:40:40,366 INFO L438 stractBuchiCegarLoop]: Abstraction has 76 states and 106 transitions. [2025-04-26 18:40:40,367 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:40,367 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 106 transitions. [2025-04-26 18:40:40,367 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2025-04-26 18:40:40,367 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:40,367 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:40,368 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:40,368 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:40:40,368 INFO L752 eck$LassoCheckResult]: Stem: "[67] $Ultimate##0-->L60: Formula: (and (= v_bag1_8 v_sum1_5) (= v_bag1_8 v_sum2_5) (= v_bag1_8 0) (= v_j_9 v_bag1_8) (= v_i_9 v_bag1_8) (= v_bag2_8 v_bag1_8)) InVars {sum1=v_sum1_5, i=v_i_9, sum2=v_sum2_5, bag1=v_bag1_8, bag2=v_bag2_8, j=v_j_9} OutVars{sum1=v_sum1_5, i=v_i_9, sum2=v_sum2_5, bag1=v_bag1_8, bag2=v_bag2_8, j=v_j_9} AuxVars[] AssignedVars[]" "[94] L60-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[75] L24-->L25: Formula: (< (+ v_bag1_1 (select v_A_1 v_i_2)) v_cap1_1) InVars {A=v_A_1, i=v_i_2, cap1=v_cap1_1, bag1=v_bag1_1} OutVars{A=v_A_1, i=v_i_2, cap1=v_cap1_1, bag1=v_bag1_1} AuxVars[] AssignedVars[]" "[78] L25-->L24-2: Formula: (= (+ (select v_A_2 v_i_3) v_bag1_3) v_bag1_2) InVars {A=v_A_2, i=v_i_3, bag1=v_bag1_3} OutVars{A=v_A_2, i=v_i_3, bag1=v_bag1_2} AuxVars[] AssignedVars[bag1]" "[97] L60-1-->L41: 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]" "[80] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" "[72] L23-->L35: Formula: (<= v_N_2 v_i_8) InVars {i=v_i_8, N=v_N_2} OutVars{i=v_i_8, N=v_N_2} AuxVars[] AssignedVars[]" "[74] L35-->thread1FINAL: Formula: (= (+ v_bag1_7 v_sum1_4) v_sum1_3) InVars {sum1=v_sum1_4, bag1=v_bag1_7} OutVars{sum1=v_sum1_3, bag1=v_bag1_7} AuxVars[] AssignedVars[sum1]" [2025-04-26 18:40:40,368 INFO L754 eck$LassoCheckResult]: Loop: "[83] L41-->L42: Formula: (< v_j_1 v_N_3) InVars {N=v_N_3, j=v_j_1} OutVars{N=v_N_3, j=v_j_1} AuxVars[] AssignedVars[]" "[85] L42-->L43: Formula: (< (+ (select v_A_5 v_j_2) v_bag2_2) v_cap2_1) InVars {A=v_A_5, cap2=v_cap2_1, bag2=v_bag2_2, j=v_j_2} OutVars{A=v_A_5, cap2=v_cap2_1, bag2=v_bag2_2, j=v_j_2} AuxVars[] AssignedVars[]" "[88] L43-->L42-2: Formula: (= (+ (select v_A_6 v_j_3) v_bag2_4) v_bag2_3) InVars {A=v_A_6, bag2=v_bag2_4, j=v_j_3} OutVars{A=v_A_6, bag2=v_bag2_3, j=v_j_3} AuxVars[] AssignedVars[bag2]" "[90] L42-2-->L41: Formula: (= v_j_6 (+ v_j_7 1)) InVars {j=v_j_7} OutVars{j=v_j_6} AuxVars[] AssignedVars[j]" [2025-04-26 18:40:40,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2130982143, now seen corresponding path program 1 times [2025-04-26 18:40:40,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411891376] [2025-04-26 18:40:40,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:40,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:40,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,383 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:40,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:40,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash 3480677, now seen corresponding path program 2 times [2025-04-26 18:40:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131687749] [2025-04-26 18:40:40,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:40,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:40,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:40,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:40,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,400 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:40,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:40,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1202493595, now seen corresponding path program 1 times [2025-04-26 18:40:40,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542308057] [2025-04-26 18:40:40,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:40,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:40,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,416 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:40,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:40,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,564 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:40,564 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:40,564 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:40,564 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:40,564 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:40,564 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:40,564 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:40,564 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:40,564 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-1.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:40,564 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:40,565 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:40,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:40,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:40,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:40,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:40,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:40,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:40,716 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:40,716 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:40,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:40,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:40,719 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:40:40,720 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:40:40,721 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:40:40,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:40,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:40,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:40,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:40,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:40,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:40,736 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:40,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:40:40,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:40,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:40,744 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:40:40,753 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:40:40,754 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:40:40,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:40,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:40,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:40,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:40,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:40,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:40,769 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:40,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:40,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:40,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:40,777 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:40:40,779 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:40:40,780 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:40:40,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:40,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:40,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:40,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:40,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:40,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:40,797 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:40,807 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:40:40,807 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:40:40,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:40,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:40,810 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:40:40,810 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:40:40,812 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:40,829 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:40:40,829 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:40,829 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:40,829 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, N) = -1*j + 1*N Supporting invariants [] [2025-04-26 18:40:40,835 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:40:40,836 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:40,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:40,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:40,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:40,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:40,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:40,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:40,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:40,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:40,887 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:40,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:40,910 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:40:40,910 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:40:40,910 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 106 transitions. cyclomatic complexity: 35 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:40,950 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 106 transitions. cyclomatic complexity: 35. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 123 states and 178 transitions. Complement of second has 6 states. [2025-04-26 18:40:40,950 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:40:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 18:40:40,951 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:40:40,951 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:40,951 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 18:40:40,951 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:40,951 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 9 letters. Loop has 8 letters. [2025-04-26 18:40:40,951 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:40,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 178 transitions. [2025-04-26 18:40:40,952 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:40,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 0 states and 0 transitions. [2025-04-26 18:40:40,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:40,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:40,952 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:40,952 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:40,952 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:40,953 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:40,953 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:40,953 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:40,953 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:40,953 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:40,953 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:40,962 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:40:40,963 INFO L201 PluginConnector]: Adding new model misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:40 BoogieIcfgContainer [2025-04-26 18:40:40,963 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:40,964 INFO L158 Benchmark]: Toolchain (without parser) took 2125.96ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 82.5MB in the beginning and 77.5MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:40,964 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:40,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.53ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 80.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:40,964 INFO L158 Benchmark]: Boogie Preprocessor took 19.18ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 79.7MB in the end (delta: 962.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:40,965 INFO L158 Benchmark]: RCFGBuilder took 183.89ms. Allocated memory is still 155.2MB. Free memory was 79.7MB in the beginning and 70.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:40,965 INFO L158 Benchmark]: BuchiAutomizer took 1890.51ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 70.1MB in the beginning and 77.5MB in the end (delta: -7.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:40,966 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.17ms. Allocated memory is still 155.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.53ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 80.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.18ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 79.7MB in the end (delta: 962.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 183.89ms. Allocated memory is still 155.2MB. Free memory was 79.7MB in the beginning and 70.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1890.51ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 70.1MB in the beginning and 77.5MB in the end (delta: -7.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.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 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 49 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital61 mio100 ax100 hnf100 lsp72 ukn89 mio100 lsp60 div100 bol100 ite100 ukn100 eq175 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 64ms VariablesStem: 1 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 143, Number of transitions in reduction automaton: 146, Number of states in reduction automaton: 106, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function N + -1 * j 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:40:40,976 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...