/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/popl20/three-array-min.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:14:39,507 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:14:39,581 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:14:39,612 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:14:39,615 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:14:39,616 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:14:39,617 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:14:39,617 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:14:39,618 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:14:39,623 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:14:39,623 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:14:39,623 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:14:39,623 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:14:39,625 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:14:39,625 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:14:39,626 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:14:39,626 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:14:39,626 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:14:39,626 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:14:39,627 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:14:39,627 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:14:39,628 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:14:39,629 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:14:39,629 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:14:39,629 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:14:39,629 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:14:39,629 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:14:39,630 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:14:39,630 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:14:39,630 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:14:39,631 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:14:39,631 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:14:39,631 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:14:39,633 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:14:39,633 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:14:39,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:14:39,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:14:39,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:14:39,899 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:14:39,899 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:14:39,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-min.wvr.bpl [2023-10-12 17:14:39,901 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-min.wvr.bpl' [2023-10-12 17:14:39,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:14:39,932 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:14:39,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:39,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:14:39,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:14:39,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:39" (1/1) ... [2023-10-12 17:14:39,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:39" (1/1) ... [2023-10-12 17:14:39,956 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:14:39,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:39,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:14:39,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:14:39,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:14:39,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:39" (1/1) ... [2023-10-12 17:14:39,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:39" (1/1) ... [2023-10-12 17:14:39,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:39" (1/1) ... [2023-10-12 17:14:39,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:39" (1/1) ... [2023-10-12 17:14:39,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:39" (1/1) ... [2023-10-12 17:14:39,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:39" (1/1) ... [2023-10-12 17:14:39,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:39" (1/1) ... [2023-10-12 17:14:39,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:39" (1/1) ... [2023-10-12 17:14:39,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:14:39,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:14:39,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:14:39,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:14:39,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:39" (1/1) ... [2023-10-12 17:14:39,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,015 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:14:40,032 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:14:40,050 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:14:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:14:40,050 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:14:40,050 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:14:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:14:40,051 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:14:40,051 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:14:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:14:40,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:14:40,052 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:14:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:14:40,052 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:14:40,053 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:14:40,105 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:14:40,107 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:14:40,233 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:14:40,254 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:14:40,254 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:14:40,256 INFO L201 PluginConnector]: Adding new model three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:40 BoogieIcfgContainer [2023-10-12 17:14:40,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:14:40,259 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:14:40,259 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:14:40,264 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:14:40,265 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:40,265 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:39" (1/2) ... [2023-10-12 17:14:40,267 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63dc4f1c and model type three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:14:40, skipping insertion in model container [2023-10-12 17:14:40,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:40,267 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:40" (2/2) ... [2023-10-12 17:14:40,269 INFO L332 chiAutomizerObserver]: Analyzing ICFG three-array-min.wvr.bpl [2023-10-12 17:14:40,369 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:14:40,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 94 flow [2023-10-12 17:14:40,411 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2023-10-12 17:14:40,411 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:40,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 4/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:14:40,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 94 flow [2023-10-12 17:14:40,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2023-10-12 17:14:40,422 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:14:40,436 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 76 flow [2023-10-12 17:14:40,438 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 76 flow [2023-10-12 17:14:40,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 76 flow [2023-10-12 17:14:40,446 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2023-10-12 17:14:40,446 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:40,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 4/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:14:40,447 INFO L119 LiptonReduction]: Number of co-enabled transitions 184 [2023-10-12 17:14:40,783 INFO L134 LiptonReduction]: Checked pairs total: 212 [2023-10-12 17:14:40,783 INFO L136 LiptonReduction]: Total number of compositions: 14 [2023-10-12 17:14:40,801 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:14:40,801 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:14:40,801 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:14:40,801 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:14:40,801 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:14:40,801 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:14:40,801 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:14:40,802 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:14:40,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:14:40,833 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 22 [2023-10-12 17:14:40,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:40,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:40,838 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:40,838 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:40,838 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:14:40,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 31 states, but on-demand construction may add more states [2023-10-12 17:14:40,842 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 22 [2023-10-12 17:14:40,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:40,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:40,843 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:40,843 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:40,847 INFO L748 eck$LassoCheckResult]: Stem: 41#[$Ultimate##0]don't care [120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[] 44#[L67]don't care [97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L25-1, L67-1]don't care [2023-10-12 17:14:40,847 INFO L750 eck$LassoCheckResult]: Loop: 46#[L25-1, L67-1]don't care [110] L25-1-->L25-1: Formula: (and (= v_mina_15 (let ((.cse0 (select v_A_15 v_i_17))) (ite (< v_mina_16 .cse0) v_mina_16 .cse0))) (= v_minb_13 (let ((.cse1 (select v_B_13 v_i_17))) (ite (< v_minb_14 .cse1) v_minb_14 .cse1))) (= (+ v_i_17 1) v_i_16) (< v_i_17 v_N_12)) InVars {minb=v_minb_14, A=v_A_15, mina=v_mina_16, N=v_N_12, i=v_i_17, B=v_B_13} OutVars{minb=v_minb_13, A=v_A_15, mina=v_mina_15, N=v_N_12, i=v_i_16, B=v_B_13} AuxVars[] AssignedVars[minb, mina, i] 46#[L25-1, L67-1]don't care [2023-10-12 17:14:40,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:40,852 INFO L85 PathProgramCache]: Analyzing trace with hash 4778, now seen corresponding path program 1 times [2023-10-12 17:14:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:40,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735673790] [2023-10-12 17:14:40,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:40,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:40,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:40,967 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 1 times [2023-10-12 17:14:40,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:40,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149831380] [2023-10-12 17:14:40,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:40,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:40,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash 148228, now seen corresponding path program 1 times [2023-10-12 17:14:40,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:40,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866504404] [2023-10-12 17:14:40,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:40,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:41,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:41,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:41,214 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:41,215 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:41,215 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:41,215 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:41,215 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:41,215 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,215 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:41,215 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:41,216 INFO L133 ssoRankerPreferences]: Filename of dumped script: three-array-min.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:14:41,216 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:41,216 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:41,239 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:14:41,250 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:14:41,253 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:14:41,256 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:14:41,260 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:14:41,605 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:41,610 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:41,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,615 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:14:41,624 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:14:41,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,644 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:14:41,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,666 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:14:41,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,669 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:14:41,680 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:14:41,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,690 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:14:41,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,713 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:14:41,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,715 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:14:41,719 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:14:41,724 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:14:41,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,754 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:14:41,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,756 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:14:41,764 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:14:41,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,775 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:14:41,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,798 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:14:41,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,801 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:14:41,810 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:14:41,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,833 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:14:41,853 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:41,884 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:14:41,885 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:14:41,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,896 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:14:41,898 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:14:41,902 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:41,913 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:41,913 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:41,914 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:14:41,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:14:41,923 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:41,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:41,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:41,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:41,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:41,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:41,990 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:14:42,015 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:14:42,017 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 31 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:14:42,088 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 31 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 85 states and 279 transitions. Complement of second has 5 states. [2023-10-12 17:14:42,090 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:14:42,095 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:14:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2023-10-12 17:14:42,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:14:42,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:42,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:42,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:42,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:14:42,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:42,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 279 transitions. [2023-10-12 17:14:42,103 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 19 [2023-10-12 17:14:42,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 185 transitions. [2023-10-12 17:14:42,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-10-12 17:14:42,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2023-10-12 17:14:42,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 185 transitions. [2023-10-12 17:14:42,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:42,109 INFO L219 hiAutomatonCegarLoop]: Abstraction has 54 states and 185 transitions. [2023-10-12 17:14:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 185 transitions. [2023-10-12 17:14:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2023-10-12 17:14:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 3.525) internal successors, (141), 39 states have internal predecessors, (141), 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:14:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 141 transitions. [2023-10-12 17:14:42,131 INFO L241 hiAutomatonCegarLoop]: Abstraction has 40 states and 141 transitions. [2023-10-12 17:14:42,131 INFO L430 stractBuchiCegarLoop]: Abstraction has 40 states and 141 transitions. [2023-10-12 17:14:42,131 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:14:42,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 141 transitions. [2023-10-12 17:14:42,132 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 19 [2023-10-12 17:14:42,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:42,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:42,133 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:42,133 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:42,133 INFO L748 eck$LassoCheckResult]: Stem: 293#[$Ultimate##0]don't care [120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[] 283#[L67]don't care [97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 285#[L25-1, L67-1]don't care [100] L67-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 219#[L37-1, L68, L25-1]don't care [2023-10-12 17:14:42,134 INFO L750 eck$LassoCheckResult]: Loop: 219#[L37-1, L68, L25-1]don't care [115] L37-1-->L37-1: Formula: (and (= v_k_26 (+ v_k_27 1)) (< v_k_27 v_N_22) (= v_C_22 (store v_C_23 v_k_27 (+ (select v_B_19 v_k_27) (select v_A_21 v_k_27)))) (= v_k_26 v_p_16)) InVars {A=v_A_21, N=v_N_22, k=v_k_27, C=v_C_23, B=v_B_19} OutVars{A=v_A_21, p=v_p_16, N=v_N_22, k=v_k_26, C=v_C_22, B=v_B_19} AuxVars[] AssignedVars[p, k, C] 219#[L37-1, L68, L25-1]don't care [2023-10-12 17:14:42,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:42,134 INFO L85 PathProgramCache]: Analyzing trace with hash 148218, now seen corresponding path program 1 times [2023-10-12 17:14:42,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:42,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142196012] [2023-10-12 17:14:42,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:42,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:42,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:42,150 INFO L85 PathProgramCache]: Analyzing trace with hash 146, now seen corresponding path program 1 times [2023-10-12 17:14:42,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:42,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346144426] [2023-10-12 17:14:42,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:42,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:42,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash 4594873, now seen corresponding path program 1 times [2023-10-12 17:14:42,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:42,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490666313] [2023-10-12 17:14:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:42,283 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:42,283 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:42,283 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:42,283 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:42,283 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:42,283 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,284 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:42,284 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:42,284 INFO L133 ssoRankerPreferences]: Filename of dumped script: three-array-min.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:14:42,284 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:42,284 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:42,286 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:14:42,290 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:14:42,292 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:14:42,322 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:14:42,325 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:14:42,328 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:14:42,432 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:42,432 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:42,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,437 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:14:42,448 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:14:42,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:42,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:42,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:42,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:42,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:42,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:42,462 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:14:42,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:42,477 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:14:42,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,479 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:14:42,487 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:14:42,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:42,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:42,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:42,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:42,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:42,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:42,502 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:14:42,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:42,520 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:14:42,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,524 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:14:42,536 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:14:42,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:42,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:42,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:42,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:42,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:42,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:42,557 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:14:42,564 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:42,578 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:14:42,579 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2023-10-12 17:14:42,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,606 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:14:42,607 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:14:42,610 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:42,617 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:42,617 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:42,617 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, k) = 1*N - 1*k Supporting invariants [] [2023-10-12 17:14:42,621 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:14:42,622 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:42,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:42,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:42,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:42,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:42,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:42,655 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:14:42,655 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:14:42,655 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 141 transitions. cyclomatic complexity: 119 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:14:42,689 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 141 transitions. cyclomatic complexity: 119. 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 122 states and 448 transitions. Complement of second has 4 states. [2023-10-12 17:14:42,690 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:14:42,690 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:14:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2023-10-12 17:14:42,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:42,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:42,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:14:42,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:42,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:14:42,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:42,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 448 transitions. [2023-10-12 17:14:42,695 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2023-10-12 17:14:42,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 80 states and 296 transitions. [2023-10-12 17:14:42,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-10-12 17:14:42,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-10-12 17:14:42,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 296 transitions. [2023-10-12 17:14:42,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:42,698 INFO L219 hiAutomatonCegarLoop]: Abstraction has 80 states and 296 transitions. [2023-10-12 17:14:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 296 transitions. [2023-10-12 17:14:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2023-10-12 17:14:42,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 3.953846153846154) internal successors, (257), 64 states have internal predecessors, (257), 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:14:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 257 transitions. [2023-10-12 17:14:42,705 INFO L241 hiAutomatonCegarLoop]: Abstraction has 65 states and 257 transitions. [2023-10-12 17:14:42,706 INFO L430 stractBuchiCegarLoop]: Abstraction has 65 states and 257 transitions. [2023-10-12 17:14:42,706 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:14:42,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 257 transitions. [2023-10-12 17:14:42,707 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2023-10-12 17:14:42,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:42,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:42,708 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:42,708 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:42,709 INFO L748 eck$LassoCheckResult]: Stem: 543#[$Ultimate##0]don't care [120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[] 471#[L67]don't care [97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 473#[L25-1, L67-1]don't care [100] L67-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 451#[L37-1, L68, L25-1]don't care [103] L68-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 459#[L25-1, L69, L49-1, L37-1]don't care [2023-10-12 17:14:42,709 INFO L750 eck$LassoCheckResult]: Loop: 459#[L25-1, L69, L49-1, L37-1]don't care [113] L49-1-->L49-1: Formula: (and (< v_l_23 v_N_18) (<= v_p_14 v_l_23)) InVars {p=v_p_14, N=v_N_18, l=v_l_23} OutVars{p=v_p_14, N=v_N_18, l=v_l_23} AuxVars[] AssignedVars[] 459#[L25-1, L69, L49-1, L37-1]don't care [2023-10-12 17:14:42,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:42,709 INFO L85 PathProgramCache]: Analyzing trace with hash 4594861, now seen corresponding path program 1 times [2023-10-12 17:14:42,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:42,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738836678] [2023-10-12 17:14:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:42,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:42,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:42,724 INFO L85 PathProgramCache]: Analyzing trace with hash 144, now seen corresponding path program 1 times [2023-10-12 17:14:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:42,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876803738] [2023-10-12 17:14:42,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:42,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:42,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash 142440804, now seen corresponding path program 1 times [2023-10-12 17:14:42,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:42,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808258122] [2023-10-12 17:14:42,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:42,917 INFO L201 PluginConnector]: Adding new model three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:42 BoogieIcfgContainer [2023-10-12 17:14:42,917 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:42,918 INFO L158 Benchmark]: Toolchain (without parser) took 2985.61ms. Allocated memory was 213.9MB in the beginning and 369.1MB in the end (delta: 155.2MB). Free memory was 168.3MB in the beginning and 178.4MB in the end (delta: -10.2MB). Peak memory consumption was 145.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:42,919 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.30ms. Allocated memory is still 213.9MB. Free memory was 169.5MB in the beginning and 169.3MB in the end (delta: 176.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:42,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.30ms. Allocated memory is still 213.9MB. Free memory was 168.1MB in the beginning and 166.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:42,923 INFO L158 Benchmark]: Boogie Preprocessor took 17.23ms. Allocated memory is still 213.9MB. Free memory was 166.5MB in the beginning and 165.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:42,923 INFO L158 Benchmark]: RCFGBuilder took 281.42ms. Allocated memory is still 213.9MB. Free memory was 165.5MB in the beginning and 154.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:14:42,924 INFO L158 Benchmark]: BuchiAutomizer took 2658.61ms. Allocated memory was 213.9MB in the beginning and 369.1MB in the end (delta: 155.2MB). Free memory was 154.4MB in the beginning and 178.4MB in the end (delta: -24.0MB). Peak memory consumption was 131.4MB. Max. memory is 8.0GB. [2023-10-12 17:14:42,933 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.30ms. Allocated memory is still 213.9MB. Free memory was 169.5MB in the beginning and 169.3MB in the end (delta: 176.7kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.30ms. Allocated memory is still 213.9MB. Free memory was 168.1MB in the beginning and 166.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.23ms. Allocated memory is still 213.9MB. Free memory was 166.5MB in the beginning and 165.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 281.42ms. Allocated memory is still 213.9MB. Free memory was 165.5MB in the beginning and 154.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2658.61ms. Allocated memory was 213.9MB in the beginning and 369.1MB in the end (delta: 155.2MB). Free memory was 154.4MB in the beginning and 178.4MB in the end (delta: -24.0MB). Peak memory consumption was 131.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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 3 locations. The remainder module has 65 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 29 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital78 mio100 ax100 hnf100 lsp103 ukn55 mio100 lsp70 div100 bol100 ite100 ukn100 eq177 hnf92 smp100 dnf291 smp65 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 50ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 48]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L62] 0 assume i == k && i == l && i == p && i == 1; [L63] 0 assume 0 <= N; [L64] 0 assume mina == A[0]; [L65] 0 assume minb == B[0]; [L66] 0 assume minc == A[0] + B[0]; VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L67] FORK 0 fork 1 thread1(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L68] FORK 0 fork 2, 2 thread2(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 48]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L62] 0 assume i == k && i == l && i == p && i == 1; [L63] 0 assume 0 <= N; [L64] 0 assume mina == A[0]; [L65] 0 assume minb == B[0]; [L66] 0 assume minc == A[0] + B[0]; VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L67] FORK 0 fork 1 thread1(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L68] FORK 0 fork 2, 2 thread2(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 35 PlacesBefore, 23 PlacesAfterwards, 29 TransitionsBefore, 17 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 212 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 208, independent: 200, independent conditional: 0, independent unconditional: 200, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 208, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 110, unknown conditional: 0, unknown unconditional: 110] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:14:42,972 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:14:43,163 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:14:43,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...