/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-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:13:16,261 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:13:16,319 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,340 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:13:16,341 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:13:16,341 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:13:16,343 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:13:16,343 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:13:16,344 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:13:16,346 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:13:16,346 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:13:16,347 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:13:16,347 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:13:16,348 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:13:16,348 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:13:16,348 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:13:16,349 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:13:16,349 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:13:16,349 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:13:16,349 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:13:16,349 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:13:16,349 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:13:16,350 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:13:16,350 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:13:16,350 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:13:16,350 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:13:16,350 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:13:16,350 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:13:16,350 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:13:16,351 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:13:16,351 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:13:16,351 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:13:16,352 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:13:16,353 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:13:16,354 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,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:13:16,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:13:16,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:13:16,532 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:13:16,532 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:13:16,533 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-trans.wvr.bpl [2023-10-12 17:13:16,534 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-trans.wvr.bpl' [2023-10-12 17:13:16,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:13:16,563 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:13:16,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:16,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:13:16,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:13:16,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,590 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:13:16,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:16,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:13:16,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:13:16,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:13:16,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:13:16,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:13:16,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:13:16,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:13:16,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/1) ... [2023-10-12 17:13:16,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:16,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:16,639 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,647 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,669 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:13:16,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:13:16,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:13:16,669 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:13:16,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:13:16,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:13:16,670 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:13:16,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:13:16,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:13:16,670 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:13:16,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:13:16,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:13:16,671 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,713 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:13:16,715 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:13:16,845 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:13:16,941 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:13:16,941 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-10-12 17:13:16,943 INFO L201 PluginConnector]: Adding new model nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:16 BoogieIcfgContainer [2023-10-12 17:13:16,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:13:16,943 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:13:16,944 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:13:16,949 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:13:16,949 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:16,949 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:16" (1/2) ... [2023-10-12 17:13:16,950 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b90fc06 and model type nzb-file-trans.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,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:16,951 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:16" (2/2) ... [2023-10-12 17:13:16,952 INFO L332 chiAutomizerObserver]: Analyzing ICFG nzb-file-trans.wvr.bpl [2023-10-12 17:13:17,067 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:13:17,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 86 flow [2023-10-12 17:13:17,128 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2023-10-12 17:13:17,129 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:13:17,132 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:17,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 86 flow [2023-10-12 17:13:17,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 25 transitions, 68 flow [2023-10-12 17:13:17,137 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:13:17,146 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 68 flow [2023-10-12 17:13:17,148 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 68 flow [2023-10-12 17:13:17,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 68 flow [2023-10-12 17:13:17,153 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2023-10-12 17:13:17,153 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:13:17,154 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:17,154 INFO L119 LiptonReduction]: Number of co-enabled transitions 210 [2023-10-12 17:13:17,311 INFO L134 LiptonReduction]: Checked pairs total: 72 [2023-10-12 17:13:17,311 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:13:17,324 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:13:17,324 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:13:17,324 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:13:17,324 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:13:17,324 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:13:17,324 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,325 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:13:17,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:13:17,369 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:13:17,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:17,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:17,374 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:17,375 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:17,376 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:13:17,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 54 states, but on-demand construction may add more states [2023-10-12 17:13:17,386 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:13:17,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:17,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:17,386 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:17,386 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:17,390 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#[L136, $Ultimate##0]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#[L41, L136]don't care [2023-10-12 17:13:17,391 INFO L750 eck$LassoCheckResult]: Loop: 42#[L41, L136]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#[L41, L136]don't care [2023-10-12 17:13:17,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash 5969, now seen corresponding path program 1 times [2023-10-12 17:13:17,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:17,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153924731] [2023-10-12 17:13:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:17,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:17,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:17,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:17,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:17,499 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 1 times [2023-10-12 17:13:17,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:17,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412212825] [2023-10-12 17:13:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:17,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:17,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:17,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:17,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:17,537 INFO L85 PathProgramCache]: Analyzing trace with hash 185183, now seen corresponding path program 1 times [2023-10-12 17:13:17,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:17,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889762100] [2023-10-12 17:13:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:17,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:17,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:17,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:18,058 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:18,059 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:18,059 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:18,059 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:18,059 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:18,059 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:18,059 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:18,059 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:18,060 INFO L133 ssoRankerPreferences]: Filename of dumped script: nzb-file-trans.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:13:18,060 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:18,060 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:18,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:18,207 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,210 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,212 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,306 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2023-10-12 17:13:18,479 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:18,482 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:18,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:18,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:18,486 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,487 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,488 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,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:18,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:18,495 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:13:18,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:18,537 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:13:18,537 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:13:18,611 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:18,690 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-10-12 17:13:18,690 INFO L444 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:13:18,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:18,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:18,694 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:18,701 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:18,729 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:18,741 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2023-10-12 17:13:18,742 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:18,742 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -2*i_13 + 9 Supporting invariants [] [2023-10-12 17:13:18,749 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:18,752 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:18,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:18,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:18,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:18,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:18,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:18,793 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,811 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,813 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:18,884 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:18,886 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:18,889 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:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2023-10-12 17:13:18,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:13:18,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:18,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:13:18,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:18,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:13:18,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:18,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 666 transitions. [2023-10-12 17:13:18,896 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 36 [2023-10-12 17:13:18,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 124 states and 478 transitions. [2023-10-12 17:13:18,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2023-10-12 17:13:18,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2023-10-12 17:13:18,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 478 transitions. [2023-10-12 17:13:18,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:18,914 INFO L219 hiAutomatonCegarLoop]: Abstraction has 124 states and 478 transitions. [2023-10-12 17:13:18,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 478 transitions. [2023-10-12 17:13:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 81. [2023-10-12 17:13:18,944 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:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 349 transitions. [2023-10-12 17:13:18,947 INFO L241 hiAutomatonCegarLoop]: Abstraction has 81 states and 349 transitions. [2023-10-12 17:13:18,947 INFO L430 stractBuchiCegarLoop]: Abstraction has 81 states and 349 transitions. [2023-10-12 17:13:18,948 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:13:18,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 349 transitions. [2023-10-12 17:13:18,949 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:13:18,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:18,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:18,950 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:13:18,950 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:18,951 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#[L136, $Ultimate##0]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_5_11) (not v_break_17_39) (not v_is_null_9_17)) InVars {is_null_5=v_is_null_5_11, is_null_9=v_is_null_9_17} OutVars{break_17=v_break_17_39, is_null_5=v_is_null_5_11, i_16=v_i_16_26, 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:18,952 INFO L750 eck$LassoCheckResult]: Loop: 454#[$Ultimate##0, L137, L75]don't care [149] L75-->L75: Formula: (let ((.cse1 (not v_break_17_58)) (.cse2 (not v_break_17_57)) (.cse9 (select v_ends_with_6_29 v_i_16_33)) (.cse8 (select v_ends_with_10_35 v_i_16_33))) (let ((.cse5 (not .cse8)) (.cse0 (not .cse9)) (.cse6 (not v_break_17_47)) (.cse4 (and .cse8 .cse2)) (.cse3 (and .cse1 .cse9)) (.cse7 (and .cse8 .cse9))) (and (or (and (or v_break_17_58 .cse0) .cse1 .cse2) (and (or v_break_17_58 .cse3) v_break_17_57)) (or (and v_break_17_45 (or .cse4 v_break_17_57)) (and (not v_break_17_45) (or v_break_17_57 .cse5) .cse2)) .cse6 (< v_i_16_33 5) (or (and v_break_17_58 (or .cse7 v_break_17_47)) (and (or .cse5 .cse0) .cse1 .cse6)) (= (+ v_i_16_33 1) v_i_16_32) (= v_result_15_41 (ite .cse4 (+ 1000 v_i_16_33) (ite .cse3 (+ v_i_16_33 (- 1000)) (ite .cse7 0 v_result_15_42))))))) InVars {break_17=v_break_17_47, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_29, i_16=v_i_16_33, result_15=v_result_15_42} OutVars{break_17=v_break_17_45, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_29, i_16=v_i_16_32, result_15=v_result_15_41} 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:18,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:18,955 INFO L85 PathProgramCache]: Analyzing trace with hash 185774, now seen corresponding path program 1 times [2023-10-12 17:13:18,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:18,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499971238] [2023-10-12 17:13:18,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:18,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:18,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:18,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:18,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:18,979 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 1 times [2023-10-12 17:13:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:18,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105267187] [2023-10-12 17:13:18,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:18,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:18,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:18,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:18,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:18,990 INFO L85 PathProgramCache]: Analyzing trace with hash 5759143, now seen corresponding path program 1 times [2023-10-12 17:13:18,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:18,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836856479] [2023-10-12 17:13:18,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:18,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:19,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:19,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:19,088 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,407 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:19,407 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:19,407 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:19,407 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:19,407 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:19,407 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:19,408 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:19,408 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:19,408 INFO L133 ssoRankerPreferences]: Filename of dumped script: nzb-file-trans.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:13:19,408 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:19,408 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:19,412 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:19,414 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:19,418 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:19,420 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:19,544 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:19,546 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:19,615 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2023-10-12 17:13:19,767 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:19,768 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:19,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:19,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:19,783 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:19,785 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:19,787 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,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:19,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:19,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:19,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:19,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:19,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:19,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:19,828 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:19,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:19,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:19,830 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:19,832 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:19,834 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,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:19,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:19,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:19,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:19,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:19,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:19,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:19,862 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:19,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:19,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:19,863 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:19,865 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:19,879 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,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:19,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:19,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:19,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:19,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:19,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:19,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:19,907 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:19,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:19,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:20,041 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:20,047 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,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:20,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:20,054 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:13:20,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:20,065 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:20,089 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:13:20,089 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:13:20,163 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:20,214 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-10-12 17:13:20,215 INFO L444 ModelExtractionUtils]: 42 out of 55 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-10-12 17:13:20,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:20,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:20,216 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:20,225 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:20,225 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:20,251 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2023-10-12 17:13:20,252 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:20,252 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_16) = -2*i_16 + 9 Supporting invariants [] [2023-10-12 17:13:20,259 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:20,260 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:20,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:20,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:20,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:20,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:20,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:20,283 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,283 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,283 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,323 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,323 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,324 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,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2023-10-12 17:13:20,324 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,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:20,324 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,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:20,324 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,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:20,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 1020 transitions. [2023-10-12 17:13:20,328 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 18 [2023-10-12 17:13:20,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 169 states and 656 transitions. [2023-10-12 17:13:20,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2023-10-12 17:13:20,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2023-10-12 17:13:20,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 656 transitions. [2023-10-12 17:13:20,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:20,331 INFO L219 hiAutomatonCegarLoop]: Abstraction has 169 states and 656 transitions. [2023-10-12 17:13:20,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 656 transitions. [2023-10-12 17:13:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 115. [2023-10-12 17:13:20,336 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,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 491 transitions. [2023-10-12 17:13:20,337 INFO L241 hiAutomatonCegarLoop]: Abstraction has 115 states and 491 transitions. [2023-10-12 17:13:20,337 INFO L430 stractBuchiCegarLoop]: Abstraction has 115 states and 491 transitions. [2023-10-12 17:13:20,337 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:13:20,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 491 transitions. [2023-10-12 17:13:20,339 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:13:20,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:20,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:20,339 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:13:20,339 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:20,339 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#[L136, $Ultimate##0]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, L138, $Ultimate##0, $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_1_11) (not v_is_null_9_11)) InVars {is_null_1=v_is_null_1_11, is_null_9=v_is_null_9_11} OutVars{break_20=v_break_20_13, i_19=v_i_19_14, is_null_1=v_is_null_1_11, is_null_9=v_is_null_9_11} AuxVars[] AssignedVars[break_20, i_19] 809#[$Ultimate##0, L138, L109, $Ultimate##0]don't care [2023-10-12 17:13:20,341 INFO L750 eck$LassoCheckResult]: Loop: 809#[$Ultimate##0, L138, L109, $Ultimate##0]don't care [154] L109-->L109: Formula: (let ((.cse5 (not v_break_20_58)) (.cse7 (not v_break_20_57)) (.cse9 (select v_ends_with_10_31 v_i_19_33)) (.cse8 (select v_ends_with_2_29 v_i_19_33))) (let ((.cse2 (and .cse9 .cse8)) (.cse6 (not v_break_20_47)) (.cse4 (not .cse9)) (.cse0 (and .cse7 .cse9)) (.cse3 (not .cse8)) (.cse1 (and .cse5 .cse8))) (and (= (ite .cse0 (+ 1000 v_i_19_33) (ite .cse1 (+ v_i_19_33 (- 1000)) (ite .cse2 0 v_result_18_42))) v_result_18_41) (< v_i_19_33 5) (= v_i_19_32 (+ v_i_19_33 1)) (or (and (or .cse3 .cse4) .cse5 .cse6) (and (or .cse2 v_break_20_47) v_break_20_58)) .cse6 (or (and (or .cse4 v_break_20_57) .cse7 (not v_break_20_45)) (and (or .cse0 v_break_20_57) v_break_20_45)) (or (and .cse5 (or .cse3 v_break_20_58) .cse7) (and v_break_20_57 (or .cse1 v_break_20_58)))))) InVars {i_19=v_i_19_33, break_20=v_break_20_47, ends_with_10=v_ends_with_10_31, result_18=v_result_18_42, ends_with_2=v_ends_with_2_29} OutVars{i_19=v_i_19_32, break_20=v_break_20_45, ends_with_10=v_ends_with_10_31, result_18=v_result_18_41, ends_with_2=v_ends_with_2_29} AuxVars[v_break_20_58, v_break_20_57] AssignedVars[i_19, break_20, result_18] 809#[$Ultimate##0, L138, L109, $Ultimate##0]don't care [2023-10-12 17:13:20,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash 5759672, now seen corresponding path program 1 times [2023-10-12 17:13:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:20,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556870605] [2023-10-12 17:13:20,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:20,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:20,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:20,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:20,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:20,365 INFO L85 PathProgramCache]: Analyzing trace with hash 185, now seen corresponding path program 1 times [2023-10-12 17:13:20,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110591967] [2023-10-12 17:13:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:20,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:20,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:20,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:20,388 INFO L85 PathProgramCache]: Analyzing trace with hash 178549986, now seen corresponding path program 1 times [2023-10-12 17:13:20,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:20,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865721142] [2023-10-12 17:13:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:20,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:20,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:20,566 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:20,754 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:20,754 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:20,754 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:20,754 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:20,754 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:20,754 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:20,754 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:20,754 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:20,754 INFO L133 ssoRankerPreferences]: Filename of dumped script: nzb-file-trans.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:13:20,754 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:20,754 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:20,758 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,760 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,872 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,874 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,876 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,878 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,880 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,882 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,884 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,960 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2023-10-12 17:13:21,127 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:21,127 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:21,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:21,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:21,128 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:21,147 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,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:21,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:21,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:21,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:21,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:21,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:21,160 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:21,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:21,174 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:21,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:21,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:21,175 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:21,177 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:21,179 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,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:21,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:21,186 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:13:21,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:21,215 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:13:21,215 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:13:21,284 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:21,332 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-10-12 17:13:21,332 INFO L444 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:13:21,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:21,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:21,334 INFO L229 MonitoredProcess]: Starting monitored process 11 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,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:13:21,366 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:21,376 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2023-10-12 17:13:21,376 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:21,376 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_19) = -2*i_19 + 9 Supporting invariants [] [2023-10-12 17:13:21,382 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:21,383 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:21,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:21,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:21,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:21,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:21,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:21,410 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:21,410 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:21,410 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:21,456 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:21,456 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:21,457 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:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2023-10-12 17:13:21,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:13:21,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:21,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:13:21,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:21,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:13:21,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:21,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 942 transitions. [2023-10-12 17:13:21,463 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:13:21,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 0 states and 0 transitions. [2023-10-12 17:13:21,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:13:21,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:13:21,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:13:21,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:13:21,463 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:21,463 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:21,463 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:21,463 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:13:21,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:13:21,464 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:13:21,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:13:21,469 INFO L201 PluginConnector]: Adding new model nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:13:21 BoogieIcfgContainer [2023-10-12 17:13:21,469 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:13:21,470 INFO L158 Benchmark]: Toolchain (without parser) took 4906.46ms. Allocated memory was 219.2MB in the beginning and 373.3MB in the end (delta: 154.1MB). Free memory was 167.1MB in the beginning and 180.4MB in the end (delta: -13.3MB). Peak memory consumption was 141.6MB. Max. memory is 8.0GB. [2023-10-12 17:13:21,470 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 219.2MB. Free memory is still 168.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:13:21,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.56ms. Allocated memory is still 219.2MB. Free memory was 167.0MB in the beginning and 165.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:13:21,472 INFO L158 Benchmark]: Boogie Preprocessor took 14.89ms. Allocated memory is still 219.2MB. Free memory was 165.5MB in the beginning and 164.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:13:21,473 INFO L158 Benchmark]: RCFGBuilder took 335.43ms. Allocated memory is still 219.2MB. Free memory was 164.2MB in the beginning and 145.5MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-10-12 17:13:21,473 INFO L158 Benchmark]: BuchiAutomizer took 4525.77ms. Allocated memory was 219.2MB in the beginning and 373.3MB in the end (delta: 154.1MB). Free memory was 145.4MB in the beginning and 180.4MB in the end (delta: -35.0MB). Peak memory consumption was 120.6MB. Max. memory is 8.0GB. [2023-10-12 17:13:21,474 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.22ms. Allocated memory is still 219.2MB. Free memory is still 168.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.56ms. Allocated memory is still 219.2MB. Free memory was 167.0MB in the beginning and 165.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.89ms. Allocated memory is still 219.2MB. Free memory was 165.5MB in the beginning and 164.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 335.43ms. Allocated memory is still 219.2MB. Free memory was 164.2MB in the beginning and 145.5MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 4525.77ms. Allocated memory was 219.2MB in the beginning and 373.3MB in the end (delta: 154.1MB). Free memory was 145.4MB in the beginning and 180.4MB in the end (delta: -35.0MB). Peak memory consumption was 120.6MB. 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 4.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. 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: inital95 mio100 ax100 hnf100 lsp485 ukn16 mio100 lsp100 div100 bol132 ite100 ukn100 eq145 hnf98 smp100 dnf471 smp22 tf100 neg100 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 258ms 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.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, 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:21,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:21,696 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...