/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/nzb-file-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:13:15,916 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:13:15,986 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:16,016 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:13:16,017 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:13:16,017 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:13:16,018 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:13:16,019 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:13:16,019 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:13:16,024 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:13:16,024 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:13:16,025 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:13:16,025 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:13:16,026 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:13:16,027 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:13:16,027 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:13:16,027 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:13:16,028 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:13:16,028 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:13:16,028 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:13:16,028 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:13:16,029 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:13:16,029 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:13:16,029 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:13:16,029 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:13:16,029 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:13:16,030 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:13:16,030 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:13:16,030 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:13:16,030 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:13:16,030 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:13:16,031 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:13:16,031 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:13:16,032 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:13:16,032 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:16,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:13:16,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:13:16,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:13:16,289 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:13:16,290 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:13:16,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-subst.wvr.bpl [2023-10-12 17:13:16,292 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-subst.wvr.bpl' [2023-10-12 17:13:16,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:13:16,331 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:13:16,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:16,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:13:16,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:13:16,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,366 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:13:16,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:16,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:13:16,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:13:16,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:13:16,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:13:16,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:13:16,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:13:16,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:13:16,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:16,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:16,416 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:16,429 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:16,456 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:13:16,457 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:13:16,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:13:16,457 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:13:16,457 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:13:16,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:13:16,457 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:13:16,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:13:16,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:13:16,458 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:13:16,458 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:13:16,459 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:13:16,459 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:16,514 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:13:16,515 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:13:16,684 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:13:16,769 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:13:16,769 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-10-12 17:13:16,771 INFO L201 PluginConnector]: Adding new model nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:16 BoogieIcfgContainer [2023-10-12 17:13:16,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:13:16,772 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:13:16,773 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:13:16,776 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:13:16,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:16,777 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/2) ... [2023-10-12 17:13:16,778 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a01c44e and model type nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:13:16, skipping insertion in model container [2023-10-12 17:13:16,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:16,779 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:16" (2/2) ... [2023-10-12 17:13:16,780 INFO L332 chiAutomizerObserver]: Analyzing ICFG nzb-file-subst.wvr.bpl [2023-10-12 17:13:16,837 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:13:16,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 86 flow [2023-10-12 17:13:16,909 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2023-10-12 17:13:16,909 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:13:16,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:13:16,914 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 86 flow [2023-10-12 17:13:16,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 25 transitions, 68 flow [2023-10-12 17:13:16,921 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:13:16,936 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 68 flow [2023-10-12 17:13:16,939 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 68 flow [2023-10-12 17:13:16,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 68 flow [2023-10-12 17:13:16,949 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2023-10-12 17:13:16,950 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:13:16,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:13:16,951 INFO L119 LiptonReduction]: Number of co-enabled transitions 210 [2023-10-12 17:13:17,302 INFO L134 LiptonReduction]: Checked pairs total: 72 [2023-10-12 17:13:17,302 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:13:17,325 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:13:17,325 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:13:17,325 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:13:17,325 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:13:17,325 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:13:17,325 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:13:17,325 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:13:17,326 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:13:17,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:13:17,374 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:13:17,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:17,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:17,381 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:17,381 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:17,382 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:13:17,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 54 states, but on-demand construction may add more states [2023-10-12 17:13:17,392 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:13:17,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:17,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:17,393 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:17,393 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:17,396 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]don't care [157] $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, L136]don't care [141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_15) (= v_i_13_30 0) (not v_break_14_39) (not v_is_null_5_15)) InVars {is_null_1=v_is_null_1_15, is_null_5=v_is_null_5_15} OutVars{i_13=v_i_13_30, is_null_5=v_is_null_5_15, break_14=v_break_14_39, is_null_1=v_is_null_1_15} AuxVars[] AssignedVars[i_13, break_14] 42#[L136, L41]don't care [2023-10-12 17:13:17,397 INFO L750 eck$LassoCheckResult]: Loop: 42#[L136, L41]don't care [144] L41-->L41: Formula: (let ((.cse2 (not v_break_14_55)) (.cse8 (select v_ends_with_6_31 v_i_13_35)) (.cse3 (not v_break_14_56)) (.cse9 (select v_ends_with_2_31 v_i_13_35))) (let ((.cse1 (not .cse9)) (.cse5 (not v_break_14_46)) (.cse0 (and .cse9 .cse3)) (.cse4 (and .cse9 .cse8)) (.cse7 (and .cse2 .cse8)) (.cse6 (not .cse8))) (and (or (and (or v_break_14_56 .cse0) v_break_14_55) (and (or v_break_14_56 .cse1) .cse2 .cse3)) (or (and (or v_break_14_46 .cse4) v_break_14_56) (and .cse5 (or .cse6 .cse1) .cse3)) .cse5 (< v_i_13_35 5) (= (+ v_i_13_35 1) v_i_13_34) (= v_result_12_39 (ite .cse7 (+ 1000 v_i_13_35) (ite .cse0 (+ v_i_13_35 (- 1000)) (ite .cse4 0 v_result_12_41)))) (or (and (or .cse7 v_break_14_55) v_break_14_43) (and (not v_break_14_43) .cse2 (or .cse6 v_break_14_55)))))) InVars {result_12=v_result_12_41, i_13=v_i_13_35, ends_with_6=v_ends_with_6_31, break_14=v_break_14_46, ends_with_2=v_ends_with_2_31} OutVars{result_12=v_result_12_39, i_13=v_i_13_34, ends_with_6=v_ends_with_6_31, break_14=v_break_14_43, ends_with_2=v_ends_with_2_31} AuxVars[v_break_14_55, v_break_14_56] AssignedVars[result_12, i_13, break_14] 42#[L136, L41]don't care [2023-10-12 17:13:17,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:17,401 INFO L85 PathProgramCache]: Analyzing trace with hash 5969, now seen corresponding path program 1 times [2023-10-12 17:13:17,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:17,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467183204] [2023-10-12 17:13:17,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:17,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:17,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:17,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:17,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:17,525 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 1 times [2023-10-12 17:13:17,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676544625] [2023-10-12 17:13:17,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:17,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:17,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:17,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:17,557 INFO L85 PathProgramCache]: Analyzing trace with hash 185183, now seen corresponding path program 1 times [2023-10-12 17:13:17,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:17,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794416237] [2023-10-12 17:13:17,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:17,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:17,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:17,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:18,229 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:18,231 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:18,231 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:18,231 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:18,231 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:18,231 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:18,232 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:18,232 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:18,232 INFO L133 ssoRankerPreferences]: Filename of dumped script: nzb-file-subst.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:13:18,232 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:18,232 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:18,251 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,458 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,462 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,465 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,578 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2023-10-12 17:13:18,798 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:18,801 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:18,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:18,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:18,805 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:18,813 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:18,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:18,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:18,821 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:13:18,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:18,830 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:18,898 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:13:18,898 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:13:18,998 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:19,090 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-10-12 17:13:19,090 INFO L444 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:13:19,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:19,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:19,101 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:19,102 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:19,111 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:19,126 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2023-10-12 17:13:19,127 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:19,128 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -2*i_13 + 9 Supporting invariants [] [2023-10-12 17:13:19,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:19,139 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:19,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:19,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:19,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:19,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:19,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:19,196 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,224 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,226 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:19,344 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 170 states and 666 transitions. Complement of second has 5 states. [2023-10-12 17:13:19,346 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:19,350 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:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2023-10-12 17:13:19,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:13:19,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:19,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:13:19,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:19,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:13:19,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:19,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 666 transitions. [2023-10-12 17:13:19,367 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 36 [2023-10-12 17:13:19,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 124 states and 478 transitions. [2023-10-12 17:13:19,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2023-10-12 17:13:19,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2023-10-12 17:13:19,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 478 transitions. [2023-10-12 17:13:19,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:19,378 INFO L219 hiAutomatonCegarLoop]: Abstraction has 124 states and 478 transitions. [2023-10-12 17:13:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 478 transitions. [2023-10-12 17:13:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 81. [2023-10-12 17:13:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 4.308641975308642) internal successors, (349), 80 states have internal predecessors, (349), 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,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 349 transitions. [2023-10-12 17:13:19,405 INFO L241 hiAutomatonCegarLoop]: Abstraction has 81 states and 349 transitions. [2023-10-12 17:13:19,405 INFO L430 stractBuchiCegarLoop]: Abstraction has 81 states and 349 transitions. [2023-10-12 17:13:19,405 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:13:19,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 349 transitions. [2023-10-12 17:13:19,407 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:13:19,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:19,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:19,408 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:13:19,408 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:19,409 INFO L748 eck$LassoCheckResult]: Stem: 498#[$Ultimate##0]don't care [157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 484#[$Ultimate##0, L136]don't care [160] L136-->$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] 486#[$Ultimate##0, L137, $Ultimate##0]don't care [146] $Ultimate##0-->L75: Formula: (and (= v_i_16_26 0) (not v_is_null_1_11) (not v_break_17_39) (not v_is_null_9_17)) InVars {is_null_1=v_is_null_1_11, is_null_9=v_is_null_9_17} OutVars{break_17=v_break_17_39, i_16=v_i_16_26, is_null_1=v_is_null_1_11, is_null_9=v_is_null_9_17} AuxVars[] AssignedVars[i_16, break_17] 454#[$Ultimate##0, L137, L75]don't care [2023-10-12 17:13:19,409 INFO L750 eck$LassoCheckResult]: Loop: 454#[$Ultimate##0, L137, L75]don't care [149] L75-->L75: Formula: (let ((.cse1 (not v_break_17_58)) (.cse8 (select v_ends_with_2_29 v_i_16_33)) (.cse6 (not v_break_17_57)) (.cse9 (select v_ends_with_10_35 v_i_16_33))) (let ((.cse3 (not .cse9)) (.cse5 (and .cse9 .cse6)) (.cse0 (and .cse8 .cse9)) (.cse4 (not v_break_17_47)) (.cse7 (and .cse8 .cse1)) (.cse2 (not .cse8))) (and (or (and v_break_17_58 (or .cse0 v_break_17_47)) (and .cse1 (or .cse2 .cse3) .cse4)) (or (and v_break_17_45 (or .cse5 v_break_17_57)) (and (not v_break_17_45) (or v_break_17_57 .cse3) .cse6)) (= v_result_15_41 (ite .cse5 (+ 1000 v_i_16_33) (ite .cse7 (+ v_i_16_33 (- 1000)) (ite .cse0 0 v_result_15_42)))) .cse4 (< v_i_16_33 5) (= (+ v_i_16_33 1) v_i_16_32) (or (and (or v_break_17_58 .cse7) v_break_17_57) (and (or .cse2 v_break_17_58) .cse1 .cse6))))) InVars {break_17=v_break_17_47, ends_with_10=v_ends_with_10_35, i_16=v_i_16_33, result_15=v_result_15_42, ends_with_2=v_ends_with_2_29} OutVars{break_17=v_break_17_45, ends_with_10=v_ends_with_10_35, i_16=v_i_16_32, result_15=v_result_15_41, ends_with_2=v_ends_with_2_29} AuxVars[v_break_17_58, v_break_17_57] AssignedVars[i_16, result_15, break_17] 454#[$Ultimate##0, L137, L75]don't care [2023-10-12 17:13:19,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:19,410 INFO L85 PathProgramCache]: Analyzing trace with hash 185774, now seen corresponding path program 1 times [2023-10-12 17:13:19,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:19,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138203865] [2023-10-12 17:13:19,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:19,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:19,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:19,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:19,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:19,419 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 1 times [2023-10-12 17:13:19,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:19,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527351185] [2023-10-12 17:13:19,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:19,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:19,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:19,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:19,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:19,436 INFO L85 PathProgramCache]: Analyzing trace with hash 5759143, now seen corresponding path program 1 times [2023-10-12 17:13:19,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:19,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140177769] [2023-10-12 17:13:19,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:19,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:19,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:19,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:19,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:19,937 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:19,937 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:19,937 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:19,937 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:19,937 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:19,938 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:19,938 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:19,938 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:19,938 INFO L133 ssoRankerPreferences]: Filename of dumped script: nzb-file-subst.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:13:19,938 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:19,938 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:19,941 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:20,067 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:20,071 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:20,073 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:20,075 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:20,077 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:20,145 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:13:20,376 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:20,376 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:20,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:20,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:20,379 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:20,392 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:20,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:20,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:20,402 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:13:20,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:20,420 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:20,447 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:13:20,447 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:13:20,539 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:20,601 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-10-12 17:13:20,601 INFO L444 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:13:20,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:20,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:20,605 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:20,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:20,641 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:20,675 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2023-10-12 17:13:20,675 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:20,675 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_16) = -2*i_16 + 9 Supporting invariants [] [2023-10-12 17:13:20,687 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:20,688 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:20,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:20,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:20,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:20,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:20,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:20,718 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:20,719 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:20,719 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 349 transitions. cyclomatic complexity: 304 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:20,772 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 349 transitions. cyclomatic complexity: 304. 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 245 states and 1020 transitions. Complement of second has 4 states. [2023-10-12 17:13:20,772 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:20,773 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:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2023-10-12 17:13:20,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:13:20,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:20,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:13:20,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:20,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:13:20,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:20,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 1020 transitions. [2023-10-12 17:13:20,785 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 18 [2023-10-12 17:13:20,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 169 states and 656 transitions. [2023-10-12 17:13:20,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2023-10-12 17:13:20,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2023-10-12 17:13:20,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 656 transitions. [2023-10-12 17:13:20,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:20,793 INFO L219 hiAutomatonCegarLoop]: Abstraction has 169 states and 656 transitions. [2023-10-12 17:13:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 656 transitions. [2023-10-12 17:13:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 115. [2023-10-12 17:13:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 4.269565217391304) internal successors, (491), 114 states have internal predecessors, (491), 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:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 491 transitions. [2023-10-12 17:13:20,815 INFO L241 hiAutomatonCegarLoop]: Abstraction has 115 states and 491 transitions. [2023-10-12 17:13:20,815 INFO L430 stractBuchiCegarLoop]: Abstraction has 115 states and 491 transitions. [2023-10-12 17:13:20,815 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:13:20,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 491 transitions. [2023-10-12 17:13:20,816 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:13:20,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:20,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:20,817 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:13:20,817 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:20,818 INFO L748 eck$LassoCheckResult]: Stem: 971#[$Ultimate##0]don't care [157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 951#[$Ultimate##0, L136]don't care [160] L136-->$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] 953#[$Ultimate##0, L137, $Ultimate##0]don't care [163] L137-->$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] 851#[$Ultimate##0, $Ultimate##0, L138, $Ultimate##0]don't care [151] $Ultimate##0-->L109: Formula: (and (= v_i_19_14 0) (not v_break_20_13) (not v_is_null_5_11) (not v_is_null_9_11)) InVars {is_null_5=v_is_null_5_11, is_null_9=v_is_null_9_11} OutVars{break_20=v_break_20_13, i_19=v_i_19_14, is_null_5=v_is_null_5_11, is_null_9=v_is_null_9_11} AuxVars[] AssignedVars[break_20, i_19] 809#[$Ultimate##0, $Ultimate##0, L138, L109]don't care [2023-10-12 17:13:20,819 INFO L750 eck$LassoCheckResult]: Loop: 809#[$Ultimate##0, $Ultimate##0, L138, L109]don't care [154] L109-->L109: Formula: (let ((.cse0 (not v_break_20_58)) (.cse1 (not v_break_20_57)) (.cse8 (select v_ends_with_10_31 v_i_19_33)) (.cse9 (select v_ends_with_6_29 v_i_19_33))) (let ((.cse2 (not .cse9)) (.cse6 (not v_break_20_47)) (.cse5 (not .cse8)) (.cse7 (and .cse1 .cse8)) (.cse3 (and .cse0 .cse9)) (.cse4 (and .cse8 .cse9))) (and (or (and .cse0 .cse1 (or .cse2 v_break_20_58)) (and (or v_break_20_58 .cse3) v_break_20_57)) (< v_i_19_33 5) (= v_i_19_32 (+ v_i_19_33 1)) (or (and (or .cse4 v_break_20_47) v_break_20_58) (and .cse0 (or .cse2 .cse5) .cse6)) .cse6 (or (and (or .cse5 v_break_20_57) .cse1 (not v_break_20_45)) (and (or .cse7 v_break_20_57) v_break_20_45)) (= v_result_18_41 (ite .cse7 (+ 1000 v_i_19_33) (ite .cse3 (+ v_i_19_33 (- 1000)) (ite .cse4 0 v_result_18_42))))))) InVars {i_19=v_i_19_33, break_20=v_break_20_47, ends_with_10=v_ends_with_10_31, ends_with_6=v_ends_with_6_29, result_18=v_result_18_42} OutVars{i_19=v_i_19_32, break_20=v_break_20_45, ends_with_10=v_ends_with_10_31, ends_with_6=v_ends_with_6_29, result_18=v_result_18_41} AuxVars[v_break_20_58, v_break_20_57] AssignedVars[i_19, break_20, result_18] 809#[$Ultimate##0, $Ultimate##0, L138, L109]don't care [2023-10-12 17:13:20,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:20,819 INFO L85 PathProgramCache]: Analyzing trace with hash 5759672, now seen corresponding path program 1 times [2023-10-12 17:13:20,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:20,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231774403] [2023-10-12 17:13:20,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:20,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:20,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:20,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:20,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash 185, now seen corresponding path program 1 times [2023-10-12 17:13:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:20,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726750015] [2023-10-12 17:13:20,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:20,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:20,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:20,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:20,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash 178549986, now seen corresponding path program 1 times [2023-10-12 17:13:20,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:20,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273677413] [2023-10-12 17:13:20,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:20,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:20,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:20,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:21,143 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:21,358 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:21,358 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:21,359 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:21,359 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:21,359 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:21,359 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:21,359 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:21,359 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:21,359 INFO L133 ssoRankerPreferences]: Filename of dumped script: nzb-file-subst.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:13:21,360 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:21,360 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:21,366 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:21,369 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:21,573 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:21,576 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:21,578 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:21,580 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:21,583 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:21,585 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:21,587 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:21,670 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2023-10-12 17:13:21,841 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:21,841 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:21,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:21,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:21,852 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:21,855 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:21,857 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:21,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:21,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:21,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:21,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:21,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:21,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:21,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:21,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:21,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:21,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:21,891 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:21,901 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:21,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:21,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:21,908 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:13:21,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:21,928 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:21,945 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:13:21,945 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:13:22,032 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:22,109 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2023-10-12 17:13:22,110 INFO L444 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:13:22,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:22,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:22,113 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:22,121 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:22,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:22,169 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2023-10-12 17:13:22,169 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:22,169 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_19) = -2*i_19 + 9 Supporting invariants [] [2023-10-12 17:13:22,177 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:22,178 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:22,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:22,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:22,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:22,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:22,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:22,205 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:22,206 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:22,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 491 transitions. cyclomatic complexity: 416 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:22,249 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 491 transitions. cyclomatic complexity: 416. 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 942 transitions. Complement of second has 4 states. [2023-10-12 17:13:22,249 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:22,251 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:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2023-10-12 17:13:22,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:13:22,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:22,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:13:22,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:22,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:13:22,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:22,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 942 transitions. [2023-10-12 17:13:22,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:13:22,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 0 states and 0 transitions. [2023-10-12 17:13:22,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:13:22,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:13:22,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:13:22,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:13:22,257 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:22,257 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:22,257 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:22,257 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:13:22,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:13:22,258 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:13:22,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:13:22,268 INFO L201 PluginConnector]: Adding new model nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:13:22 BoogieIcfgContainer [2023-10-12 17:13:22,268 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:13:22,269 INFO L158 Benchmark]: Toolchain (without parser) took 5937.50ms. Allocated memory was 178.3MB in the beginning and 271.6MB in the end (delta: 93.3MB). Free memory was 129.4MB in the beginning and 112.8MB in the end (delta: 16.6MB). Peak memory consumption was 111.4MB. Max. memory is 8.0GB. [2023-10-12 17:13:22,269 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.34ms. Allocated memory is still 178.3MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:13:22,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.89ms. Allocated memory is still 178.3MB. Free memory was 129.4MB in the beginning and 127.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:13:22,271 INFO L158 Benchmark]: Boogie Preprocessor took 16.60ms. Allocated memory is still 178.3MB. Free memory was 127.6MB in the beginning and 126.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:13:22,273 INFO L158 Benchmark]: RCFGBuilder took 386.14ms. Allocated memory is still 178.3MB. Free memory was 126.5MB in the beginning and 107.3MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-10-12 17:13:22,276 INFO L158 Benchmark]: BuchiAutomizer took 5495.40ms. Allocated memory was 178.3MB in the beginning and 271.6MB in the end (delta: 93.3MB). Free memory was 107.3MB in the beginning and 112.8MB in the end (delta: -5.5MB). Peak memory consumption was 89.4MB. Max. memory is 8.0GB. [2023-10-12 17:13:22,282 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.34ms. Allocated memory is still 178.3MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.89ms. Allocated memory is still 178.3MB. Free memory was 129.4MB in the beginning and 127.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.60ms. Allocated memory is still 178.3MB. Free memory was 127.6MB in the beginning and 126.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 386.14ms. Allocated memory is still 178.3MB. Free memory was 126.5MB in the beginning and 107.3MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 5495.40ms. Allocated memory was 178.3MB in the beginning and 271.6MB in the end (delta: 93.3MB). Free memory was 107.3MB in the beginning and 112.8MB in the end (delta: -5.5MB). Peak memory consumption was 89.4MB. 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_13 + 9 and consists of 4 locations. One deterministic module has affine ranking function 9 + -2 * i_16 and consists of 3 locations. One deterministic module has affine ranking function -2 * i_19 + 9 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. 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, 97 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, 83 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123 IncrementalHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 0 mSDtfsCounter, 123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp591 ukn13 mio100 lsp100 div100 bol133 ite100 ukn100 eq142 hnf98 smp100 dnf633 smp19 tf100 neg100 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 325ms VariablesStem: 2 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - 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.4s, 29 PlacesBefore, 24 PlacesAfterwards, 25 TransitionsBefore, 20 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 72, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 72, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 72, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 72, unknown conditional: 0, unknown unconditional: 72] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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:22,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:13:22,504 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...