/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-max.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:14:35,942 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:14:36,002 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:36,023 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:14:36,024 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:14:36,024 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:14:36,025 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:14:36,025 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:14:36,026 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:14:36,029 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:14:36,029 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:14:36,029 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:14:36,029 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:14:36,030 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:14:36,031 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:14:36,031 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:14:36,031 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:14:36,031 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:14:36,031 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:14:36,031 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:14:36,031 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:14:36,032 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:14:36,033 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:14:36,033 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:14:36,033 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:14:36,033 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:14:36,033 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:14:36,034 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:14:36,034 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:14:36,034 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:14:36,035 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:14:36,035 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:14:36,035 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:14:36,036 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:14:36,036 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:36,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:14:36,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:14:36,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:14:36,236 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:14:36,238 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:14:36,239 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-max.wvr.bpl [2023-10-12 17:14:36,239 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-max.wvr.bpl' [2023-10-12 17:14:36,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:14:36,269 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:14:36,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:36,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:14:36,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:14:36,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:36" (1/1) ... [2023-10-12 17:14:36,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:36" (1/1) ... [2023-10-12 17:14:36,291 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:14:36,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:36,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:14:36,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:14:36,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:14:36,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:36" (1/1) ... [2023-10-12 17:14:36,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:36" (1/1) ... [2023-10-12 17:14:36,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:36" (1/1) ... [2023-10-12 17:14:36,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:36" (1/1) ... [2023-10-12 17:14:36,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:36" (1/1) ... [2023-10-12 17:14:36,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:36" (1/1) ... [2023-10-12 17:14:36,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:36" (1/1) ... [2023-10-12 17:14:36,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:36" (1/1) ... [2023-10-12 17:14:36,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:14:36,321 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:14:36,321 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:14:36,321 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:14:36,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:36" (1/1) ... [2023-10-12 17:14:36,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,414 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:36,433 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:36,463 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:14:36,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:14:36,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:14:36,466 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:14:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:14:36,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:14:36,466 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:14:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:14:36,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:14:36,467 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:14:36,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:14:36,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:14:36,468 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:36,505 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:14:36,506 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:14:36,658 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:14:36,672 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:14:36,672 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:14:36,674 INFO L201 PluginConnector]: Adding new model three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:36 BoogieIcfgContainer [2023-10-12 17:14:36,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:14:36,674 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:14:36,674 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:14:36,678 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:14:36,678 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:36,678 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:36" (1/2) ... [2023-10-12 17:14:36,689 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30def50c and model type three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:14:36, skipping insertion in model container [2023-10-12 17:14:36,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:36,689 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:36" (2/2) ... [2023-10-12 17:14:36,695 INFO L332 chiAutomizerObserver]: Analyzing ICFG three-array-max.wvr.bpl [2023-10-12 17:14:36,770 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:14:36,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 94 flow [2023-10-12 17:14:36,845 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2023-10-12 17:14:36,846 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:36,852 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:36,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 94 flow [2023-10-12 17:14:36,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2023-10-12 17:14:36,859 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:14:36,877 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 76 flow [2023-10-12 17:14:36,881 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 76 flow [2023-10-12 17:14:36,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 76 flow [2023-10-12 17:14:36,901 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2023-10-12 17:14:36,902 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:36,902 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:36,902 INFO L119 LiptonReduction]: Number of co-enabled transitions 184 [2023-10-12 17:14:37,213 INFO L134 LiptonReduction]: Checked pairs total: 212 [2023-10-12 17:14:37,214 INFO L136 LiptonReduction]: Total number of compositions: 14 [2023-10-12 17:14:37,229 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:14:37,230 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:14:37,230 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:14:37,230 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:14:37,230 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:14:37,230 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:14:37,230 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:14:37,230 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:14:37,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:14:37,265 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 22 [2023-10-12 17:14:37,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:37,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:37,270 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:37,270 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:37,271 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:14:37,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 31 states, but on-demand construction may add more states [2023-10-12 17:14:37,277 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 22 [2023-10-12 17:14:37,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:37,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:37,277 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:37,277 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:37,286 INFO L748 eck$LassoCheckResult]: Stem: 41#[$Ultimate##0]don't care [120] $Ultimate##0-->L67: Formula: (let ((.cse1 (select v_B_27 0)) (.cse0 (select v_A_31 0))) (and (<= 0 v_N_30) (= v_i_22 v_k_40) (= v_i_22 v_l_33) (= .cse0 v_maxa_25) (= v_i_22 v_p_25) (= v_i_22 1) (= .cse1 v_maxb_23) (= (+ .cse1 .cse0) v_maxc_23))) InVars {A=v_A_31, p=v_p_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, maxa=v_maxa_25, maxb=v_maxb_23, maxc=v_maxc_23, B=v_B_27} OutVars{A=v_A_31, p=v_p_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, maxa=v_maxa_25, maxb=v_maxb_23, maxc=v_maxc_23, 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:37,286 INFO L750 eck$LassoCheckResult]: Loop: 46#[L25-1, L67-1]don't care [110] L25-1-->L25-1: Formula: (and (= (+ v_i_17 1) v_i_16) (= (let ((.cse0 (select v_A_15 v_i_17))) (ite (< .cse0 v_maxa_16) v_maxa_16 .cse0)) v_maxa_15) (= (let ((.cse1 (select v_B_13 v_i_17))) (ite (< .cse1 v_maxb_14) v_maxb_14 .cse1)) v_maxb_13) (< v_i_17 v_N_12)) InVars {A=v_A_15, N=v_N_12, i=v_i_17, maxa=v_maxa_16, maxb=v_maxb_14, B=v_B_13} OutVars{A=v_A_15, N=v_N_12, i=v_i_16, maxa=v_maxa_15, maxb=v_maxb_13, B=v_B_13} AuxVars[] AssignedVars[i, maxa, maxb] 46#[L25-1, L67-1]don't care [2023-10-12 17:14:37,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,291 INFO L85 PathProgramCache]: Analyzing trace with hash 4778, now seen corresponding path program 1 times [2023-10-12 17:14:37,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:37,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244808809] [2023-10-12 17:14:37,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:37,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:37,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,449 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 1 times [2023-10-12 17:14:37,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:37,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473592146] [2023-10-12 17:14:37,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:37,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,466 INFO L85 PathProgramCache]: Analyzing trace with hash 148228, now seen corresponding path program 1 times [2023-10-12 17:14:37,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:37,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658071468] [2023-10-12 17:14:37,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:37,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:37,675 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:37,676 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:37,676 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:37,676 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:37,676 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:37,676 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,676 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:37,677 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:37,677 INFO L133 ssoRankerPreferences]: Filename of dumped script: three-array-max.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:14:37,677 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:37,677 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:37,692 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:37,703 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:37,706 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:37,709 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:37,712 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:37,956 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:37,958 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:37,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,962 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:37,998 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:38,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,013 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:38,029 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,052 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:38,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,056 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:38,058 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:38,066 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:38,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,102 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:38,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,104 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:38,106 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:38,130 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:38,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,184 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:38,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,319 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:38,320 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:38,322 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:38,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:14:38,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,363 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:38,364 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:38,372 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:38,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,397 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:38,406 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:14:38,407 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:14:38,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,417 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:38,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:38,440 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:38,458 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:38,458 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:38,459 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:14:38,477 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:14:38,490 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:38,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:38,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:38,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:38,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:38,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:38,528 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:38,550 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:38,551 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:38,590 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:38,592 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:38,595 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:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2023-10-12 17:14:38,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:14:38,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:38,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:38,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:38,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:14:38,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:38,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 279 transitions. [2023-10-12 17:14:38,601 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 19 [2023-10-12 17:14:38,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 185 transitions. [2023-10-12 17:14:38,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-10-12 17:14:38,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2023-10-12 17:14:38,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 185 transitions. [2023-10-12 17:14:38,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:38,605 INFO L219 hiAutomatonCegarLoop]: Abstraction has 54 states and 185 transitions. [2023-10-12 17:14:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 185 transitions. [2023-10-12 17:14:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2023-10-12 17:14:38,622 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:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 141 transitions. [2023-10-12 17:14:38,623 INFO L241 hiAutomatonCegarLoop]: Abstraction has 40 states and 141 transitions. [2023-10-12 17:14:38,623 INFO L430 stractBuchiCegarLoop]: Abstraction has 40 states and 141 transitions. [2023-10-12 17:14:38,623 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:14:38,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 141 transitions. [2023-10-12 17:14:38,624 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 19 [2023-10-12 17:14:38,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:38,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:38,624 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:38,625 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:38,625 INFO L748 eck$LassoCheckResult]: Stem: 293#[$Ultimate##0]don't care [120] $Ultimate##0-->L67: Formula: (let ((.cse1 (select v_B_27 0)) (.cse0 (select v_A_31 0))) (and (<= 0 v_N_30) (= v_i_22 v_k_40) (= v_i_22 v_l_33) (= .cse0 v_maxa_25) (= v_i_22 v_p_25) (= v_i_22 1) (= .cse1 v_maxb_23) (= (+ .cse1 .cse0) v_maxc_23))) InVars {A=v_A_31, p=v_p_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, maxa=v_maxa_25, maxb=v_maxb_23, maxc=v_maxc_23, B=v_B_27} OutVars{A=v_A_31, p=v_p_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, maxa=v_maxa_25, maxb=v_maxb_23, maxc=v_maxc_23, 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:38,625 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:38,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:38,626 INFO L85 PathProgramCache]: Analyzing trace with hash 148218, now seen corresponding path program 1 times [2023-10-12 17:14:38,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:38,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672514715] [2023-10-12 17:14:38,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:38,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:38,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:38,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:38,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:38,636 INFO L85 PathProgramCache]: Analyzing trace with hash 146, now seen corresponding path program 1 times [2023-10-12 17:14:38,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:38,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567168769] [2023-10-12 17:14:38,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:38,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:38,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:38,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:38,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash 4594873, now seen corresponding path program 1 times [2023-10-12 17:14:38,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:38,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842169293] [2023-10-12 17:14:38,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:38,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:38,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:38,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:38,726 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:38,726 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:38,726 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:38,727 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:38,727 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:38,727 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,727 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:38,727 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:38,727 INFO L133 ssoRankerPreferences]: Filename of dumped script: three-array-max.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:14:38,727 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:38,727 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:38,728 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:38,730 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:38,732 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:38,734 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:38,751 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:38,753 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:38,830 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:38,830 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:38,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,831 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:38,849 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:38,861 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:38,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,910 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:38,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,915 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:38,917 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:38,961 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:38,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,998 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:38,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,999 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:39,001 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:39,016 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:39,020 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:39,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:39,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:39,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:39,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:39,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:39,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:39,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:39,043 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:39,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,044 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:39,061 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:39,062 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:39,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:39,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:39,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:39,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:39,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:39,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:39,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:39,087 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:39,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,088 INFO L229 MonitoredProcess]: Starting monitored process 12 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:39,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:14:39,091 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:39,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:39,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:39,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:39,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:39,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:39,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:39,116 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:39,127 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:39,127 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:14:39,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,128 INFO L229 MonitoredProcess]: Starting monitored process 13 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:39,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:14:39,131 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:39,152 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:39,153 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:39,153 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, k) = 1*N - 1*k Supporting invariants [] [2023-10-12 17:14:39,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:39,175 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:39,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:39,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:39,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:39,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:39,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:39,198 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:39,198 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:39,198 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:39,223 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:39,223 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:39,224 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:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2023-10-12 17:14:39,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:39,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:14:39,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:14:39,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 448 transitions. [2023-10-12 17:14:39,227 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2023-10-12 17:14:39,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 80 states and 296 transitions. [2023-10-12 17:14:39,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-10-12 17:14:39,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-10-12 17:14:39,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 296 transitions. [2023-10-12 17:14:39,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:39,229 INFO L219 hiAutomatonCegarLoop]: Abstraction has 80 states and 296 transitions. [2023-10-12 17:14:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 296 transitions. [2023-10-12 17:14:39,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2023-10-12 17:14:39,233 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:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 257 transitions. [2023-10-12 17:14:39,233 INFO L241 hiAutomatonCegarLoop]: Abstraction has 65 states and 257 transitions. [2023-10-12 17:14:39,233 INFO L430 stractBuchiCegarLoop]: Abstraction has 65 states and 257 transitions. [2023-10-12 17:14:39,233 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:14:39,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 257 transitions. [2023-10-12 17:14:39,234 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2023-10-12 17:14:39,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:39,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:39,235 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:39,235 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:39,235 INFO L748 eck$LassoCheckResult]: Stem: 543#[$Ultimate##0]don't care [120] $Ultimate##0-->L67: Formula: (let ((.cse1 (select v_B_27 0)) (.cse0 (select v_A_31 0))) (and (<= 0 v_N_30) (= v_i_22 v_k_40) (= v_i_22 v_l_33) (= .cse0 v_maxa_25) (= v_i_22 v_p_25) (= v_i_22 1) (= .cse1 v_maxb_23) (= (+ .cse1 .cse0) v_maxc_23))) InVars {A=v_A_31, p=v_p_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, maxa=v_maxa_25, maxb=v_maxb_23, maxc=v_maxc_23, B=v_B_27} OutVars{A=v_A_31, p=v_p_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, maxa=v_maxa_25, maxb=v_maxb_23, maxc=v_maxc_23, 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#[L69, L49-1, L37-1, L25-1]don't care [2023-10-12 17:14:39,235 INFO L750 eck$LassoCheckResult]: Loop: 459#[L69, L49-1, L37-1, L25-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#[L69, L49-1, L37-1, L25-1]don't care [2023-10-12 17:14:39,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,235 INFO L85 PathProgramCache]: Analyzing trace with hash 4594861, now seen corresponding path program 1 times [2023-10-12 17:14:39,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:39,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914178735] [2023-10-12 17:14:39,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:39,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:39,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,245 INFO L85 PathProgramCache]: Analyzing trace with hash 144, now seen corresponding path program 1 times [2023-10-12 17:14:39,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:39,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732277230] [2023-10-12 17:14:39,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:39,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:39,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,249 INFO L85 PathProgramCache]: Analyzing trace with hash 142440804, now seen corresponding path program 1 times [2023-10-12 17:14:39,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:39,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772140970] [2023-10-12 17:14:39,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:39,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,365 INFO L201 PluginConnector]: Adding new model three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:39 BoogieIcfgContainer [2023-10-12 17:14:39,365 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:39,366 INFO L158 Benchmark]: Toolchain (without parser) took 3096.44ms. Allocated memory was 178.3MB in the beginning and 311.4MB in the end (delta: 133.2MB). Free memory was 129.2MB in the beginning and 242.9MB in the end (delta: -113.6MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. [2023-10-12 17:14:39,366 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 178.3MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:39,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.55ms. Allocated memory is still 178.3MB. Free memory was 129.2MB in the beginning and 127.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:39,367 INFO L158 Benchmark]: Boogie Preprocessor took 26.66ms. Allocated memory is still 178.3MB. Free memory was 127.8MB in the beginning and 126.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:14:39,367 INFO L158 Benchmark]: RCFGBuilder took 353.11ms. Allocated memory is still 178.3MB. Free memory was 126.6MB in the beginning and 115.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:14:39,367 INFO L158 Benchmark]: BuchiAutomizer took 2690.95ms. Allocated memory was 178.3MB in the beginning and 311.4MB in the end (delta: 133.2MB). Free memory was 115.6MB in the beginning and 242.9MB in the end (delta: -127.3MB). Peak memory consumption was 5.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:39,369 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 178.3MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.55ms. Allocated memory is still 178.3MB. Free memory was 129.2MB in the beginning and 127.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.66ms. Allocated memory is still 178.3MB. Free memory was 127.8MB in the beginning and 126.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 353.11ms. Allocated memory is still 178.3MB. Free memory was 126.6MB in the beginning and 115.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2690.95ms. Allocated memory was 178.3MB in the beginning and 311.4MB in the end (delta: 133.2MB). Free memory was 115.6MB in the beginning and 242.9MB in the end (delta: -127.3MB). Peak memory consumption was 5.0MB. 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.8s. 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.0s 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: 70ms 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 maxa == A[0]; [L65] 0 assume maxb == B[0]; [L66] 0 assume maxc == A[0] + B[0]; VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] [L67] FORK 0 fork 1 thread1(); VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] [L68] FORK 0 fork 2, 2 thread2(); VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=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 maxa == A[0]; [L65] 0 assume maxb == B[0]; [L66] 0 assume maxc == A[0] + B[0]; VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] [L67] FORK 0 fork 1 thread1(); VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] [L68] FORK 0 fork 2, 2 thread2(); VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=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:39,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:39,589 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...