/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:13:13,740 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:13:13,807 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:13:13,835 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:13:13,835 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:13:13,836 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:13:13,837 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:13:13,837 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:13:13,838 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:13:13,841 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:13:13,841 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:13:13,841 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:13:13,842 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:13:13,843 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:13:13,843 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:13:13,844 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:13:13,844 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:13:13,844 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:13:13,844 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:13:13,844 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:13:13,845 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:13:13,846 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:13:13,846 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:13:13,846 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:13:13,846 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:13:13,847 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:13:13,847 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:13:13,847 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:13:13,847 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:13:13,847 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:13:13,848 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:13:13,849 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:13:13,849 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:13:13,850 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:13:13,850 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2023-10-12 17:13:14,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:13:14,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:13:14,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:13:14,082 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:13:14,083 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:13:14,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-subst.wvr.bpl [2023-10-12 17:13:14,084 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-subst.wvr.bpl' [2023-10-12 17:13:14,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:13:14,115 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:13:14,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:14,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:13:14,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:13:14,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:14" (1/1) ... [2023-10-12 17:13:14,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:14" (1/1) ... [2023-10-12 17:13:14,136 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:13:14,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:14,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:13:14,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:13:14,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:13:14,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:14" (1/1) ... [2023-10-12 17:13:14,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:14" (1/1) ... [2023-10-12 17:13:14,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:14" (1/1) ... [2023-10-12 17:13:14,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:14" (1/1) ... [2023-10-12 17:13:14,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:14" (1/1) ... [2023-10-12 17:13:14,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:14" (1/1) ... [2023-10-12 17:13:14,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:14" (1/1) ... [2023-10-12 17:13:14,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:14" (1/1) ... [2023-10-12 17:13:14,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:13:14,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:13:14,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:13:14,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:13:14,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:14" (1/1) ... [2023-10-12 17:13:14,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:14,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:14,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:14,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:13:14,227 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:13:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:13:14,230 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:13:14,230 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:13:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:13:14,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:13:14,231 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:13:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:13:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:13:14,232 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:13:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:13:14,233 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:13:14,233 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:13:14,283 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:13:14,284 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:13:14,428 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:13:14,508 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:13:14,509 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-10-12 17:13:14,511 INFO L201 PluginConnector]: Adding new model name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:14 BoogieIcfgContainer [2023-10-12 17:13:14,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:13:14,512 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:13:14,512 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:13:14,524 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:13:14,525 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:14,525 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:14" (1/2) ... [2023-10-12 17:13:14,527 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@722b62aa and model type name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:13:14, skipping insertion in model container [2023-10-12 17:13:14,527 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:14,527 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:14" (2/2) ... [2023-10-12 17:13:14,528 INFO L332 chiAutomizerObserver]: Analyzing ICFG name-comparator-subst.wvr.bpl [2023-10-12 17:13:14,610 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:13:14,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 80 flow [2023-10-12 17:13:14,705 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2023-10-12 17:13:14,705 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:13:14,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:13:14,715 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 80 flow [2023-10-12 17:13:14,718 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2023-10-12 17:13:14,721 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:13:14,732 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 22 transitions, 62 flow [2023-10-12 17:13:14,735 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 62 flow [2023-10-12 17:13:14,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 62 flow [2023-10-12 17:13:14,742 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2023-10-12 17:13:14,742 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:13:14,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:13:14,743 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:13:14,918 INFO L134 LiptonReduction]: Checked pairs total: 88 [2023-10-12 17:13:14,919 INFO L136 LiptonReduction]: Total number of compositions: 6 [2023-10-12 17:13:14,934 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:13:14,934 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:13:14,934 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:13:14,934 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:13:14,934 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:13:14,934 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:13:14,934 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:13:14,935 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:13:14,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:13:14,970 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:13:14,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:14,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:14,975 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:14,975 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:14,975 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:13:14,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 54 states, but on-demand construction may add more states [2023-10-12 17:13:14,981 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:13:14,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:14,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:14,982 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:14,982 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:14,986 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]don't care [130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[$Ultimate##0, L107]don't care [116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_50)) (.cse1 (= v_name_1_29 v_name_2_31))) (and .cse0 (or (and v_break_7_36 (or .cse1 v_break_7_50)) (and .cse0 (not .cse1) (not v_break_7_36))) (= v_i_5_27 0) (= v_result_4_34 (ite .cse1 0 v_result_4_35)))) InVars {name_2=v_name_2_31, result_4=v_result_4_35, name_1=v_name_1_29} OutVars{name_2=v_name_2_31, i_5=v_i_5_27, result_4=v_result_4_34, break_7=v_break_7_36, name_1=v_name_1_29} AuxVars[v_break_7_50] AssignedVars[i_5, result_4, break_7] 40#[L107, L36]don't care [2023-10-12 17:13:14,987 INFO L750 eck$LassoCheckResult]: Loop: 40#[L107, L36]don't care [118] L36-->L36: Formula: (let ((.cse4 (= v_name_2_39 v_current_6_16)) (.cse3 (not v_break_7_52))) (let ((.cse0 (and .cse4 .cse3)) (.cse2 (not v_break_7_41)) (.cse1 (= v_name_1_31 v_current_6_16))) (and (< v_i_5_30 3) (= (select v_nondet_0_18 v_i_5_30) v_current_6_16) (= v_result_4_38 (ite .cse0 (- 1) (ite .cse1 1 v_result_4_40))) .cse2 (or (and .cse3 (not v_break_7_40) (or v_break_7_52 (not .cse4))) (and (or .cse0 v_break_7_52) v_break_7_40)) (= (+ v_i_5_30 1) v_i_5_29) (or (and (or .cse1 v_break_7_41) v_break_7_52) (and .cse3 .cse2 (not .cse1)))))) InVars {name_2=v_name_2_39, i_5=v_i_5_30, result_4=v_result_4_40, break_7=v_break_7_41, name_1=v_name_1_31, nondet_0=v_nondet_0_18} OutVars{name_2=v_name_2_39, i_5=v_i_5_29, result_4=v_result_4_38, break_7=v_break_7_40, current_6=v_current_6_16, name_1=v_name_1_31, nondet_0=v_nondet_0_18} AuxVars[v_break_7_52] AssignedVars[i_5, result_4, break_7, current_6] 40#[L107, L36]don't care [2023-10-12 17:13:14,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:14,991 INFO L85 PathProgramCache]: Analyzing trace with hash 5107, now seen corresponding path program 1 times [2023-10-12 17:13:14,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:14,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157774699] [2023-10-12 17:13:14,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:14,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:15,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:15,074 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2023-10-12 17:13:15,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:15,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580641189] [2023-10-12 17:13:15,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:15,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:15,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash 158435, now seen corresponding path program 1 times [2023-10-12 17:13:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855964228] [2023-10-12 17:13:15,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:15,634 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:15,634 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:15,634 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:15,635 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:15,635 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:15,635 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:15,635 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:15,635 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:15,635 INFO L133 ssoRankerPreferences]: Filename of dumped script: name-comparator-subst.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:13:15,635 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:15,635 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:15,650 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:15,806 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:15,900 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:13:16,349 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:16,353 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:16,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:16,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:16,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:16,368 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 [2023-10-12 17:13:16,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:16,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:16,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:16,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:16,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:16,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:16,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:13:16,388 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:16,414 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:13:16,414 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:13:16,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:16,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:16,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:16,440 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:16,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:13:16,460 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:16,461 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:16,461 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_5) = -2*i_5 + 5 Supporting invariants [] [2023-10-12 17:13:16,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:13:16,474 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:16,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:16,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:16,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:16,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:16,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:16,585 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:16,587 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 54 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:16,646 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 54 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 142 states and 488 transitions. Complement of second has 5 states. [2023-10-12 17:13:16,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2023-10-12 17:13:16,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:13:16,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:16,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:13:16,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:16,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:13:16,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:16,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 488 transitions. [2023-10-12 17:13:16,661 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:13:16,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 102 states and 353 transitions. [2023-10-12 17:13:16,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2023-10-12 17:13:16,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2023-10-12 17:13:16,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 353 transitions. [2023-10-12 17:13:16,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:16,670 INFO L219 hiAutomatonCegarLoop]: Abstraction has 102 states and 353 transitions. [2023-10-12 17:13:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 353 transitions. [2023-10-12 17:13:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 81. [2023-10-12 17:13:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 3.617283950617284) internal successors, (293), 80 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 293 transitions. [2023-10-12 17:13:16,698 INFO L241 hiAutomatonCegarLoop]: Abstraction has 81 states and 293 transitions. [2023-10-12 17:13:16,698 INFO L430 stractBuchiCegarLoop]: Abstraction has 81 states and 293 transitions. [2023-10-12 17:13:16,698 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:13:16,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 293 transitions. [2023-10-12 17:13:16,701 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:13:16,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:16,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:16,701 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:13:16,701 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:16,702 INFO L748 eck$LassoCheckResult]: Stem: 472#[$Ultimate##0]don't care [130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 440#[$Ultimate##0, L107]don't care [133] L107-->$Ultimate##0: 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] 376#[$Ultimate##0, $Ultimate##0, L108]don't care [120] $Ultimate##0-->L62: Formula: (let ((.cse0 (= v_name_3_33 v_name_1_33)) (.cse1 (not v_break_11_52))) (and (or (and (or .cse0 v_break_11_52) v_break_11_36) (and (not v_break_11_36) (not .cse0) .cse1)) (= v_result_8_30 (ite .cse0 0 v_result_8_31)) .cse1 (= v_i_9_23 0))) InVars {name_3=v_name_3_33, result_8=v_result_8_31, name_1=v_name_1_33} OutVars{name_3=v_name_3_33, result_8=v_result_8_30, break_11=v_break_11_36, name_1=v_name_1_33, i_9=v_i_9_23} AuxVars[v_break_11_52] AssignedVars[result_8, break_11, i_9] 382#[L62, $Ultimate##0, L108]don't care [2023-10-12 17:13:16,702 INFO L750 eck$LassoCheckResult]: Loop: 382#[L62, $Ultimate##0, L108]don't care [121] L62-->L62: Formula: (let ((.cse3 (not v_break_11_54)) (.cse4 (= v_name_3_35 v_current_10_16))) (let ((.cse1 (and .cse3 .cse4)) (.cse0 (not v_break_11_42)) (.cse2 (= v_name_1_35 v_current_10_16))) (and .cse0 (= v_result_8_34 (ite .cse1 (- 1) (ite .cse2 1 v_result_8_36))) (= v_current_10_16 (select v_nondet_0_20 v_i_9_26)) (or (and (or v_break_11_54 .cse1) v_break_11_40) (and .cse3 (or v_break_11_54 (not .cse4)) (not v_break_11_40))) (< v_i_9_26 3) (= v_i_9_25 (+ v_i_9_26 1)) (or (and (not .cse2) .cse0 .cse3) (and (or v_break_11_42 .cse2) v_break_11_54))))) InVars {name_3=v_name_3_35, result_8=v_result_8_36, break_11=v_break_11_42, name_1=v_name_1_35, nondet_0=v_nondet_0_20, i_9=v_i_9_26} OutVars{name_3=v_name_3_35, result_8=v_result_8_34, break_11=v_break_11_40, current_10=v_current_10_16, name_1=v_name_1_35, nondet_0=v_nondet_0_20, i_9=v_i_9_25} AuxVars[v_break_11_54] AssignedVars[result_8, break_11, current_10, i_9] 382#[L62, $Ultimate##0, L108]don't care [2023-10-12 17:13:16,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:16,703 INFO L85 PathProgramCache]: Analyzing trace with hash 158964, now seen corresponding path program 1 times [2023-10-12 17:13:16,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:16,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907613087] [2023-10-12 17:13:16,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:16,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:16,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:16,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:16,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:16,717 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 1 times [2023-10-12 17:13:16,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:16,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013683794] [2023-10-12 17:13:16,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:16,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:16,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:16,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:16,736 INFO L85 PathProgramCache]: Analyzing trace with hash 4928005, now seen corresponding path program 1 times [2023-10-12 17:13:16,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:16,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743200697] [2023-10-12 17:13:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:16,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:16,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:16,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:17,028 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:17,029 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:17,029 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:17,029 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:17,029 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:17,029 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:17,029 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:17,029 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:17,029 INFO L133 ssoRankerPreferences]: Filename of dumped script: name-comparator-subst.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:13:17,029 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:17,029 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:17,032 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:17,034 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:17,140 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:17,143 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:17,236 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:13:17,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:13:17,556 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:17,556 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:17,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:17,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:17,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:17,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:13:17,570 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 [2023-10-12 17:13:17,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:17,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:17,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:17,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:17,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:17,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:17,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:17,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:17,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:17,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:17,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:17,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:13:17,608 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 [2023-10-12 17:13:17,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:17,615 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2023-10-12 17:13:17,616 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2023-10-12 17:13:17,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:17,741 INFO L401 nArgumentSynthesizer]: We have 154 Motzkin's Theorem applications. [2023-10-12 17:13:17,741 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2023-10-12 17:13:17,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:17,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:17,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:17,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:17,971 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:17,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:13:17,975 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 [2023-10-12 17:13:17,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:17,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:17,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:17,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:17,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:17,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:18,004 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:18,010 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:13:18,011 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:13:18,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:18,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:18,013 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:18,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:13:18,018 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:18,035 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:18,035 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:18,035 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_9) = -2*i_9 + 5 Supporting invariants [] [2023-10-12 17:13:18,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:13:18,045 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:18,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:18,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:18,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:18,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:18,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:18,077 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:18,077 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 293 transitions. cyclomatic complexity: 248 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:18,131 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 293 transitions. cyclomatic complexity: 248. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 223 states and 841 transitions. Complement of second has 4 states. [2023-10-12 17:13:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2023-10-12 17:13:18,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:13:18,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:18,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:13:18,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:18,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:13:18,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:18,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 841 transitions. [2023-10-12 17:13:18,150 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:13:18,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 147 states and 548 transitions. [2023-10-12 17:13:18,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2023-10-12 17:13:18,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2023-10-12 17:13:18,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 548 transitions. [2023-10-12 17:13:18,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:18,158 INFO L219 hiAutomatonCegarLoop]: Abstraction has 147 states and 548 transitions. [2023-10-12 17:13:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 548 transitions. [2023-10-12 17:13:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 115. [2023-10-12 17:13:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 3.8434782608695652) internal successors, (442), 114 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 442 transitions. [2023-10-12 17:13:18,176 INFO L241 hiAutomatonCegarLoop]: Abstraction has 115 states and 442 transitions. [2023-10-12 17:13:18,179 INFO L430 stractBuchiCegarLoop]: Abstraction has 115 states and 442 transitions. [2023-10-12 17:13:18,180 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:13:18,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 442 transitions. [2023-10-12 17:13:18,181 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:13:18,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:18,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:18,181 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:13:18,182 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:18,182 INFO L748 eck$LassoCheckResult]: Stem: 929#[$Ultimate##0]don't care [130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 875#[$Ultimate##0, L107]don't care [133] L107-->$Ultimate##0: 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] 801#[$Ultimate##0, $Ultimate##0, L108]don't care [136] L108-->$Ultimate##0: 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] 805#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L109]don't care [124] $Ultimate##0-->L88: Formula: (let ((.cse0 (not v_break_15_54)) (.cse1 (= v_name_3_31 v_name_2_37))) (and (or (and .cse0 (not .cse1) (not v_break_15_44)) (and v_break_15_44 (or v_break_15_54 .cse1))) .cse0 (= v_i_13_19 0) (= v_result_12_40 (ite .cse1 0 v_result_12_41)))) InVars {name_3=v_name_3_31, result_12=v_result_12_41, name_2=v_name_2_37} OutVars{name_3=v_name_3_31, result_12=v_result_12_40, name_2=v_name_2_37, i_13=v_i_13_19, break_15=v_break_15_44} AuxVars[v_break_15_54] AssignedVars[result_12, i_13, break_15] 903#[L88, $Ultimate##0, $Ultimate##0, L109]don't care [2023-10-12 17:13:18,182 INFO L750 eck$LassoCheckResult]: Loop: 903#[L88, $Ultimate##0, $Ultimate##0, L109]don't care [125] L88-->L88: Formula: (let ((.cse3 (= v_name_3_29 v_current_14_16)) (.cse2 (not v_break_15_56))) (let ((.cse1 (not v_break_15_40)) (.cse4 (and .cse3 .cse2)) (.cse0 (= v_name_2_35 v_current_14_16))) (and (< v_i_13_16 3) (or (and (or .cse0 v_break_15_40) v_break_15_56) (and (not .cse0) .cse1 .cse2)) (= v_current_14_16 (select v_nondet_0_16 v_i_13_16)) (or (and (or v_break_15_56 (not .cse3)) (not v_break_15_38) .cse2) (and (or v_break_15_56 .cse4) v_break_15_38)) .cse1 (= (+ v_i_13_16 1) v_i_13_15) (= v_result_12_36 (ite .cse4 (- 1) (ite .cse0 1 v_result_12_37)))))) InVars {name_3=v_name_3_29, result_12=v_result_12_37, name_2=v_name_2_35, i_13=v_i_13_16, nondet_0=v_nondet_0_16, break_15=v_break_15_40} OutVars{name_3=v_name_3_29, result_12=v_result_12_36, name_2=v_name_2_35, current_14=v_current_14_16, i_13=v_i_13_15, nondet_0=v_nondet_0_16, break_15=v_break_15_38} AuxVars[v_break_15_56] AssignedVars[result_12, current_14, i_13, break_15] 903#[L88, $Ultimate##0, $Ultimate##0, L109]don't care [2023-10-12 17:13:18,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash 4928504, now seen corresponding path program 1 times [2023-10-12 17:13:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:18,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421733018] [2023-10-12 17:13:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:18,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:18,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:18,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:18,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash 156, now seen corresponding path program 1 times [2023-10-12 17:13:18,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:18,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887095653] [2023-10-12 17:13:18,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:18,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:18,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:18,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:18,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:18,229 INFO L85 PathProgramCache]: Analyzing trace with hash 152783749, now seen corresponding path program 1 times [2023-10-12 17:13:18,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:18,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558872843] [2023-10-12 17:13:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:18,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:18,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:18,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:18,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:18,549 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:18,549 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:18,549 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:18,549 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:18,549 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:18,550 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:18,550 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:18,550 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:18,550 INFO L133 ssoRankerPreferences]: Filename of dumped script: name-comparator-subst.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:13:18,550 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:18,550 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:18,553 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:18,665 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:18,667 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:18,670 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:18,672 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:18,675 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:18,678 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:18,786 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2023-10-12 17:13:19,152 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:19,152 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:19,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:19,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:19,157 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:19,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:13:19,161 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 [2023-10-12 17:13:19,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:19,167 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2023-10-12 17:13:19,167 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2023-10-12 17:13:19,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:19,255 INFO L401 nArgumentSynthesizer]: We have 154 Motzkin's Theorem applications. [2023-10-12 17:13:19,255 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2023-10-12 17:13:19,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:19,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:19,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:19,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:19,434 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:19,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:13:19,438 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 [2023-10-12 17:13:19,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:19,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:19,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:19,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:19,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:19,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:19,469 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:19,477 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:13:19,478 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:13:19,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:19,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:19,481 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:19,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:13:19,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:19,493 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:19,494 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:19,494 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -2*i_13 + 5 Supporting invariants [] [2023-10-12 17:13:19,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:19,499 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:19,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:19,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:19,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:19,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:19,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:19,541 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:19,541 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 442 transitions. cyclomatic complexity: 367 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:19,571 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 442 transitions. cyclomatic complexity: 367. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 231 states and 839 transitions. Complement of second has 4 states. [2023-10-12 17:13:19,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2023-10-12 17:13:19,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:13:19,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:19,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:13:19,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:19,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:13:19,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:19,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 839 transitions. [2023-10-12 17:13:19,576 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:13:19,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 0 states and 0 transitions. [2023-10-12 17:13:19,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:13:19,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:13:19,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:13:19,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:13:19,576 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:19,577 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:19,577 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:19,577 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:13:19,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:13:19,577 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:13:19,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:13:19,582 INFO L201 PluginConnector]: Adding new model name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:13:19 BoogieIcfgContainer [2023-10-12 17:13:19,583 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:13:19,583 INFO L158 Benchmark]: Toolchain (without parser) took 5468.51ms. Allocated memory was 183.5MB in the beginning and 274.7MB in the end (delta: 91.2MB). Free memory was 134.8MB in the beginning and 107.3MB in the end (delta: 27.5MB). Peak memory consumption was 120.7MB. Max. memory is 8.0GB. [2023-10-12 17:13:19,583 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 183.5MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:13:19,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.40ms. Allocated memory is still 183.5MB. Free memory was 134.6MB in the beginning and 133.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:13:19,584 INFO L158 Benchmark]: Boogie Preprocessor took 17.20ms. Allocated memory is still 183.5MB. Free memory was 133.2MB in the beginning and 132.0MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:13:19,585 INFO L158 Benchmark]: RCFGBuilder took 354.52ms. Allocated memory is still 183.5MB. Free memory was 132.0MB in the beginning and 114.3MB in the end (delta: 17.7MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-10-12 17:13:19,585 INFO L158 Benchmark]: BuchiAutomizer took 5070.82ms. Allocated memory was 183.5MB in the beginning and 274.7MB in the end (delta: 91.2MB). Free memory was 114.1MB in the beginning and 107.3MB in the end (delta: 6.8MB). Peak memory consumption was 99.8MB. Max. memory is 8.0GB. [2023-10-12 17:13:19,587 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.23ms. Allocated memory is still 183.5MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.40ms. Allocated memory is still 183.5MB. Free memory was 134.6MB in the beginning and 133.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.20ms. Allocated memory is still 183.5MB. Free memory was 133.2MB in the beginning and 132.0MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 354.52ms. Allocated memory is still 183.5MB. Free memory was 132.0MB in the beginning and 114.3MB in the end (delta: 17.7MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 5070.82ms. Allocated memory was 183.5MB in the beginning and 274.7MB in the end (delta: 91.2MB). Free memory was 114.1MB in the beginning and 107.3MB in the end (delta: 6.8MB). Peak memory consumption was 99.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i_5 + 5 and consists of 4 locations. One deterministic module has affine ranking function -2 * i_9 + 5 and consists of 3 locations. One deterministic module has affine ranking function 5 + -2 * i_13 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.1s. 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, 53 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, 64 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 0 mSDtfsCounter, 98 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf100 lsp219 ukn47 mio100 lsp88 div100 bol110 ite100 ukn100 eq182 hnf99 smp100 dnf637 smp21 tf100 neg100 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 358ms VariablesStem: 5 VariablesLoop: 8 DisjunctsStem: 3 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 154 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 24 PlacesAfterwards, 22 TransitionsBefore, 17 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 88 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 56, unknown conditional: 0, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:13:19,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:19,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...