/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-bad/ring.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:13:45,226 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:13:45,298 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:45,326 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:13:45,327 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:13:45,327 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:13:45,328 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:13:45,329 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:13:45,329 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:13:45,332 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:13:45,332 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:13:45,332 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:13:45,332 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:13:45,333 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:13:45,334 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:13:45,334 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:13:45,334 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:13:45,334 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:13:45,335 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:13:45,335 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:13:45,335 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:13:45,336 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:13:45,336 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:13:45,336 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:13:45,336 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:13:45,337 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:13:45,337 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:13:45,337 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:13:45,337 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:13:45,337 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:13:45,338 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:13:45,338 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:13:45,338 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:13:45,339 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:13:45,340 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:45,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:13:45,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:13:45,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:13:45,557 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:13:45,557 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:13:45,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl [2023-10-12 17:13:45,559 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl' [2023-10-12 17:13:45,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:13:45,590 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:13:45,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:45,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:13:45,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:13:45,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,615 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:13:45,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:45,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:13:45,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:13:45,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:13:45,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:13:45,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:13:45,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:13:45,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:13:45,643 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:45,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:45,695 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:45,705 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:45,736 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:13:45,736 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:13:45,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:13:45,739 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:13:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:13:45,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:13:45,739 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:13:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:13:45,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:13:45,740 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:13:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:13:45,740 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:13:45,741 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:45,789 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:13:45,790 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:13:45,888 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:13:45,908 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:13:45,909 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:13:45,910 INFO L201 PluginConnector]: Adding new model ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:45 BoogieIcfgContainer [2023-10-12 17:13:45,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:13:45,911 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:13:45,911 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:13:45,914 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:13:45,914 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:45,915 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/2) ... [2023-10-12 17:13:45,916 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f6cbbd0 and model type ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:13:45, skipping insertion in model container [2023-10-12 17:13:45,916 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:45,916 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:45" (2/2) ... [2023-10-12 17:13:45,917 INFO L332 chiAutomizerObserver]: Analyzing ICFG ring.wvr.bpl [2023-10-12 17:13:45,963 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:13:46,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 114 flow [2023-10-12 17:13:46,042 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-10-12 17:13:46,042 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:13:46,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:13:46,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 114 flow [2023-10-12 17:13:46,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 96 flow [2023-10-12 17:13:46,053 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:13:46,062 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 96 flow [2023-10-12 17:13:46,064 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 96 flow [2023-10-12 17:13:46,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 96 flow [2023-10-12 17:13:46,072 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-10-12 17:13:46,073 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:13:46,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:13:46,074 INFO L119 LiptonReduction]: Number of co-enabled transitions 634 [2023-10-12 17:13:46,636 INFO L134 LiptonReduction]: Checked pairs total: 565 [2023-10-12 17:13:46,636 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-10-12 17:13:46,649 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:13:46,649 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:13:46,649 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:13:46,650 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:13:46,650 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:13:46,650 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:13:46,650 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:13:46,650 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:13:46,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:13:46,679 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 44 [2023-10-12 17:13:46,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:46,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:46,688 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:13:46,689 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:46,689 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:13:46,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 68 states, but on-demand construction may add more states [2023-10-12 17:13:46,693 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 44 [2023-10-12 17:13:46,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:46,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:46,693 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:13:46,693 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:46,697 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]don't care [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L97-1]don't care [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 59#[L34-1, L97-1]don't care [2023-10-12 17:13:46,699 INFO L750 eck$LassoCheckResult]: Loop: 59#[L34-1, L97-1]don't care [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 63#[L35-1, L97-1]don't care [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 59#[L34-1, L97-1]don't care [2023-10-12 17:13:46,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash 135187, now seen corresponding path program 1 times [2023-10-12 17:13:46,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:46,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908982596] [2023-10-12 17:13:46,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:46,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:46,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:46,831 INFO L85 PathProgramCache]: Analyzing trace with hash 6118, now seen corresponding path program 1 times [2023-10-12 17:13:46,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:46,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916908576] [2023-10-12 17:13:46,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:46,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:46,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash 129919864, now seen corresponding path program 1 times [2023-10-12 17:13:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:46,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241852987] [2023-10-12 17:13:46,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:46,899 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:46,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:46,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241852987] [2023-10-12 17:13:46,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241852987] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:46,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:46,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:13:46,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074086330] [2023-10-12 17:13:46,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:46,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:46,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:13:46,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:13:46,969 INFO L87 Difference]: Start difference. First operand currently 68 states, but on-demand construction may add more states 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:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:47,004 INFO L93 Difference]: Finished difference Result 102 states and 272 transitions. [2023-10-12 17:13:47,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 272 transitions. [2023-10-12 17:13:47,018 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 44 [2023-10-12 17:13:47,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 89 states and 244 transitions. [2023-10-12 17:13:47,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2023-10-12 17:13:47,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2023-10-12 17:13:47,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 244 transitions. [2023-10-12 17:13:47,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:13:47,027 INFO L219 hiAutomatonCegarLoop]: Abstraction has 89 states and 244 transitions. [2023-10-12 17:13:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 244 transitions. [2023-10-12 17:13:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2023-10-12 17:13:47,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 2.782051282051282) internal successors, (217), 77 states have internal predecessors, (217), 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:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 217 transitions. [2023-10-12 17:13:47,048 INFO L241 hiAutomatonCegarLoop]: Abstraction has 78 states and 217 transitions. [2023-10-12 17:13:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:13:47,052 INFO L430 stractBuchiCegarLoop]: Abstraction has 78 states and 217 transitions. [2023-10-12 17:13:47,052 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:13:47,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 217 transitions. [2023-10-12 17:13:47,053 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 40 [2023-10-12 17:13:47,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:47,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:47,054 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:13:47,054 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:47,054 INFO L748 eck$LassoCheckResult]: Stem: 397#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 325#[L97]don't care [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 327#[$Ultimate##0, L97-1]don't care [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 349#[L98, $Ultimate##0, $Ultimate##0]don't care [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 353#[L98, L58-1, $Ultimate##0]don't care [2023-10-12 17:13:47,054 INFO L750 eck$LassoCheckResult]: Loop: 353#[L98, L58-1, $Ultimate##0]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 353#[L98, L58-1, $Ultimate##0]don't care [2023-10-12 17:13:47,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:47,055 INFO L85 PathProgramCache]: Analyzing trace with hash 4190712, now seen corresponding path program 1 times [2023-10-12 17:13:47,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:47,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680135702] [2023-10-12 17:13:47,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:47,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:47,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:47,063 INFO L85 PathProgramCache]: Analyzing trace with hash 200, now seen corresponding path program 1 times [2023-10-12 17:13:47,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:47,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329432589] [2023-10-12 17:13:47,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:47,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:47,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:47,073 INFO L85 PathProgramCache]: Analyzing trace with hash 129912241, now seen corresponding path program 1 times [2023-10-12 17:13:47,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:47,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909926018] [2023-10-12 17:13:47,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:47,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:47,095 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:47,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:47,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909926018] [2023-10-12 17:13:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909926018] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:47,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:47,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:13:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003540137] [2023-10-12 17:13:47,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:47,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:47,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:13:47,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:13:47,160 INFO L87 Difference]: Start difference. First operand 78 states and 217 transitions. cyclomatic complexity: 173 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:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:47,180 INFO L93 Difference]: Finished difference Result 84 states and 228 transitions. [2023-10-12 17:13:47,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 228 transitions. [2023-10-12 17:13:47,182 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 34 [2023-10-12 17:13:47,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 228 transitions. [2023-10-12 17:13:47,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2023-10-12 17:13:47,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2023-10-12 17:13:47,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 228 transitions. [2023-10-12 17:13:47,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:13:47,184 INFO L219 hiAutomatonCegarLoop]: Abstraction has 84 states and 228 transitions. [2023-10-12 17:13:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 228 transitions. [2023-10-12 17:13:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2023-10-12 17:13:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 2.7195121951219514) internal successors, (223), 81 states have internal predecessors, (223), 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:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 223 transitions. [2023-10-12 17:13:47,189 INFO L241 hiAutomatonCegarLoop]: Abstraction has 82 states and 223 transitions. [2023-10-12 17:13:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:13:47,190 INFO L430 stractBuchiCegarLoop]: Abstraction has 82 states and 223 transitions. [2023-10-12 17:13:47,190 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:13:47,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 223 transitions. [2023-10-12 17:13:47,191 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 33 [2023-10-12 17:13:47,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:47,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:47,191 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:13:47,191 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:47,192 INFO L748 eck$LassoCheckResult]: Stem: 645#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 573#[L97]don't care [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 575#[$Ultimate##0, L97-1]don't care [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 553#[L34-1, L97-1]don't care [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 555#[L35-1, L97-1]don't care [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 681#[L98, $Ultimate##0, L35-1]don't care [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 671#[L98, L35-1, L58-1]don't care [2023-10-12 17:13:47,192 INFO L750 eck$LassoCheckResult]: Loop: 671#[L98, L35-1, L58-1]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 671#[L98, L35-1, L58-1]don't care [2023-10-12 17:13:47,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash -267452062, now seen corresponding path program 1 times [2023-10-12 17:13:47,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:47,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863653197] [2023-10-12 17:13:47,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:47,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:47,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:47,202 INFO L85 PathProgramCache]: Analyzing trace with hash 200, now seen corresponding path program 2 times [2023-10-12 17:13:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:47,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811723175] [2023-10-12 17:13:47,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:47,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:47,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash 298920839, now seen corresponding path program 1 times [2023-10-12 17:13:47,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:47,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892455701] [2023-10-12 17:13:47,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:47,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:47,370 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:47,371 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:47,371 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:47,371 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:47,371 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:47,371 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,371 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:47,371 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:47,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:13:47,372 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:47,372 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:47,385 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:47,392 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:47,395 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:47,397 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:47,399 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:47,401 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:47,455 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:47,457 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:47,631 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:47,634 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:47,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,656 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:47,661 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:47,662 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:47,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,690 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:47,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,702 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:47,709 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:47,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,719 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:47,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,755 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:47,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,757 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:47,758 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:47,760 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:47,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,789 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:47,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,791 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:47,803 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:47,804 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:47,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:13:47,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,857 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:47,875 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:47,881 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:47,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,923 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:47,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,953 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:47,957 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:47,959 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:47,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:13:47,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,996 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:47,998 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:48,000 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:48,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,008 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:13:48,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,028 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:13:48,028 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:13:48,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,058 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:48,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,060 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:48,062 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:48,064 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:48,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,088 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:48,104 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:13:48,104 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:13:48,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,108 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:48,109 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:48,110 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:48,127 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:48,127 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:48,128 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:13:48,147 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:48,149 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:48,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:48,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:48,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:48,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:48,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:48,185 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:48,188 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:48,188 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 223 transitions. cyclomatic complexity: 168 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:48,231 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 223 transitions. cyclomatic complexity: 168. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 243 states and 734 transitions. Complement of second has 5 states. [2023-10-12 17:13:48,231 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:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2023-10-12 17:13:48,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:13:48,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:48,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:13:48,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:48,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:13:48,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:48,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 734 transitions. [2023-10-12 17:13:48,236 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 42 [2023-10-12 17:13:48,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 192 states and 566 transitions. [2023-10-12 17:13:48,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2023-10-12 17:13:48,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 170 [2023-10-12 17:13:48,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 566 transitions. [2023-10-12 17:13:48,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:48,239 INFO L219 hiAutomatonCegarLoop]: Abstraction has 192 states and 566 transitions. [2023-10-12 17:13:48,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 566 transitions. [2023-10-12 17:13:48,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 121. [2023-10-12 17:13:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 3.1074380165289255) internal successors, (376), 120 states have internal predecessors, (376), 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:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 376 transitions. [2023-10-12 17:13:48,245 INFO L241 hiAutomatonCegarLoop]: Abstraction has 121 states and 376 transitions. [2023-10-12 17:13:48,245 INFO L430 stractBuchiCegarLoop]: Abstraction has 121 states and 376 transitions. [2023-10-12 17:13:48,245 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:13:48,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 376 transitions. [2023-10-12 17:13:48,246 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 36 [2023-10-12 17:13:48,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:48,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:48,246 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:13:48,246 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:48,247 INFO L748 eck$LassoCheckResult]: Stem: 1124#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 1020#[L97]don't care [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1022#[$Ultimate##0, L97-1]don't care [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 1000#[L34-1, L97-1]don't care [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1006#[L98, $Ultimate##0, L34-1]don't care [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 1166#[L98, L58-1, L34-1]don't care [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 1168#[L98, L35-1, L58-1]don't care [2023-10-12 17:13:48,247 INFO L750 eck$LassoCheckResult]: Loop: 1168#[L98, L35-1, L58-1]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 1168#[L98, L35-1, L58-1]don't care [2023-10-12 17:13:48,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,247 INFO L85 PathProgramCache]: Analyzing trace with hash -267468742, now seen corresponding path program 2 times [2023-10-12 17:13:48,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:48,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806920149] [2023-10-12 17:13:48,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:48,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:48,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash 200, now seen corresponding path program 3 times [2023-10-12 17:13:48,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:48,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783556066] [2023-10-12 17:13:48,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:48,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:48,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,262 INFO L85 PathProgramCache]: Analyzing trace with hash 298403759, now seen corresponding path program 2 times [2023-10-12 17:13:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:48,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171595100] [2023-10-12 17:13:48,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:48,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:13:48,440 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:48,440 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:48,440 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:48,440 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:48,440 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:48,440 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,441 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:48,441 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:48,441 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:13:48,441 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:48,441 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:48,442 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:48,444 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:48,447 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:48,449 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:48,498 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:48,501 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:48,503 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:48,505 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:48,663 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:48,663 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:48,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,681 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:48,686 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:48,686 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:48,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-10-12 17:13:48,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,745 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:48,746 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:48,763 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:48,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,809 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:48,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,811 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:48,833 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:48,833 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:48,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,848 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:48,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,850 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:48,852 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:48,853 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:48,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,896 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:48,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,913 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:48,920 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:48,921 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:48,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,928 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:13:48,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,942 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:13:48,942 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:13:48,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,964 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:48,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,966 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:48,968 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:48,969 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:48,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,985 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:49,013 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:13:49,013 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:13:49,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:49,033 INFO L229 MonitoredProcess]: Starting monitored process 17 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:49,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:13:49,049 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:49,081 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:49,081 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:49,081 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:13:49,086 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:49,087 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:49,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:49,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:49,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:49,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:49,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:49,117 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:49,118 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:49,118 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 376 transitions. cyclomatic complexity: 297 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:49,155 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 376 transitions. cyclomatic complexity: 297. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 273 states and 885 transitions. Complement of second has 5 states. [2023-10-12 17:13:49,155 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:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2023-10-12 17:13:49,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:13:49,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:49,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:13:49,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:49,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:13:49,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:49,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 885 transitions. [2023-10-12 17:13:49,159 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 53 [2023-10-12 17:13:49,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 243 states and 753 transitions. [2023-10-12 17:13:49,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2023-10-12 17:13:49,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2023-10-12 17:13:49,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 243 states and 753 transitions. [2023-10-12 17:13:49,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:49,162 INFO L219 hiAutomatonCegarLoop]: Abstraction has 243 states and 753 transitions. [2023-10-12 17:13:49,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states and 753 transitions. [2023-10-12 17:13:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 137. [2023-10-12 17:13:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 3.1386861313868613) internal successors, (430), 136 states have internal predecessors, (430), 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:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 430 transitions. [2023-10-12 17:13:49,169 INFO L241 hiAutomatonCegarLoop]: Abstraction has 137 states and 430 transitions. [2023-10-12 17:13:49,169 INFO L430 stractBuchiCegarLoop]: Abstraction has 137 states and 430 transitions. [2023-10-12 17:13:49,169 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:13:49,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 430 transitions. [2023-10-12 17:13:49,170 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 35 [2023-10-12 17:13:49,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:49,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:49,170 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:13:49,170 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:49,170 INFO L748 eck$LassoCheckResult]: Stem: 1683#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 1575#[L97]don't care [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1577#[$Ultimate##0, L97-1]don't care [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 1555#[L34-1, L97-1]don't care [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1561#[L98, $Ultimate##0, L34-1]don't care [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 1723#[L98, L58-1, L34-1]don't care [168] L34-1-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_22 v_q1_back_38) 0) (<= v_N_12 v_i_20)) InVars {q1=v_q1_22, N=v_N_12, i=v_i_20, q1_back=v_q1_back_38} OutVars{q1=v_q1_22, N=v_N_12, i=v_i_20, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back] 1719#[L98, thread1EXIT, L58-1]don't care [2023-10-12 17:13:49,170 INFO L750 eck$LassoCheckResult]: Loop: 1719#[L98, thread1EXIT, L58-1]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 1719#[L98, thread1EXIT, L58-1]don't care [2023-10-12 17:13:49,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,171 INFO L85 PathProgramCache]: Analyzing trace with hash -267468735, now seen corresponding path program 1 times [2023-10-12 17:13:49,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880721525] [2023-10-12 17:13:49,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:49,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash 200, now seen corresponding path program 4 times [2023-10-12 17:13:49,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630991325] [2023-10-12 17:13:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:49,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,186 INFO L85 PathProgramCache]: Analyzing trace with hash 298403976, now seen corresponding path program 1 times [2023-10-12 17:13:49,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431992815] [2023-10-12 17:13:49,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:49,345 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:49,345 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:49,345 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:49,345 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:49,345 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:49,345 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,345 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:49,345 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:49,345 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:13:49,345 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:49,345 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:49,348 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:49,350 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:49,399 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:49,403 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:49,408 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:49,411 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:49,413 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:49,416 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:49,581 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:49,581 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:49,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:49,597 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:49,626 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:49,627 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:49,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:49,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:49,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:49,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:49,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:49,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:49,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:49,656 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:49,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:49,657 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:49,658 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:49,661 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:49,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:49,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:49,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:49,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:49,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:49,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:49,672 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:49,680 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:13:49,680 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:13:49,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:49,682 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:49,683 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:49,685 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:49,690 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:49,691 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:49,691 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:13:49,694 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:49,694 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:49,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:49,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:49,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:49,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:49,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:49,727 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:49,727 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:49,727 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 137 states and 430 transitions. cyclomatic complexity: 336 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:49,755 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 137 states and 430 transitions. cyclomatic complexity: 336. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 209 states and 663 transitions. Complement of second has 4 states. [2023-10-12 17:13:49,756 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:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2023-10-12 17:13:49,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:13:49,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:49,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:13:49,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:49,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:13:49,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:49,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 663 transitions. [2023-10-12 17:13:49,758 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 30 [2023-10-12 17:13:49,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 177 states and 532 transitions. [2023-10-12 17:13:49,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2023-10-12 17:13:49,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2023-10-12 17:13:49,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 532 transitions. [2023-10-12 17:13:49,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:49,760 INFO L219 hiAutomatonCegarLoop]: Abstraction has 177 states and 532 transitions. [2023-10-12 17:13:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 532 transitions. [2023-10-12 17:13:49,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 134. [2023-10-12 17:13:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 3.126865671641791) internal successors, (419), 133 states have internal predecessors, (419), 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:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 419 transitions. [2023-10-12 17:13:49,765 INFO L241 hiAutomatonCegarLoop]: Abstraction has 134 states and 419 transitions. [2023-10-12 17:13:49,765 INFO L430 stractBuchiCegarLoop]: Abstraction has 134 states and 419 transitions. [2023-10-12 17:13:49,765 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:13:49,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 419 transitions. [2023-10-12 17:13:49,766 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 28 [2023-10-12 17:13:49,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:49,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:49,766 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:13:49,766 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:49,767 INFO L748 eck$LassoCheckResult]: Stem: 2213#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 2095#[L97]don't care [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 2097#[$Ultimate##0, L97-1]don't care [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2131#[L98, $Ultimate##0, $Ultimate##0]don't care [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 2133#[$Ultimate##0, L99, $Ultimate##0, $Ultimate##0]don't care [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 2227#[$Ultimate##0, L99, L78-1, $Ultimate##0]don't care [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 2215#[$Ultimate##0, L99, L78-1, $Ultimate##0]don't care [2023-10-12 17:13:49,767 INFO L750 eck$LassoCheckResult]: Loop: 2215#[$Ultimate##0, L99, L78-1, $Ultimate##0]don't care [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 2215#[$Ultimate##0, L99, L78-1, $Ultimate##0]don't care [2023-10-12 17:13:49,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,767 INFO L85 PathProgramCache]: Analyzing trace with hash -267704302, now seen corresponding path program 1 times [2023-10-12 17:13:49,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87210319] [2023-10-12 17:13:49,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:49,783 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:49,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:49,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87210319] [2023-10-12 17:13:49,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87210319] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:49,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:49,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:13:49,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143417669] [2023-10-12 17:13:49,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:49,784 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:13:49,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash 201, now seen corresponding path program 1 times [2023-10-12 17:13:49,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985627676] [2023-10-12 17:13:49,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:49,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-10-12 17:13:49,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-10-12 17:13:49,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:49,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:13:49,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:13:49,872 INFO L87 Difference]: Start difference. First operand 134 states and 419 transitions. cyclomatic complexity: 323 Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:49,891 INFO L93 Difference]: Finished difference Result 129 states and 336 transitions. [2023-10-12 17:13:49,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 336 transitions. [2023-10-12 17:13:49,892 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 15 [2023-10-12 17:13:49,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 97 states and 251 transitions. [2023-10-12 17:13:49,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2023-10-12 17:13:49,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2023-10-12 17:13:49,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 251 transitions. [2023-10-12 17:13:49,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:49,893 INFO L219 hiAutomatonCegarLoop]: Abstraction has 97 states and 251 transitions. [2023-10-12 17:13:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 251 transitions. [2023-10-12 17:13:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-10-12 17:13:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 2.5876288659793816) internal successors, (251), 96 states have internal predecessors, (251), 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:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 251 transitions. [2023-10-12 17:13:49,896 INFO L241 hiAutomatonCegarLoop]: Abstraction has 97 states and 251 transitions. [2023-10-12 17:13:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:13:49,900 INFO L430 stractBuchiCegarLoop]: Abstraction has 97 states and 251 transitions. [2023-10-12 17:13:49,900 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:13:49,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 251 transitions. [2023-10-12 17:13:49,900 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 15 [2023-10-12 17:13:49,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:49,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:49,900 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:49,900 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:49,901 INFO L748 eck$LassoCheckResult]: Stem: 2588#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 2492#[L97]don't care [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 2494#[$Ultimate##0, L97-1]don't care [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 2480#[L34-1, L97-1]don't care [168] L34-1-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_22 v_q1_back_38) 0) (<= v_N_12 v_i_20)) InVars {q1=v_q1_22, N=v_N_12, i=v_i_20, q1_back=v_q1_back_38} OutVars{q1=v_q1_22, N=v_N_12, i=v_i_20, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back] 2484#[thread1EXIT, L97-1]don't care [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2548#[L98, $Ultimate##0, thread1EXIT]don't care [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 2508#[thread1EXIT, $Ultimate##0, L99, $Ultimate##0]don't care [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 2504#[thread1EXIT, L99, $Ultimate##0, L58-1]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 2562#[thread1EXIT, L99, $Ultimate##0, L58-1]don't care [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 2650#[thread1EXIT, L99, L78-1, L58-1]don't care [2023-10-12 17:13:49,901 INFO L750 eck$LassoCheckResult]: Loop: 2650#[thread1EXIT, L99, L78-1, L58-1]don't care [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 2650#[thread1EXIT, L99, L78-1, L58-1]don't care [2023-10-12 17:13:49,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,901 INFO L85 PathProgramCache]: Analyzing trace with hash -299985311, now seen corresponding path program 1 times [2023-10-12 17:13:49,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179693157] [2023-10-12 17:13:49,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:49,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,910 INFO L85 PathProgramCache]: Analyzing trace with hash 201, now seen corresponding path program 2 times [2023-10-12 17:13:49,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740352436] [2023-10-12 17:13:49,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:49,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash -709609879, now seen corresponding path program 1 times [2023-10-12 17:13:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868461873] [2023-10-12 17:13:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:50,156 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:50,157 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:50,157 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:50,157 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:50,157 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:50,157 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,158 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:50,158 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:50,158 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:13:50,158 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:50,158 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:50,163 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:50,165 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:50,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:50,252 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:50,254 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:50,255 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:50,258 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:50,260 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:50,261 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:50,263 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:50,265 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:50,498 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:50,498 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:50,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,499 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:13:50,504 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:13:50,504 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:50,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:50,536 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:13:50,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,538 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:13:50,541 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:13:50,541 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:50,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,548 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:13:50,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,576 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:13:50,577 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:13:50,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:50,635 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:13:50,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,636 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:13:50,677 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:13:50,677 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:50,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:50,707 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:13:50,707 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:13:50,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,721 INFO L229 MonitoredProcess]: Starting monitored process 24 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:50,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:13:50,777 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:50,794 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:50,795 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:50,795 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2023-10-12 17:13:50,813 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:13:50,816 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:13:50,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:50,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:50,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:50,850 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:50,850 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:50,850 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 251 transitions. cyclomatic complexity: 177 Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:13:50,879 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 251 transitions. cyclomatic complexity: 177. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 209 states and 542 transitions. Complement of second has 5 states. [2023-10-12 17:13:50,879 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:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:13:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2023-10-12 17:13:50,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:13:50,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:50,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:13:50,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:50,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:13:50,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:50,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 542 transitions. [2023-10-12 17:13:50,881 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 23 [2023-10-12 17:13:50,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 157 states and 416 transitions. [2023-10-12 17:13:50,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2023-10-12 17:13:50,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2023-10-12 17:13:50,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 416 transitions. [2023-10-12 17:13:50,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:50,883 INFO L219 hiAutomatonCegarLoop]: Abstraction has 157 states and 416 transitions. [2023-10-12 17:13:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 416 transitions. [2023-10-12 17:13:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 115. [2023-10-12 17:13:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 2.782608695652174) internal successors, (320), 114 states have internal predecessors, (320), 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:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 320 transitions. [2023-10-12 17:13:50,886 INFO L241 hiAutomatonCegarLoop]: Abstraction has 115 states and 320 transitions. [2023-10-12 17:13:50,886 INFO L430 stractBuchiCegarLoop]: Abstraction has 115 states and 320 transitions. [2023-10-12 17:13:50,886 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:13:50,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 320 transitions. [2023-10-12 17:13:50,887 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 19 [2023-10-12 17:13:50,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:50,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:50,887 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:50,887 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:50,888 INFO L748 eck$LassoCheckResult]: Stem: 3086#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 2958#[L97]don't care [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 2960#[$Ultimate##0, L97-1]don't care [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 2950#[L34-1, L97-1]don't care [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 2952#[L35-1, L97-1]don't care [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3034#[L98, $Ultimate##0, L35-1]don't care [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 3030#[L35-1, $Ultimate##0, L99, $Ultimate##0]don't care [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 3052#[L35-1, L99, $Ultimate##0, L58-1]don't care [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 3000#[L35-1, L99, L78-1, L58-1]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 3002#[L35-1, L99, L78-1, L58-1]don't care [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 3136#[L35-1, L99, L78-1, L58-1]don't care [2023-10-12 17:13:50,888 INFO L750 eck$LassoCheckResult]: Loop: 3136#[L35-1, L99, L78-1, L58-1]don't care [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 3136#[L35-1, L99, L78-1, L58-1]don't care [2023-10-12 17:13:50,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1667789646, now seen corresponding path program 1 times [2023-10-12 17:13:50,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:50,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347773036] [2023-10-12 17:13:50,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:50,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:50,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,900 INFO L85 PathProgramCache]: Analyzing trace with hash 201, now seen corresponding path program 3 times [2023-10-12 17:13:50,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:50,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740681517] [2023-10-12 17:13:50,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:50,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash 161871644, now seen corresponding path program 2 times [2023-10-12 17:13:50,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:50,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329422607] [2023-10-12 17:13:50,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:50,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:50,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:50,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329422607] [2023-10-12 17:13:50,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329422607] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:50,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:50,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:13:50,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675550751] [2023-10-12 17:13:50,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:50,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:51,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:51,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:13:51,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:13:51,014 INFO L87 Difference]: Start difference. First operand 115 states and 320 transitions. cyclomatic complexity: 236 Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:51,053 INFO L93 Difference]: Finished difference Result 204 states and 550 transitions. [2023-10-12 17:13:51,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 550 transitions. [2023-10-12 17:13:51,055 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 39 [2023-10-12 17:13:51,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 187 states and 510 transitions. [2023-10-12 17:13:51,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2023-10-12 17:13:51,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2023-10-12 17:13:51,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 510 transitions. [2023-10-12 17:13:51,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:51,056 INFO L219 hiAutomatonCegarLoop]: Abstraction has 187 states and 510 transitions. [2023-10-12 17:13:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 510 transitions. [2023-10-12 17:13:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 150. [2023-10-12 17:13:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 2.8666666666666667) internal successors, (430), 149 states have internal predecessors, (430), 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:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 430 transitions. [2023-10-12 17:13:51,060 INFO L241 hiAutomatonCegarLoop]: Abstraction has 150 states and 430 transitions. [2023-10-12 17:13:51,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:13:51,061 INFO L430 stractBuchiCegarLoop]: Abstraction has 150 states and 430 transitions. [2023-10-12 17:13:51,061 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:13:51,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 430 transitions. [2023-10-12 17:13:51,062 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 25 [2023-10-12 17:13:51,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:51,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:51,062 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:51,062 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:51,062 INFO L748 eck$LassoCheckResult]: Stem: 3542#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 3402#[L97]don't care [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 3404#[$Ultimate##0, L97-1]don't care [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 3394#[L34-1, L97-1]don't care [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 3396#[L35-1, L97-1]don't care [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3482#[L98, $Ultimate##0, L35-1]don't care [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 3478#[L35-1, $Ultimate##0, L99, $Ultimate##0]don't care [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 3500#[L35-1, L99, $Ultimate##0, L58-1]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 3498#[L35-1, L99, $Ultimate##0, L58-1]don't care [154] L58-1-->thread2EXIT: Formula: (not v_f_5) InVars {f=v_f_5} OutVars{f=v_f_5} AuxVars[] AssignedVars[] 3408#[L35-1, L99, $Ultimate##0, thread2EXIT]don't care [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 3444#[L35-1, L99, L78-1, thread2EXIT]don't care [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 3464#[L35-1, L99, L78-1, thread2EXIT]don't care [2023-10-12 17:13:51,063 INFO L750 eck$LassoCheckResult]: Loop: 3464#[L35-1, L99, L78-1, thread2EXIT]don't care [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 3462#[L99, L34-1, L78-1, thread2EXIT]don't care [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 3464#[L35-1, L99, L78-1, thread2EXIT]don't care [2023-10-12 17:13:51,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:51,063 INFO L85 PathProgramCache]: Analyzing trace with hash 162154798, now seen corresponding path program 1 times [2023-10-12 17:13:51,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:51,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860881829] [2023-10-12 17:13:51,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:51,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:51,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860881829] [2023-10-12 17:13:51,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860881829] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:13:51,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436584998] [2023-10-12 17:13:51,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:51,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:13:51,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:51,114 INFO L229 MonitoredProcess]: Starting monitored process 25 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:51,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-10-12 17:13:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:51,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:13:51,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:51,181 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-10-12 17:13:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:51,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:13:51,207 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-10-12 17:13:51,208 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 10 [2023-10-12 17:13:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:51,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436584998] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:13:51,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:13:51,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-10-12 17:13:51,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681685937] [2023-10-12 17:13:51,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:13:51,212 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:13:51,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:51,212 INFO L85 PathProgramCache]: Analyzing trace with hash 6268, now seen corresponding path program 2 times [2023-10-12 17:13:51,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:51,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775322613] [2023-10-12 17:13:51,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:51,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:51,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:51,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-10-12 17:13:51,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-10-12 17:13:51,255 INFO L87 Difference]: Start difference. First operand 150 states and 430 transitions. cyclomatic complexity: 317 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:51,315 INFO L93 Difference]: Finished difference Result 162 states and 453 transitions. [2023-10-12 17:13:51,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 453 transitions. [2023-10-12 17:13:51,316 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 29 [2023-10-12 17:13:51,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 453 transitions. [2023-10-12 17:13:51,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2023-10-12 17:13:51,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2023-10-12 17:13:51,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 453 transitions. [2023-10-12 17:13:51,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:51,317 INFO L219 hiAutomatonCegarLoop]: Abstraction has 162 states and 453 transitions. [2023-10-12 17:13:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 453 transitions. [2023-10-12 17:13:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2023-10-12 17:13:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 155 states have (on average 2.838709677419355) internal successors, (440), 154 states have internal predecessors, (440), 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:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 440 transitions. [2023-10-12 17:13:51,320 INFO L241 hiAutomatonCegarLoop]: Abstraction has 155 states and 440 transitions. [2023-10-12 17:13:51,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-10-12 17:13:51,321 INFO L430 stractBuchiCegarLoop]: Abstraction has 155 states and 440 transitions. [2023-10-12 17:13:51,321 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:13:51,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 440 transitions. [2023-10-12 17:13:51,322 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 29 [2023-10-12 17:13:51,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:51,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:51,322 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:51,322 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:51,322 INFO L748 eck$LassoCheckResult]: Stem: 4068#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 3936#[L97]don't care [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 3938#[$Ultimate##0, L97-1]don't care [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 3928#[L34-1, L97-1]don't care [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 3930#[L35-1, L97-1]don't care [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 4018#[L98, $Ultimate##0, L35-1]don't care [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 4014#[L35-1, $Ultimate##0, L99, $Ultimate##0]don't care [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 4034#[L35-1, L99, $Ultimate##0, L58-1]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 4036#[L35-1, L99, $Ultimate##0, L58-1]don't care [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 4188#[L35-1, L99, L78-1, L58-1]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 4126#[L35-1, L99, L78-1, L58-1]don't care [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 4116#[L35-1, L99, L78-1, L58-1]don't care [2023-10-12 17:13:51,323 INFO L750 eck$LassoCheckResult]: Loop: 4116#[L35-1, L99, L78-1, L58-1]don't care [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 4116#[L35-1, L99, L78-1, L58-1]don't care [2023-10-12 17:13:51,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 162159913, now seen corresponding path program 3 times [2023-10-12 17:13:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:51,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490787267] [2023-10-12 17:13:51,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:51,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:51,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:51,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490787267] [2023-10-12 17:13:51,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490787267] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:51,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:51,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-10-12 17:13:51,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701814451] [2023-10-12 17:13:51,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:51,351 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:13:51,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:51,351 INFO L85 PathProgramCache]: Analyzing trace with hash 201, now seen corresponding path program 4 times [2023-10-12 17:13:51,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:51,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620267886] [2023-10-12 17:13:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:51,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:51,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:51,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:13:51,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:13:51,407 INFO L87 Difference]: Start difference. First operand 155 states and 440 transitions. cyclomatic complexity: 324 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:51,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:51,442 INFO L93 Difference]: Finished difference Result 164 states and 406 transitions. [2023-10-12 17:13:51,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 406 transitions. [2023-10-12 17:13:51,443 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 55 [2023-10-12 17:13:51,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 129 states and 331 transitions. [2023-10-12 17:13:51,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2023-10-12 17:13:51,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2023-10-12 17:13:51,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 331 transitions. [2023-10-12 17:13:51,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:51,444 INFO L219 hiAutomatonCegarLoop]: Abstraction has 129 states and 331 transitions. [2023-10-12 17:13:51,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 331 transitions. [2023-10-12 17:13:51,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 91. [2023-10-12 17:13:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 2.78021978021978) internal successors, (253), 90 states have internal predecessors, (253), 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:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 253 transitions. [2023-10-12 17:13:51,446 INFO L241 hiAutomatonCegarLoop]: Abstraction has 91 states and 253 transitions. [2023-10-12 17:13:51,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:13:51,447 INFO L430 stractBuchiCegarLoop]: Abstraction has 91 states and 253 transitions. [2023-10-12 17:13:51,447 INFO L337 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-10-12 17:13:51,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 253 transitions. [2023-10-12 17:13:51,447 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 41 [2023-10-12 17:13:51,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:51,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:51,448 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:51,448 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-10-12 17:13:51,448 INFO L748 eck$LassoCheckResult]: Stem: 4472#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 4410#[L97]don't care [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 4412#[$Ultimate##0, L97-1]don't care [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 4404#[L34-1, L97-1]don't care [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 4406#[L35-1, L97-1]don't care [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 4444#[L98, $Ultimate##0, L35-1]don't care [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 4428#[L35-1, $Ultimate##0, L99, $Ultimate##0]don't care [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 4396#[L35-1, L99, $Ultimate##0, L58-1]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 4452#[L35-1, L99, $Ultimate##0, L58-1]don't care [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 4424#[L35-1, L99, L78-1, L58-1]don't care [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 4566#[L35-1, L99, L78-1, L58-1]don't care [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 4568#[L99, L34-1, L78-1, L58-1]don't care [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 4542#[L35-1, L99, L78-1, L58-1]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 4538#[L35-1, L99, L78-1, L58-1]don't care [2023-10-12 17:13:51,448 INFO L750 eck$LassoCheckResult]: Loop: 4538#[L35-1, L99, L78-1, L58-1]don't care [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 4540#[L35-1, L99, L78-1, L58-1]don't care [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 4536#[L99, L34-1, L78-1, L58-1]don't care [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 4554#[L35-1, L99, L78-1, L58-1]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 4538#[L35-1, L99, L78-1, L58-1]don't care [2023-10-12 17:13:51,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1216884844, now seen corresponding path program 1 times [2023-10-12 17:13:51,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:51,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520663354] [2023-10-12 17:13:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:51,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:51,463 INFO L85 PathProgramCache]: Analyzing trace with hash 6152677, now seen corresponding path program 1 times [2023-10-12 17:13:51,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:51,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239799904] [2023-10-12 17:13:51,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:51,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:51,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1865540816, now seen corresponding path program 2 times [2023-10-12 17:13:51,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:51,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013005262] [2023-10-12 17:13:51,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:51,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:52,118 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:52,118 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:52,118 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:52,118 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:52,118 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:52,118 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,118 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:52,119 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:52,119 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_BEv2_Iteration11_Lasso [2023-10-12 17:13:52,119 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:52,119 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:52,121 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:52,123 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:52,124 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:52,128 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:52,130 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:52,332 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:52,335 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:52,336 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:52,896 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:52,896 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:52,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:52,898 INFO L229 MonitoredProcess]: Starting monitored process 26 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:52,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:13:52,913 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:52,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:52,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:52,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:52,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:52,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:52,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:52,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:52,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:52,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:52,943 INFO L229 MonitoredProcess]: Starting monitored process 27 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:52,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:13:52,970 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:52,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:52,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:52,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:52,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:52,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:52,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:52,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:52,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:52,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:52,989 INFO L229 MonitoredProcess]: Starting monitored process 28 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:52,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:13:52,993 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:52,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:52,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:52,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:52,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:53,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:53,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:53,017 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:53,034 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:13:53,034 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:13:53,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:53,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:53,044 INFO L229 MonitoredProcess]: Starting monitored process 29 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:53,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-10-12 17:13:53,069 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:53,087 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:53,087 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:53,087 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:13:53,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:53,107 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2023-10-12 17:13:53,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:53,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:53,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:53,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:53,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:53,168 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:53,169 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-10-12 17:13:53,169 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 253 transitions. cyclomatic complexity: 185 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:53,204 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 253 transitions. cyclomatic complexity: 185. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 198 states and 611 transitions. Complement of second has 6 states. [2023-10-12 17:13:53,204 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:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2023-10-12 17:13:53,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 13 letters. Loop has 4 letters. [2023-10-12 17:13:53,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:53,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 17 letters. Loop has 4 letters. [2023-10-12 17:13:53,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:53,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 13 letters. Loop has 8 letters. [2023-10-12 17:13:53,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:53,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 611 transitions. [2023-10-12 17:13:53,206 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 19 [2023-10-12 17:13:53,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 136 states and 382 transitions. [2023-10-12 17:13:53,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2023-10-12 17:13:53,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2023-10-12 17:13:53,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 382 transitions. [2023-10-12 17:13:53,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:53,208 INFO L219 hiAutomatonCegarLoop]: Abstraction has 136 states and 382 transitions. [2023-10-12 17:13:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 382 transitions. [2023-10-12 17:13:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 101. [2023-10-12 17:13:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 2.8613861386138613) internal successors, (289), 100 states have internal predecessors, (289), 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:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 289 transitions. [2023-10-12 17:13:53,210 INFO L241 hiAutomatonCegarLoop]: Abstraction has 101 states and 289 transitions. [2023-10-12 17:13:53,210 INFO L430 stractBuchiCegarLoop]: Abstraction has 101 states and 289 transitions. [2023-10-12 17:13:53,210 INFO L337 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-10-12 17:13:53,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 289 transitions. [2023-10-12 17:13:53,210 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 19 [2023-10-12 17:13:53,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:53,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:53,211 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:53,211 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:53,211 INFO L748 eck$LassoCheckResult]: Stem: 4968#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 4894#[L97]don't care [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 4896#[$Ultimate##0, L97-1]don't care [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 4888#[L34-1, L97-1]don't care [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 4890#[L35-1, L97-1]don't care [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 4936#[L98, $Ultimate##0, L35-1]don't care [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 4926#[L35-1, $Ultimate##0, L99, $Ultimate##0]don't care [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 4878#[L35-1, L99, $Ultimate##0, L58-1]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 4942#[L35-1, L99, $Ultimate##0, L58-1]don't care [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 4914#[L35-1, L99, L78-1, L58-1]don't care [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 4916#[L35-1, L99, L78-1, L58-1]don't care [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 4964#[L99, L34-1, L78-1, L58-1]don't care [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 4966#[L35-1, L99, L78-1, L58-1]don't care [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 5040#[L99, L34-1, L78-1, L58-1]don't care [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 5042#[L35-1, L99, L78-1, L58-1]don't care [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 5018#[L99, L34-1, L78-1, L58-1]don't care [2023-10-12 17:13:53,211 INFO L750 eck$LassoCheckResult]: Loop: 5018#[L99, L34-1, L78-1, L58-1]don't care [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 5016#[L99, L34-1, L78-1, L58-1]don't care [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 5018#[L99, L34-1, L78-1, L58-1]don't care [2023-10-12 17:13:53,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:53,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1195232846, now seen corresponding path program 3 times [2023-10-12 17:13:53,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:53,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720984867] [2023-10-12 17:13:53,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:53,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:53,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:53,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:53,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720984867] [2023-10-12 17:13:53,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720984867] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:13:53,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136489930] [2023-10-12 17:13:53,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-10-12 17:13:53,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:13:53,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:53,259 INFO L229 MonitoredProcess]: Starting monitored process 30 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:53,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-10-12 17:13:53,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-10-12 17:13:53,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:13:53,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:13:53,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:13:53,327 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:13:53,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136489930] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:53,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:13:53,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-10-12 17:13:53,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533758975] [2023-10-12 17:13:53,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:53,328 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:13:53,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash 6370, now seen corresponding path program 1 times [2023-10-12 17:13:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:53,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35186069] [2023-10-12 17:13:53,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:53,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:53,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:53,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:13:53,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-10-12 17:13:53,461 INFO L87 Difference]: Start difference. First operand 101 states and 289 transitions. cyclomatic complexity: 218 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:53,477 INFO L93 Difference]: Finished difference Result 37 states and 60 transitions. [2023-10-12 17:13:53,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 60 transitions. [2023-10-12 17:13:53,477 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:13:53,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2023-10-12 17:13:53,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:13:53,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:13:53,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:13:53,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:13:53,477 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:53,477 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:13:53,478 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:53,478 INFO L337 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-10-12 17:13:53,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:13:53,478 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:13:53,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:13:53,482 INFO L201 PluginConnector]: Adding new model ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:13:53 BoogieIcfgContainer [2023-10-12 17:13:53,482 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:13:53,482 INFO L158 Benchmark]: Toolchain (without parser) took 7892.12ms. Allocated memory was 160.4MB in the beginning and 284.2MB in the end (delta: 123.7MB). Free memory was 113.5MB in the beginning and 149.7MB in the end (delta: -36.3MB). Peak memory consumption was 88.1MB. Max. memory is 8.0GB. [2023-10-12 17:13:53,483 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 160.4MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:13:53,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.73ms. Allocated memory is still 160.4MB. Free memory was 113.3MB in the beginning and 111.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:13:53,483 INFO L158 Benchmark]: Boogie Preprocessor took 25.48ms. Allocated memory is still 160.4MB. Free memory was 111.9MB in the beginning and 110.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:13:53,483 INFO L158 Benchmark]: RCFGBuilder took 267.86ms. Allocated memory is still 160.4MB. Free memory was 110.6MB in the beginning and 98.9MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-10-12 17:13:53,483 INFO L158 Benchmark]: BuchiAutomizer took 7570.82ms. Allocated memory was 160.4MB in the beginning and 284.2MB in the end (delta: 123.7MB). Free memory was 98.8MB in the beginning and 149.7MB in the end (delta: -50.9MB). Peak memory consumption was 73.5MB. Max. memory is 8.0GB. [2023-10-12 17:13:53,484 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.24ms. Allocated memory is still 160.4MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.73ms. Allocated memory is still 160.4MB. Free memory was 113.3MB in the beginning and 111.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.48ms. Allocated memory is still 160.4MB. Free memory was 111.9MB in the beginning and 110.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 267.86ms. Allocated memory is still 160.4MB. Free memory was 110.6MB in the beginning and 98.9MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 7570.82ms. Allocated memory was 160.4MB in the beginning and 284.2MB in the end (delta: 123.7MB). Free memory was 98.8MB in the beginning and 149.7MB in the end (delta: -50.9MB). Peak memory consumption was 73.5MB. 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 12 terminating modules (7 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. 7 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 6.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 392 StatesRemovedByMinimization, 10 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 [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 226 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 494 IncrementalHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 12 mSDtfsCounter, 494 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU4 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital128 mio100 ax100 hnf100 lsp83 ukn88 mio100 lsp61 div100 bol114 ite100 ukn100 eq176 hnf90 smp100 dnf242 smp58 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 58ms VariablesStem: 4 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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, 46 PlacesBefore, 26 PlacesAfterwards, 39 TransitionsBefore, 19 TransitionsAfterwards, 634 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 21 TotalNumberOfCompositions, 565 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 492, independent: 480, independent conditional: 0, independent unconditional: 480, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 393, independent: 383, independent conditional: 0, independent unconditional: 383, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 393, independent: 378, independent conditional: 0, independent unconditional: 378, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 492, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 393, unknown conditional: 0, unknown unconditional: 393] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, 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:13:53,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:53,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:53,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:54,108 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...