/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-more/dec-subseq-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:13:53,729 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:13:53,805 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:13:53,835 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:13:53,835 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:13:53,836 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:13:53,837 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:13:53,837 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:13:53,838 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:13:53,841 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:13:53,842 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:13:53,842 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:13:53,842 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:13:53,843 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:13:53,844 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:13:53,844 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:13:53,844 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:13:53,845 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:13:53,845 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:13:53,845 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:13:53,846 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:13:53,847 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:13:53,847 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:13:53,847 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:13:53,847 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:13:53,848 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:13:53,848 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:13:53,848 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:13:53,848 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:13:53,849 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:13:53,849 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:13:53,850 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:13:53,850 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:13:53,851 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:13:53,851 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2023-10-12 17:13:54,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:13:54,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:13:54,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:13:54,089 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:13:54,090 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:13:54,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dec-subseq-array.wvr.bpl [2023-10-12 17:13:54,092 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dec-subseq-array.wvr.bpl' [2023-10-12 17:13:54,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:13:54,121 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:13:54,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:54,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:13:54,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:13:54,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:54" (1/1) ... [2023-10-12 17:13:54,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:54" (1/1) ... [2023-10-12 17:13:54,146 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:13:54,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:54,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:13:54,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:13:54,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:13:54,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:54" (1/1) ... [2023-10-12 17:13:54,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:54" (1/1) ... [2023-10-12 17:13:54,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:54" (1/1) ... [2023-10-12 17:13:54,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:54" (1/1) ... [2023-10-12 17:13:54,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:54" (1/1) ... [2023-10-12 17:13:54,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:54" (1/1) ... [2023-10-12 17:13:54,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:54" (1/1) ... [2023-10-12 17:13:54,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:54" (1/1) ... [2023-10-12 17:13:54,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:13:54,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:13:54,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:13:54,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:13:54,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:54" (1/1) ... [2023-10-12 17:13:54,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:54,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:54,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:54,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:13:54,237 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:13:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:13:54,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:13:54,240 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:13:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:13:54,242 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:13:54,242 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:13:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:13:54,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:13:54,243 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:13:54,286 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:13:54,287 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:13:54,379 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:13:54,394 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:13:54,394 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:13:54,396 INFO L201 PluginConnector]: Adding new model dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:54 BoogieIcfgContainer [2023-10-12 17:13:54,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:13:54,398 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:13:54,398 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:13:54,401 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:13:54,402 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:54,402 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:54" (1/2) ... [2023-10-12 17:13:54,403 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e268330 and model type dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:13:54, skipping insertion in model container [2023-10-12 17:13:54,403 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:54,403 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:54" (2/2) ... [2023-10-12 17:13:54,404 INFO L332 chiAutomizerObserver]: Analyzing ICFG dec-subseq-array.wvr.bpl [2023-10-12 17:13:54,452 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:13:54,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:13:54,492 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:13:54,492 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:13:54,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2023-10-12 17:13:54,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:13:54,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 64 flow [2023-10-12 17:13:54,502 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:13:54,529 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:13:54,532 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:13:54,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 64 flow [2023-10-12 17:13:54,552 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:13:54,552 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:13:54,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2023-10-12 17:13:54,554 INFO L119 LiptonReduction]: Number of co-enabled transitions 124 [2023-10-12 17:13:55,109 INFO L134 LiptonReduction]: Checked pairs total: 166 [2023-10-12 17:13:55,109 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:13:55,131 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:13:55,131 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:13:55,131 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:13:55,132 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:13:55,132 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:13:55,132 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:13:55,133 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:13:55,133 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:13:55,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:13:55,155 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2023-10-12 17:13:55,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:55,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:55,160 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:55,160 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:55,161 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:13:55,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 19 states, but on-demand construction may add more states [2023-10-12 17:13:55,162 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2023-10-12 17:13:55,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:55,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:55,162 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:55,162 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:55,166 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 38#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 40#[L57-1, L23]don't care [2023-10-12 17:13:55,166 INFO L750 eck$LassoCheckResult]: Loop: 40#[L57-1, L23]don't care [100] L23-->L23: Formula: (and (< v_last_19 (select v_A_30 v_i_51)) (= v_i_50 (+ v_i_51 1)) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i] 40#[L57-1, L23]don't care [2023-10-12 17:13:55,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash 4272, now seen corresponding path program 1 times [2023-10-12 17:13:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:55,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919059703] [2023-10-12 17:13:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:55,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:55,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:55,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:55,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 1 times [2023-10-12 17:13:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:55,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347045220] [2023-10-12 17:13:55,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:55,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:55,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:55,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash 132532, now seen corresponding path program 1 times [2023-10-12 17:13:55,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:55,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602128778] [2023-10-12 17:13:55,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:55,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:55,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:55,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602128778] [2023-10-12 17:13:55,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602128778] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:55,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:55,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:13:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836491718] [2023-10-12 17:13:55,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:55,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:55,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:13:55,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:13:55,514 INFO L87 Difference]: Start difference. First operand currently 19 states, but on-demand construction may add more states Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:55,550 INFO L93 Difference]: Finished difference Result 36 states and 70 transitions. [2023-10-12 17:13:55,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 70 transitions. [2023-10-12 17:13:55,553 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 20 [2023-10-12 17:13:55,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 28 states and 58 transitions. [2023-10-12 17:13:55,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-10-12 17:13:55,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-10-12 17:13:55,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 58 transitions. [2023-10-12 17:13:55,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:13:55,559 INFO L219 hiAutomatonCegarLoop]: Abstraction has 28 states and 58 transitions. [2023-10-12 17:13:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 58 transitions. [2023-10-12 17:13:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2023-10-12 17:13:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2023-10-12 17:13:55,582 INFO L241 hiAutomatonCegarLoop]: Abstraction has 19 states and 43 transitions. [2023-10-12 17:13:55,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:13:55,591 INFO L430 stractBuchiCegarLoop]: Abstraction has 19 states and 43 transitions. [2023-10-12 17:13:55,591 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:13:55,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 43 transitions. [2023-10-12 17:13:55,597 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 14 [2023-10-12 17:13:55,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:55,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:55,598 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:13:55,598 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:55,599 INFO L748 eck$LassoCheckResult]: Stem: 154#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 156#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 136#[L57-1, L23]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 138#[L57-1, L25-1]don't care [2023-10-12 17:13:55,599 INFO L750 eck$LassoCheckResult]: Loop: 138#[L57-1, L25-1]don't care [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 148#[L57-1, L23]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 138#[L57-1, L25-1]don't care [2023-10-12 17:13:55,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash 132531, now seen corresponding path program 1 times [2023-10-12 17:13:55,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:55,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146054719] [2023-10-12 17:13:55,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:55,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:55,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:55,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:55,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash 3974, now seen corresponding path program 1 times [2023-10-12 17:13:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:55,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968227545] [2023-10-12 17:13:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:55,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:55,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:55,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:55,652 INFO L85 PathProgramCache]: Analyzing trace with hash 127365304, now seen corresponding path program 1 times [2023-10-12 17:13:55,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:55,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220263760] [2023-10-12 17:13:55,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:55,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:55,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:55,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:55,816 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:55,817 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:55,817 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:55,817 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:55,817 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:55,818 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,818 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:55,818 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:55,818 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:13:55,818 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:55,818 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:55,832 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,877 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,881 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,975 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:55,979 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:55,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:55,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:56,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:56,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:56,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:56,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:56,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:56,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:56,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:13:56,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:56,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:56,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:56,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:56,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:56,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:13:56,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:56,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:56,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:56,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:56,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:56,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:56,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:56,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:56,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:56,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:56,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:56,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:56,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:56,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:56,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:56,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:56,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:56,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:56,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:56,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:13:56,137 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:56,179 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:13:56,179 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:13:56,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:56,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:56,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:56,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:13:56,186 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:56,204 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:56,204 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:56,204 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:13:56,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:56,214 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:56,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:56,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:56,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:56,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:56,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:56,291 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:13:56,292 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 43 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:56,389 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 43 transitions. cyclomatic complexity: 30. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 77 states and 188 transitions. Complement of second has 6 states. [2023-10-12 17:13:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2023-10-12 17:13:56,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:13:56,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:56,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:13:56,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:56,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:13:56,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:56,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 188 transitions. [2023-10-12 17:13:56,408 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2023-10-12 17:13:56,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 54 states and 133 transitions. [2023-10-12 17:13:56,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-10-12 17:13:56,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2023-10-12 17:13:56,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 133 transitions. [2023-10-12 17:13:56,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:56,414 INFO L219 hiAutomatonCegarLoop]: Abstraction has 54 states and 133 transitions. [2023-10-12 17:13:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 133 transitions. [2023-10-12 17:13:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2023-10-12 17:13:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.8285714285714287) internal successors, (99), 34 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 99 transitions. [2023-10-12 17:13:56,424 INFO L241 hiAutomatonCegarLoop]: Abstraction has 35 states and 99 transitions. [2023-10-12 17:13:56,424 INFO L430 stractBuchiCegarLoop]: Abstraction has 35 states and 99 transitions. [2023-10-12 17:13:56,424 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:13:56,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 99 transitions. [2023-10-12 17:13:56,426 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2023-10-12 17:13:56,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:56,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:56,427 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:13:56,427 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:56,427 INFO L748 eck$LassoCheckResult]: Stem: 318#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 320#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 322#[L57-1, L23]don't care [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 326#[L39, L58, L23]don't care [2023-10-12 17:13:56,428 INFO L750 eck$LassoCheckResult]: Loop: 326#[L39, L58, L23]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 334#[L40, L58, L23]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 326#[L39, L58, L23]don't care [2023-10-12 17:13:56,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,428 INFO L85 PathProgramCache]: Analyzing trace with hash 132516, now seen corresponding path program 1 times [2023-10-12 17:13:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:56,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835103209] [2023-10-12 17:13:56,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:56,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,451 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 1 times [2023-10-12 17:13:56,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:56,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834929896] [2023-10-12 17:13:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:56,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:56,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash 127350366, now seen corresponding path program 1 times [2023-10-12 17:13:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:56,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76943567] [2023-10-12 17:13:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:56,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:56,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76943567] [2023-10-12 17:13:56,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76943567] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:56,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:56,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:13:56,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147784593] [2023-10-12 17:13:56,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:56,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:56,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:13:56,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:13:56,610 INFO L87 Difference]: Start difference. First operand 35 states and 99 transitions. cyclomatic complexity: 72 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:56,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:56,633 INFO L93 Difference]: Finished difference Result 40 states and 103 transitions. [2023-10-12 17:13:56,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 103 transitions. [2023-10-12 17:13:56,634 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:13:56,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 95 transitions. [2023-10-12 17:13:56,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-10-12 17:13:56,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-10-12 17:13:56,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 95 transitions. [2023-10-12 17:13:56,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:56,666 INFO L219 hiAutomatonCegarLoop]: Abstraction has 35 states and 95 transitions. [2023-10-12 17:13:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 95 transitions. [2023-10-12 17:13:56,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-10-12 17:13:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 95 transitions. [2023-10-12 17:13:56,669 INFO L241 hiAutomatonCegarLoop]: Abstraction has 35 states and 95 transitions. [2023-10-12 17:13:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:13:56,670 INFO L430 stractBuchiCegarLoop]: Abstraction has 35 states and 95 transitions. [2023-10-12 17:13:56,671 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:13:56,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 95 transitions. [2023-10-12 17:13:56,671 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:13:56,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:56,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:56,672 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:13:56,672 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:56,672 INFO L748 eck$LassoCheckResult]: Stem: 446#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 448#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 408#[L57-1, L23]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 410#[L57-1, L25-1]don't care [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 426#[L39, L25-1, L58]don't care [2023-10-12 17:13:56,672 INFO L750 eck$LassoCheckResult]: Loop: 426#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 438#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 426#[L39, L25-1, L58]don't care [2023-10-12 17:13:56,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash 4108545, now seen corresponding path program 1 times [2023-10-12 17:13:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:56,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938892001] [2023-10-12 17:13:56,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:56,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,683 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 2 times [2023-10-12 17:13:56,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:56,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327922337] [2023-10-12 17:13:56,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:56,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:56,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,690 INFO L85 PathProgramCache]: Analyzing trace with hash -346653061, now seen corresponding path program 1 times [2023-10-12 17:13:56,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:56,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329260297] [2023-10-12 17:13:56,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:56,890 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:56,890 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:56,890 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:56,890 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:56,890 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:56,890 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:56,890 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:56,890 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:56,890 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:13:56,890 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:56,891 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:56,893 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:56,895 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:56,898 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:56,901 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:56,962 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:56,965 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:57,148 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:57,149 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:57,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:57,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:57,151 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:57,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:13:57,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:57,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:57,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:57,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:57,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:57,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:57,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:57,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:57,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:57,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:57,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:57,186 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:57,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:57,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:57,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:57,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:57,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:57,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:57,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:57,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:13:57,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:57,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:57,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:57,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:57,228 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:57,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:57,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:57,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:57,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:57,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:57,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:57,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:57,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:13:57,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:57,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:57,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:57,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:57,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:57,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:13:57,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:57,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:57,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:57,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:57,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:57,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:57,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:57,292 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:57,299 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:13:57,299 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:13:57,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:57,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:57,301 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:57,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:13:57,336 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:57,359 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:57,359 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:57,359 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(start, end) = -1*start + 1*end Supporting invariants [] [2023-10-12 17:13:57,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:57,366 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:57,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:57,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:57,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:57,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:57,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:57,403 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:57,403 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 95 transitions. cyclomatic complexity: 67 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:57,437 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 95 transitions. cyclomatic complexity: 67. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 86 states and 219 transitions. Complement of second has 5 states. [2023-10-12 17:13:57,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:57,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2023-10-12 17:13:57,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:13:57,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:57,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:13:57,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:57,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:13:57,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:57,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 219 transitions. [2023-10-12 17:13:57,442 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:13:57,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 54 states and 140 transitions. [2023-10-12 17:13:57,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-10-12 17:13:57,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2023-10-12 17:13:57,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 140 transitions. [2023-10-12 17:13:57,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:57,446 INFO L219 hiAutomatonCegarLoop]: Abstraction has 54 states and 140 transitions. [2023-10-12 17:13:57,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 140 transitions. [2023-10-12 17:13:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2023-10-12 17:13:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.62) internal successors, (131), 49 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 131 transitions. [2023-10-12 17:13:57,457 INFO L241 hiAutomatonCegarLoop]: Abstraction has 50 states and 131 transitions. [2023-10-12 17:13:57,457 INFO L430 stractBuchiCegarLoop]: Abstraction has 50 states and 131 transitions. [2023-10-12 17:13:57,457 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:13:57,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 131 transitions. [2023-10-12 17:13:57,460 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:13:57,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:57,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:57,460 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:13:57,460 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:57,461 INFO L748 eck$LassoCheckResult]: Stem: 627#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 629#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 597#[L57-1, L23]don't care [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 601#[L39, L58, L23]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 657#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 609#[L40, L25-1, L58]don't care [2023-10-12 17:13:57,461 INFO L750 eck$LassoCheckResult]: Loop: 609#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 585#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 609#[L40, L25-1, L58]don't care [2023-10-12 17:13:57,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:57,461 INFO L85 PathProgramCache]: Analyzing trace with hash 127351022, now seen corresponding path program 1 times [2023-10-12 17:13:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:57,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386720544] [2023-10-12 17:13:57,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:57,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:57,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:57,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:57,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:57,474 INFO L85 PathProgramCache]: Analyzing trace with hash 4231, now seen corresponding path program 3 times [2023-10-12 17:13:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:57,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684248570] [2023-10-12 17:13:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:57,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:57,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:57,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:57,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2125251124, now seen corresponding path program 2 times [2023-10-12 17:13:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810031083] [2023-10-12 17:13:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:57,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:57,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:57,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:57,662 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:57,662 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:57,663 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:57,663 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:57,663 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:57,663 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:57,663 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:57,663 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:57,663 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:13:57,663 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:57,663 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:57,665 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:57,668 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:57,671 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:57,678 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:57,934 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:57,934 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:57,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:57,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:57,995 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:57,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:13:57,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:58,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:58,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,042 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:13:58,049 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:13:58,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:58,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,110 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:13:58,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,113 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:13:58,115 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:13:58,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:58,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,151 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:13:58,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,152 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:13:58,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:58,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,167 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:13:58,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,195 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:13:58,195 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:13:58,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:58,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:58,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,253 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:13:58,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:58,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,264 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:13:58,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,275 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:13:58,275 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:13:58,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:58,317 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:13:58,317 INFO L444 ModelExtractionUtils]: 14 out of 26 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:13:58,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,321 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,330 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:58,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:13:58,362 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2023-10-12 17:13:58,363 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:58,363 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(start, end) = -1*start + 1*end Supporting invariants [] [2023-10-12 17:13:58,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:58,371 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:58,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:58,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:58,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:58,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:58,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:58,416 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:13:58,416 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 131 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:58,445 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 131 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 151 states and 382 transitions. Complement of second has 5 states. [2023-10-12 17:13:58,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2023-10-12 17:13:58,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:13:58,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:58,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:13:58,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:58,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:13:58,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:58,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 382 transitions. [2023-10-12 17:13:58,453 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:13:58,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 101 states and 260 transitions. [2023-10-12 17:13:58,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-10-12 17:13:58,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-10-12 17:13:58,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 260 transitions. [2023-10-12 17:13:58,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:58,456 INFO L219 hiAutomatonCegarLoop]: Abstraction has 101 states and 260 transitions. [2023-10-12 17:13:58,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 260 transitions. [2023-10-12 17:13:58,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 62. [2023-10-12 17:13:58,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.774193548387097) internal successors, (172), 61 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 172 transitions. [2023-10-12 17:13:58,460 INFO L241 hiAutomatonCegarLoop]: Abstraction has 62 states and 172 transitions. [2023-10-12 17:13:58,460 INFO L430 stractBuchiCegarLoop]: Abstraction has 62 states and 172 transitions. [2023-10-12 17:13:58,460 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:13:58,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 172 transitions. [2023-10-12 17:13:58,461 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:13:58,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:58,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:58,461 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:13:58,461 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:58,462 INFO L748 eck$LassoCheckResult]: Stem: 923#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 925#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 905#[L57-1, L23]don't care [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 909#[L39, L58, L23]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 973#[L40, L58, L23]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 959#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 891#[L39, L25-1, L58]don't care [2023-10-12 17:13:58,462 INFO L750 eck$LassoCheckResult]: Loop: 891#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 893#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 891#[L39, L25-1, L58]don't care [2023-10-12 17:13:58,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:58,462 INFO L85 PathProgramCache]: Analyzing trace with hash -347105971, now seen corresponding path program 3 times [2023-10-12 17:13:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:58,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741292298] [2023-10-12 17:13:58,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:58,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:58,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:58,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:58,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:58,472 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 4 times [2023-10-12 17:13:58,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:58,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529125378] [2023-10-12 17:13:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:58,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:58,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:58,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:58,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:58,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1438613447, now seen corresponding path program 4 times [2023-10-12 17:13:58,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:58,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511579051] [2023-10-12 17:13:58,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:58,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:58,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:58,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511579051] [2023-10-12 17:13:58,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511579051] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:13:58,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112256816] [2023-10-12 17:13:58,531 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-10-12 17:13:58,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:13:58,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,533 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-10-12 17:13:58,611 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-10-12 17:13:58,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:13:58,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:58,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:13:58,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:13:58,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112256816] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:58,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:13:58,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:13:58,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609561797] [2023-10-12 17:13:58,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:58,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:58,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:13:58,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:13:58,728 INFO L87 Difference]: Start difference. First operand 62 states and 172 transitions. cyclomatic complexity: 125 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:58,767 INFO L93 Difference]: Finished difference Result 146 states and 383 transitions. [2023-10-12 17:13:58,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 383 transitions. [2023-10-12 17:13:58,769 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:13:58,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 115 states and 309 transitions. [2023-10-12 17:13:58,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-10-12 17:13:58,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-10-12 17:13:58,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 309 transitions. [2023-10-12 17:13:58,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:58,771 INFO L219 hiAutomatonCegarLoop]: Abstraction has 115 states and 309 transitions. [2023-10-12 17:13:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 309 transitions. [2023-10-12 17:13:58,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2023-10-12 17:13:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 2.840909090909091) internal successors, (250), 87 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 250 transitions. [2023-10-12 17:13:58,790 INFO L241 hiAutomatonCegarLoop]: Abstraction has 88 states and 250 transitions. [2023-10-12 17:13:58,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:13:58,792 INFO L430 stractBuchiCegarLoop]: Abstraction has 88 states and 250 transitions. [2023-10-12 17:13:58,792 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:13:58,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 250 transitions. [2023-10-12 17:13:58,793 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:13:58,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:58,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:58,793 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:58,793 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:58,795 INFO L748 eck$LassoCheckResult]: Stem: 1218#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 1220#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 1200#[L57-1, L23]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 1202#[L57-1, L25-1]don't care [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 1228#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 1330#[L40, L25-1, L58]don't care [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 1274#[L40, L58, L23]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 1256#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 1188#[L39, L25-1, L58]don't care [2023-10-12 17:13:58,795 INFO L750 eck$LassoCheckResult]: Loop: 1188#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 1190#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 1188#[L39, L25-1, L58]don't care [2023-10-12 17:13:58,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:58,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1873851990, now seen corresponding path program 1 times [2023-10-12 17:13:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:58,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172324842] [2023-10-12 17:13:58,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:58,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:58,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:58,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:58,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:58,821 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 5 times [2023-10-12 17:13:58,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:58,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183057125] [2023-10-12 17:13:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:58,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:58,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:58,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:58,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:58,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1180467856, now seen corresponding path program 2 times [2023-10-12 17:13:58,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:58,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511811150] [2023-10-12 17:13:58,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:58,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:58,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:58,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:59,124 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:59,124 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:59,124 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:59,124 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:59,124 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:59,125 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:59,125 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:59,125 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:59,125 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:13:59,125 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:59,125 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:59,129 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:59,132 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:59,240 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:59,243 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:59,245 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:59,249 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:59,472 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:59,472 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:59,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:59,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:59,481 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:59,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:59,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:59,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:59,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:59,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:59,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:59,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:59,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:13:59,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:59,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:59,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:59,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:59,509 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:59,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:13:59,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:59,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:59,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:59,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:59,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:59,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:59,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:59,580 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:59,594 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:13:59,594 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:13:59,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:59,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:59,601 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:59,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:13:59,613 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:59,624 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:59,624 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:59,624 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:13:59,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:59,631 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:13:59,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:59,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:59,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:59,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:59,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:59,682 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:59,682 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 250 transitions. cyclomatic complexity: 182 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:59,711 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 250 transitions. cyclomatic complexity: 182. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 192 states and 492 transitions. Complement of second has 5 states. [2023-10-12 17:13:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2023-10-12 17:13:59,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:13:59,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:59,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:13:59,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:59,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:13:59,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:59,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 492 transitions. [2023-10-12 17:13:59,716 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:13:59,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 137 states and 359 transitions. [2023-10-12 17:13:59,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-10-12 17:13:59,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-10-12 17:13:59,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 359 transitions. [2023-10-12 17:13:59,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:59,718 INFO L219 hiAutomatonCegarLoop]: Abstraction has 137 states and 359 transitions. [2023-10-12 17:13:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 359 transitions. [2023-10-12 17:13:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 88. [2023-10-12 17:13:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 2.75) internal successors, (242), 87 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 242 transitions. [2023-10-12 17:13:59,723 INFO L241 hiAutomatonCegarLoop]: Abstraction has 88 states and 242 transitions. [2023-10-12 17:13:59,723 INFO L430 stractBuchiCegarLoop]: Abstraction has 88 states and 242 transitions. [2023-10-12 17:13:59,723 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:13:59,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 242 transitions. [2023-10-12 17:13:59,723 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:13:59,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:59,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:59,724 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2023-10-12 17:13:59,724 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:59,725 INFO L748 eck$LassoCheckResult]: Stem: 1637#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 1639#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 1609#[L57-1, L23]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 1611#[L57-1, L25-1]don't care [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 1649#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 1657#[L40, L25-1, L58]don't care [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 1645#[L40, L58, L23]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 1647#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 1721#[L39, L25-1, L58]don't care [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 1683#[L39, L58, L23]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 1679#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 1627#[L40, L25-1, L58]don't care [2023-10-12 17:13:59,725 INFO L750 eck$LassoCheckResult]: Loop: 1627#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 1625#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 1627#[L40, L25-1, L58]don't care [2023-10-12 17:13:59,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:59,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2060185838, now seen corresponding path program 3 times [2023-10-12 17:13:59,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:59,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501775945] [2023-10-12 17:13:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:59,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:59,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:59,741 INFO L85 PathProgramCache]: Analyzing trace with hash 4231, now seen corresponding path program 6 times [2023-10-12 17:13:59,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:59,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278155426] [2023-10-12 17:13:59,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:59,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:59,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:59,747 INFO L85 PathProgramCache]: Analyzing trace with hash 141336408, now seen corresponding path program 4 times [2023-10-12 17:13:59,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:59,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128789406] [2023-10-12 17:13:59,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:59,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:59,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:59,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:00,086 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:00,087 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:00,087 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:00,087 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:00,087 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:00,087 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:00,087 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:00,087 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:00,087 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:14:00,087 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:00,087 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:00,089 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:00,092 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:00,230 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:00,234 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:00,501 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:00,502 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:00,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:00,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:00,503 INFO L229 MonitoredProcess]: Starting monitored process 21 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:00,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:14:00,513 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:00,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:00,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:00,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:00,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:00,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:00,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:00,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:00,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:00,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:00,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:00,532 INFO L229 MonitoredProcess]: Starting monitored process 22 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:00,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:14:00,535 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:00,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:00,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:00,542 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:14:00,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:00,552 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:14:00,552 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:14:00,574 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:00,587 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:00,587 INFO L444 ModelExtractionUtils]: 16 out of 26 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:14:00,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:00,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:00,589 INFO L229 MonitoredProcess]: Starting monitored process 23 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:00,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:14:00,598 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:00,617 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2023-10-12 17:14:00,617 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:00,617 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:14:00,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:00,630 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:14:00,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:00,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:00,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:00,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:00,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:00,691 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:00,691 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:00,691 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 242 transitions. cyclomatic complexity: 177 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:00,707 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 242 transitions. cyclomatic complexity: 177. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 148 states and 393 transitions. Complement of second has 5 states. [2023-10-12 17:14:00,708 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:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-10-12 17:14:00,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:14:00,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:00,709 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:00,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:00,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:00,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:00,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:00,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:00,756 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:00,756 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:00,757 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 242 transitions. cyclomatic complexity: 177 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:00,786 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 242 transitions. cyclomatic complexity: 177. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 234 states and 615 transitions. Complement of second has 7 states. [2023-10-12 17:14:00,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2023-10-12 17:14:00,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:14:00,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:00,787 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:00,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:00,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:00,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:00,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:00,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:00,832 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:00,832 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:00,833 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 242 transitions. cyclomatic complexity: 177 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:00,854 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 242 transitions. cyclomatic complexity: 177. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 222 states and 558 transitions. Complement of second has 7 states. [2023-10-12 17:14:00,855 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:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2023-10-12 17:14:00,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:14:00,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:00,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:14:00,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:00,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 11 letters. Loop has 4 letters. [2023-10-12 17:14:00,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:00,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 558 transitions. [2023-10-12 17:14:00,859 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:00,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 0 states and 0 transitions. [2023-10-12 17:14:00,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:14:00,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:14:00,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:14:00,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:14:00,860 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:00,860 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:00,860 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:00,860 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:14:00,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:14:00,860 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:00,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:14:00,865 INFO L201 PluginConnector]: Adding new model dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:00 BoogieIcfgContainer [2023-10-12 17:14:00,865 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:00,866 INFO L158 Benchmark]: Toolchain (without parser) took 6745.26ms. Allocated memory was 177.2MB in the beginning and 264.2MB in the end (delta: 87.0MB). Free memory was 131.1MB in the beginning and 144.4MB in the end (delta: -13.3MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. [2023-10-12 17:14:00,866 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 177.2MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:00,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.70ms. Allocated memory is still 177.2MB. Free memory was 131.1MB in the beginning and 129.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:00,867 INFO L158 Benchmark]: Boogie Preprocessor took 20.55ms. Allocated memory is still 177.2MB. Free memory was 129.7MB in the beginning and 128.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:14:00,867 INFO L158 Benchmark]: RCFGBuilder took 226.82ms. Allocated memory is still 177.2MB. Free memory was 128.4MB in the beginning and 118.3MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:14:00,867 INFO L158 Benchmark]: BuchiAutomizer took 6467.96ms. Allocated memory was 177.2MB in the beginning and 264.2MB in the end (delta: 87.0MB). Free memory was 118.2MB in the beginning and 144.4MB in the end (delta: -26.3MB). Peak memory consumption was 61.8MB. Max. memory is 8.0GB. [2023-10-12 17:14:00,868 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.25ms. Allocated memory is still 177.2MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.70ms. Allocated memory is still 177.2MB. Free memory was 131.1MB in the beginning and 129.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.55ms. Allocated memory is still 177.2MB. Free memory was 129.7MB in the beginning and 128.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 226.82ms. Allocated memory is still 177.2MB. Free memory was 128.4MB in the beginning and 118.3MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 6467.96ms. Allocated memory was 177.2MB in the beginning and 264.2MB in the end (delta: 87.0MB). Free memory was 118.2MB in the beginning and 144.4MB in the end (delta: -26.3MB). Peak memory consumption was 61.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One nondeterministic module has affine ranking function end + -1 * start and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 4.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 6 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 [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 242 IncrementalHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 6 mSDtfsCounter, 242 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax100 hnf100 lsp96 ukn79 mio100 lsp61 div100 bol116 ite100 ukn100 eq167 hnf90 smp100 dnf186 smp70 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 95ms VariablesStem: 6 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 30 PlacesBefore, 18 PlacesAfterwards, 26 TransitionsBefore, 14 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 93, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 93, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 93, unknown conditional: 0, unknown unconditional: 93] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:14:00,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:01,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-10-12 17:14:01,285 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...