/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_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-series.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:25:55,431 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:25:55,480 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:25:55,500 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:25:55,501 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:25:55,501 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:25:55,502 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:25:55,503 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:25:55,503 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:25:55,503 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:25:55,504 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:25:55,504 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:25:55,504 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:25:55,505 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:25:55,505 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:25:55,505 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:25:55,506 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:25:55,506 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:25:55,506 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:25:55,507 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:25:55,507 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:25:55,507 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:25:55,508 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:25:55,508 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:25:55,508 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:25:55,508 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:25:55,509 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:25:55,509 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:25:55,509 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:25:55,509 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:25:55,510 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:25:55,510 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:25:55,510 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:25:55,511 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:25:55,511 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_PETRI_NET [2023-10-12 17:25:55,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:25:55,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:25:55,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:25:55,754 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:25:55,755 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:25:55,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-series.wvr.bpl [2023-10-12 17:25:55,757 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-series.wvr.bpl' [2023-10-12 17:25:55,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:25:55,791 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:25:55,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:25:55,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:25:55,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:25:55,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:55" (1/1) ... [2023-10-12 17:25:55,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:55" (1/1) ... [2023-10-12 17:25:55,816 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:25:55,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:25:55,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:25:55,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:25:55,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:25:55,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:55" (1/1) ... [2023-10-12 17:25:55,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:55" (1/1) ... [2023-10-12 17:25:55,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:55" (1/1) ... [2023-10-12 17:25:55,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:55" (1/1) ... [2023-10-12 17:25:55,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:55" (1/1) ... [2023-10-12 17:25:55,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:55" (1/1) ... [2023-10-12 17:25:55,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:55" (1/1) ... [2023-10-12 17:25:55,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:55" (1/1) ... [2023-10-12 17:25:55,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:25:55,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:25:55,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:25:55,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:25:55,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:55" (1/1) ... [2023-10-12 17:25:55,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:55,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:55,874 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:25:55,900 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:25:55,915 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:25:55,916 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:25:55,916 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:25:55,916 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:25:55,916 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:25:55,916 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:25:55,916 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:25:55,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:25:55,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:25:55,917 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:25:55,917 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:25:55,918 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:25:55,918 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:25:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:25:55,918 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:25:55,919 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:25:55,966 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:25:55,967 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:25:56,081 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:25:56,101 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:25:56,102 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:25:56,104 INFO L201 PluginConnector]: Adding new model buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:25:56 BoogieIcfgContainer [2023-10-12 17:25:56,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:25:56,105 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:25:56,105 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:25:56,108 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:25:56,109 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:25:56,109 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:55" (1/2) ... [2023-10-12 17:25:56,110 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19fc74c2 and model type buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:25:56, skipping insertion in model container [2023-10-12 17:25:56,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:25:56,110 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:25:56" (2/2) ... [2023-10-12 17:25:56,111 INFO L332 chiAutomizerObserver]: Analyzing ICFG buffer-series.wvr.bpl [2023-10-12 17:25:56,190 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:25:56,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:25:56,248 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:25:56,249 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:25:56,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 55 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:25:56,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:25:56,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2023-10-12 17:25:56,259 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:25:56,272 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:25:56,275 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:25:56,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 86 flow [2023-10-12 17:25:56,283 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:25:56,283 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:25:56,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 55 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:25:56,284 INFO L119 LiptonReduction]: Number of co-enabled transitions 350 [2023-10-12 17:25:56,515 INFO L134 LiptonReduction]: Checked pairs total: 505 [2023-10-12 17:25:56,515 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:25:56,526 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:25:56,526 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:25:56,526 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:25:56,526 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:25:56,526 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:25:56,526 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:25:56,526 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:25:56,527 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:25:56,527 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:25:56,531 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:56,531 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:25:56,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:25:56,531 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:56,539 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:25:56,539 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:25:56,542 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:56,542 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:25:56,542 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:25:56,542 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:56,546 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [2023-10-12 17:25:56,546 INFO L750 eck$LassoCheckResult]: Loop: 52#[L73-1, L24]true [126] L24-->L25-1: Formula: (and (= (select v_q1_17 v_q1_back_35) (select v_f_15 v_i_25)) (= (+ 1 v_q1_back_35) v_q1_back_34) (< v_i_25 v_N_24)) InVars {q1=v_q1_17, N=v_N_24, i=v_i_25, f=v_f_15, q1_back=v_q1_back_35} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_25, f=v_f_15, q1_back=v_q1_back_34} AuxVars[] AssignedVars[q1_back] 55#[L73-1, L25-1]true [90] L25-1-->L24: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i] 52#[L73-1, L24]true [2023-10-12 17:25:56,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:56,551 INFO L85 PathProgramCache]: Analyzing trace with hash 3578, now seen corresponding path program 1 times [2023-10-12 17:25:56,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:56,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245467991] [2023-10-12 17:25:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:56,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:56,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:56,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:56,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:56,640 INFO L85 PathProgramCache]: Analyzing trace with hash 4957, now seen corresponding path program 1 times [2023-10-12 17:25:56,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:56,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399992187] [2023-10-12 17:25:56,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:56,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:56,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:56,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:56,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:56,695 INFO L85 PathProgramCache]: Analyzing trace with hash 3442454, now seen corresponding path program 1 times [2023-10-12 17:25:56,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:56,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005224063] [2023-10-12 17:25:56,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:56,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:56,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:56,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:56,791 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:56,791 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:56,791 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:56,792 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:56,792 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:56,792 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:56,792 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:56,792 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:56,792 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-series.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:25:56,792 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:56,792 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:56,805 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:25:56,813 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:25:56,832 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:56,835 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:25:56,838 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:25:56,921 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:56,924 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:56,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:56,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:56,931 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:25:56,938 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:25:56,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:56,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:56,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:56,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:56,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:56,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:56,954 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:25:56,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:56,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:25:56,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:56,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:56,974 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:25:56,982 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:25:56,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:56,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:56,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:56,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:56,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:56,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:57,005 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:25:57,012 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:57,024 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:25:57,025 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:25:57,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:57,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:57,059 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:25:57,060 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:25:57,062 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:57,088 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:25:57,089 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:57,089 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:25:57,095 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:25:57,098 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:25:57,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:57,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:25:57,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:57,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:57,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:57,180 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:25:57,214 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:25:57,216 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:57,375 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 370 transitions. [2023-10-12 17:25:57,377 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:25:57,382 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:25:57,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:25:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-10-12 17:25:57,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:25:57,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:57,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:25:57,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:57,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:25:57,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:57,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:57,575 INFO L124 PetriNetUnfolderBase]: 1684/2258 cut-off events. [2023-10-12 17:25:57,576 INFO L125 PetriNetUnfolderBase]: For 395/395 co-relation queries the response was YES. [2023-10-12 17:25:57,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4958 conditions, 2258 events. 1684/2258 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8629 event pairs, 261 based on Foata normal form. 0/1441 useless extension candidates. Maximal degree in co-relation 3866. Up to 568 conditions per place. [2023-10-12 17:25:57,581 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:57,586 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:57,586 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:57,587 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:25:57,587 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:57,591 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:57,591 INFO L124 PetriNetUnfolderBase]: 25/44 cut-off events. [2023-10-12 17:25:57,592 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-10-12 17:25:57,592 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:57,592 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [109] L73-1-->L36: 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] 109#[L36, L74, L24]true [2023-10-12 17:25:57,592 INFO L750 eck$LassoCheckResult]: Loop: 109#[L36, L74, L24]true [121] L36-->L37-1: Formula: (and (= (+ (select v_q2_9 v_q2_back_15) (select v_f_7 v_j_13)) 0) (< v_j_13 v_N_12) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_13, f=v_f_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_13, f=v_f_7} AuxVars[] AssignedVars[q2_back] 112#[L74, L37-1, L24]true [95] L37-1-->L36: Formula: (= v_j_4 (+ v_j_5 1)) InVars {j=v_j_5} OutVars{j=v_j_4} AuxVars[] AssignedVars[j] 109#[L36, L74, L24]true [2023-10-12 17:25:57,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:57,593 INFO L85 PathProgramCache]: Analyzing trace with hash 111027, now seen corresponding path program 1 times [2023-10-12 17:25:57,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:57,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577125671] [2023-10-12 17:25:57,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:57,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:57,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:57,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:57,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash 4807, now seen corresponding path program 1 times [2023-10-12 17:25:57,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:57,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913526918] [2023-10-12 17:25:57,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:57,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:57,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:57,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:57,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash 106700793, now seen corresponding path program 1 times [2023-10-12 17:25:57,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:57,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095614074] [2023-10-12 17:25:57,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:57,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:57,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:57,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:57,665 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:25:57,730 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:57,730 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:57,730 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:57,730 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:57,730 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:57,730 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:57,730 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:57,730 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:57,731 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-series.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:25:57,731 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:57,731 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:57,732 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:57,735 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:25:57,737 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:25:57,739 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:25:57,753 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:57,755 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:25:57,757 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:25:57,843 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:57,843 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:57,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:57,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:57,845 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:25:57,853 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:25:57,855 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:25:57,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:57,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:57,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:57,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:57,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:57,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:57,885 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:57,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:57,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:57,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:57,893 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:25:57,895 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:25:57,897 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:25:57,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:57,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:57,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:57,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:57,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:57,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:57,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:57,933 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:25:57,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:57,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:57,935 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:25:57,949 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:25:57,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:57,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:57,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:57,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:57,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:57,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:57,965 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:25:57,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:57,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:57,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:57,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:57,993 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:25:58,003 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:25:58,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:58,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:25:58,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:58,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:58,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:58,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:25:58,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:25:58,015 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:25:58,018 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:58,021 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:25:58,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:58,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:58,023 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:25:58,037 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:25:58,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:58,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:58,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:58,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:58,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:58,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:58,055 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:25:58,072 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:58,078 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:25:58,078 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:25:58,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:58,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:58,080 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:25:58,094 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:58,102 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:25:58,113 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:25:58,114 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:58,114 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, N) = -1*j + 1*N Supporting invariants [] [2023-10-12 17:25:58,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:25:58,119 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:25:58,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:58,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:25:58,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:58,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:58,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:58,163 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:25:58,163 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:25:58,164 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:58,330 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 370 transitions. [2023-10-12 17:25:58,331 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:25:58,374 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:25:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:25:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:58,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-10-12 17:25:58,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:25:58,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:58,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:25:58,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:58,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:25:58,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:58,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:58,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:59,303 INFO L124 PetriNetUnfolderBase]: 5333/7066 cut-off events. [2023-10-12 17:25:59,303 INFO L125 PetriNetUnfolderBase]: For 1269/1269 co-relation queries the response was YES. [2023-10-12 17:25:59,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22518 conditions, 7066 events. 5333/7066 cut-off events. For 1269/1269 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 30942 event pairs, 304 based on Foata normal form. 0/4051 useless extension candidates. Maximal degree in co-relation 17407. Up to 1825 conditions per place. [2023-10-12 17:25:59,310 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:59,375 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:59,375 INFO L430 stractBuchiCegarLoop]: Abstraction has has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:59,375 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:25:59,376 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:59,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:59,441 INFO L124 PetriNetUnfolderBase]: 219/321 cut-off events. [2023-10-12 17:25:59,441 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-10-12 17:25:59,441 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:59,443 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [126] L24-->L25-1: Formula: (and (= (select v_q1_17 v_q1_back_35) (select v_f_15 v_i_25)) (= (+ 1 v_q1_back_35) v_q1_back_34) (< v_i_25 v_N_24)) InVars {q1=v_q1_17, N=v_N_24, i=v_i_25, f=v_f_15, q1_back=v_q1_back_35} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_25, f=v_f_15, q1_back=v_q1_back_34} AuxVars[] AssignedVars[q1_back] 55#[L73-1, L25-1]true [109] L73-1-->L36: 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] 164#[L36, L74, L25-1]true [112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 166#[L75, L36, L25-1, L49-1]true [2023-10-12 17:25:59,443 INFO L750 eck$LassoCheckResult]: Loop: 166#[L75, L36, L25-1, L49-1]true [97] L49-1-->L49: Formula: (or (< v_i_7 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 169#[L49, L75, L36, L25-1]true [99] L49-->L49-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (+ (select v_q1_7 v_q1_front_11) v_total_16) v_total_15) (< v_q1_front_11 v_q1_back_14)) InVars {q1_front=v_q1_front_11, q1=v_q1_7, total=v_total_16, q1_back=v_q1_back_14} OutVars{q1_front=v_q1_front_10, q1=v_q1_7, total=v_total_15, q1_back=v_q1_back_14} AuxVars[] AssignedVars[q1_front, total] 166#[L75, L36, L25-1, L49-1]true [2023-10-12 17:25:59,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:59,444 INFO L85 PathProgramCache]: Analyzing trace with hash 106716775, now seen corresponding path program 1 times [2023-10-12 17:25:59,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:59,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374624831] [2023-10-12 17:25:59,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:59,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:59,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:59,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:59,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2023-10-12 17:25:59,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:59,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105544325] [2023-10-12 17:25:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:59,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:59,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:59,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash -524391223, now seen corresponding path program 1 times [2023-10-12 17:25:59,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:59,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52981700] [2023-10-12 17:25:59,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:59,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:59,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:59,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:59,637 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:59,637 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:59,637 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:59,638 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:59,638 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:59,638 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:59,638 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:59,638 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:59,638 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-series.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:25:59,638 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:59,638 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:59,640 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:25:59,642 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:25:59,661 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:25:59,664 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:25:59,666 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:25:59,668 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:59,671 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:59,673 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:25:59,675 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:25:59,678 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:59,680 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:25:59,801 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:59,801 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:59,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:59,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:59,805 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:25:59,819 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:25:59,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:59,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:59,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:59,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:59,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:59,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:59,832 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:25:59,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:59,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:59,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:59,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:59,846 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:25:59,856 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:25:59,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:59,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:59,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:59,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:59,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:59,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:59,874 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:25:59,878 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:59,885 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:25:59,885 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:25:59,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:59,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:59,893 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:25:59,897 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:25:59,899 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:59,929 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:25:59,929 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:59,929 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:25:59,936 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:25:59,937 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:25:59,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:59,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:25:59,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:59,971 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:59,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:59,975 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:25:59,975 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:25:59,976 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:26:00,038 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 324 transitions. [2023-10-12 17:26:00,038 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:26:00,604 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:26:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:26:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:26:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:26:00,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:26:00,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:00,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:26:00,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:00,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:26:00,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:00,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 75112 transitions, 686912 flow [2023-10-12 17:26:00,633 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:26:28,914 INFO L124 PetriNetUnfolderBase]: 17454/22962 cut-off events. [2023-10-12 17:26:28,915 INFO L125 PetriNetUnfolderBase]: For 4080/4080 co-relation queries the response was YES. [2023-10-12 17:26:28,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95921 conditions, 22962 events. 17454/22962 cut-off events. For 4080/4080 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 117195 event pairs, 344 based on Foata normal form. 0/12654 useless extension candidates. Maximal degree in co-relation 71476. Up to 6452 conditions per place. [2023-10-12 17:26:28,935 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 72 places, 75112 transitions, 686912 flow [2023-10-12 17:26:29,550 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 72 places, 75112 transitions, 686912 flow [2023-10-12 17:26:29,550 INFO L430 stractBuchiCegarLoop]: Abstraction has has 72 places, 75112 transitions, 686912 flow [2023-10-12 17:26:29,550 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:26:29,551 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 72 places, 75112 transitions, 686912 flow [2023-10-12 17:26:32,662 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:32,662 INFO L124 PetriNetUnfolderBase]: 1225/1641 cut-off events. [2023-10-12 17:26:32,662 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2023-10-12 17:26:32,662 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:32,663 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [126] L24-->L25-1: Formula: (and (= (select v_q1_17 v_q1_back_35) (select v_f_15 v_i_25)) (= (+ 1 v_q1_back_35) v_q1_back_34) (< v_i_25 v_N_24)) InVars {q1=v_q1_17, N=v_N_24, i=v_i_25, f=v_f_15, q1_back=v_q1_back_35} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_25, f=v_f_15, q1_back=v_q1_back_34} AuxVars[] AssignedVars[q1_back] 55#[L73-1, L25-1]true [109] L73-1-->L36: 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] 164#[L36, L74, L25-1]true [112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 166#[L75, L36, L25-1, L49-1]true [90] L25-1-->L24: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i] 225#[L75, L36, L24, L49-1]true [115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 227#[L36, L24, L76, L61-1, L49-1]true [101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_7 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_7, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_7, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 229#[L36, L61, L24, L76, L49-1]true [2023-10-12 17:26:32,663 INFO L750 eck$LassoCheckResult]: Loop: 229#[L36, L61, L24, L76, L49-1]true [103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front] 227#[L36, L24, L76, L61-1, L49-1]true [101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_7 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_7, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_7, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 229#[L36, L61, L24, L76, L49-1]true [2023-10-12 17:26:32,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash 923735141, now seen corresponding path program 1 times [2023-10-12 17:26:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:32,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822562403] [2023-10-12 17:26:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:32,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:32,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:32,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:32,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:32,690 INFO L85 PathProgramCache]: Analyzing trace with hash 4255, now seen corresponding path program 1 times [2023-10-12 17:26:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:32,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014772947] [2023-10-12 17:26:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:32,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:32,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:32,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:32,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:32,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1348756477, now seen corresponding path program 1 times [2023-10-12 17:26:32,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:32,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836871135] [2023-10-12 17:26:32,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:32,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:32,743 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:26:32,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:26:32,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836871135] [2023-10-12 17:26:32,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836871135] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:26:32,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:26:32,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:26:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289742158] [2023-10-12 17:26:32,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:26:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:26:32,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:26:32,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:26:32,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75112 transitions, 686912 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) 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:26:32,780 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:26:32,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:28:18,513 INFO L124 PetriNetUnfolderBase]: 24544/32609 cut-off events. [2023-10-12 17:28:18,513 INFO L125 PetriNetUnfolderBase]: For 5705/5705 co-relation queries the response was YES. [2023-10-12 17:28:18,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169019 conditions, 32609 events. 24544/32609 cut-off events. For 5705/5705 co-relation queries the response was YES. Maximal size of possible extension queue 1514. Compared 174617 event pairs, 351 based on Foata normal form. 681/18569 useless extension candidates. Maximal degree in co-relation 125614. Up to 24179 conditions per place. [2023-10-12 17:28:18,720 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 2729 selfloop transitions, 118 changer transitions 1093/3940 dead transitions. [2023-10-12 17:28:18,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 3940 transitions, 42016 flow [2023-10-12 17:28:18,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 3940 transitions, 42016 flow [2023-10-12 17:28:23,525 INFO L124 PetriNetUnfolderBase]: 24544/32609 cut-off events. [2023-10-12 17:28:23,525 INFO L125 PetriNetUnfolderBase]: For 5705/5705 co-relation queries the response was YES. [2023-10-12 17:28:23,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169019 conditions, 32609 events. 24544/32609 cut-off events. For 5705/5705 co-relation queries the response was YES. Maximal size of possible extension queue 1514. Compared 174582 event pairs, 351 based on Foata normal form. 0/17888 useless extension candidates. Maximal degree in co-relation 125614. Up to 24179 conditions per place. [2023-10-12 17:28:23,551 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 68 places, 3940 transitions, 42016 flow [2023-10-12 17:28:23,587 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 68 places, 3940 transitions, 42016 flow [2023-10-12 17:28:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:28:23,588 INFO L430 stractBuchiCegarLoop]: Abstraction has has 68 places, 3940 transitions, 42016 flow [2023-10-12 17:28:23,588 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:28:23,588 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 68 places, 3940 transitions, 42016 flow [2023-10-12 17:28:23,944 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:28:23,945 INFO L124 PetriNetUnfolderBase]: 1576/2132 cut-off events. [2023-10-12 17:28:23,945 INFO L125 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2023-10-12 17:28:23,945 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:28:23,945 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [109] L73-1-->L36: 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] 109#[L36, L74, L24]true [126] L24-->L25-1: Formula: (and (= (select v_q1_17 v_q1_back_35) (select v_f_15 v_i_25)) (= (+ 1 v_q1_back_35) v_q1_back_34) (< v_i_25 v_N_24)) InVars {q1=v_q1_17, N=v_N_24, i=v_i_25, f=v_f_15, q1_back=v_q1_back_35} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_25, f=v_f_15, q1_back=v_q1_back_34} AuxVars[] AssignedVars[q1_back] 164#[L36, L74, L25-1]true [112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 166#[L75, L36, L25-1, L49-1]true [90] L25-1-->L24: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i] 225#[L75, L36, L24, L49-1]true [126] L24-->L25-1: Formula: (and (= (select v_q1_17 v_q1_back_35) (select v_f_15 v_i_25)) (= (+ 1 v_q1_back_35) v_q1_back_34) (< v_i_25 v_N_24)) InVars {q1=v_q1_17, N=v_N_24, i=v_i_25, f=v_f_15, q1_back=v_q1_back_35} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_25, f=v_f_15, q1_back=v_q1_back_34} AuxVars[] AssignedVars[q1_back] 166#[L75, L36, L25-1, L49-1]true [97] L49-1-->L49: Formula: (or (< v_i_7 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 169#[L49, L75, L36, L25-1]true [2023-10-12 17:28:23,946 INFO L750 eck$LassoCheckResult]: Loop: 169#[L49, L75, L36, L25-1]true [99] L49-->L49-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (+ (select v_q1_7 v_q1_front_11) v_total_16) v_total_15) (< v_q1_front_11 v_q1_back_14)) InVars {q1_front=v_q1_front_11, q1=v_q1_7, total=v_total_16, q1_back=v_q1_back_14} OutVars{q1_front=v_q1_front_10, q1=v_q1_7, total=v_total_15, q1_back=v_q1_back_14} AuxVars[] AssignedVars[q1_front, total] 166#[L75, L36, L25-1, L49-1]true [97] L49-1-->L49: Formula: (or (< v_i_7 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 169#[L49, L75, L36, L25-1]true [2023-10-12 17:28:23,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:23,946 INFO L85 PathProgramCache]: Analyzing trace with hash 452739768, now seen corresponding path program 1 times [2023-10-12 17:28:23,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:23,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328558300] [2023-10-12 17:28:23,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:23,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:23,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:23,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:23,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash 4127, now seen corresponding path program 2 times [2023-10-12 17:28:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:23,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496824542] [2023-10-12 17:28:23,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:23,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:23,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:23,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:23,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1291223318, now seen corresponding path program 1 times [2023-10-12 17:28:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:23,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962405204] [2023-10-12 17:28:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:23,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:23,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:24,174 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:28:24,174 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:28:24,174 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:28:24,175 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:28:24,175 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:28:24,175 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:24,175 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:28:24,175 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:28:24,175 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-series.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:28:24,175 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:28:24,175 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:28:24,179 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:28:24,182 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:28:24,184 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:28:24,186 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:28:24,188 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:28:24,190 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:28:24,192 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:28:24,229 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:28:24,232 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:28:24,392 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:28:24,392 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:28:24,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:24,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:24,398 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:28:24,400 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:28:24,405 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:28:24,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:24,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:24,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:28:24,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:24,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:28:24,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:28:24,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:28:24,443 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:28:24,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:24,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:24,445 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:28:24,451 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:28:24,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:24,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:24,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:28:24,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:24,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:28:24,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:28:24,464 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:28:24,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:28:24,482 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:28:24,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:24,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:24,484 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:28:24,491 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:28:24,495 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:28:24,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:24,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:24,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:28:24,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:24,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:28:24,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:28:24,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:28:24,521 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:28:24,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:24,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:24,523 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:28:24,526 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:28:24,528 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:28:24,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:24,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:24,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:28:24,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:24,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:28:24,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:28:24,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:28:24,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:28:24,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:24,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:24,570 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:28:24,573 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:28:24,574 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:28:24,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:24,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:24,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:28:24,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:24,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:28:24,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:28:24,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:28:24,592 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:28:24,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:24,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:24,594 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:28:24,594 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:28:24,597 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:28:24,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:24,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:24,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:28:24,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:24,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:28:24,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:28:24,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:28:24,615 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:28:24,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:24,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:24,616 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:28:24,619 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:28:24,620 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:28:24,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:24,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:24,627 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:28:24,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:24,635 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:28:24,635 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:28:24,655 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:28:24,674 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:28:24,674 INFO L444 ModelExtractionUtils]: 7 out of 26 variables were initially zero. Simplification set additionally 16 variables to zero. [2023-10-12 17:28:24,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:24,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:24,679 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:28:24,680 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:28:24,681 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:28:24,692 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2023-10-12 17:28:24,693 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:28:24,693 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:28:24,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:28:24,704 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:28:24,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:24,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:28:24,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:24,744 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:28:24,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:24,766 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:28:24,767 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:28:24,767 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:28:24,823 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 324 transitions. [2023-10-12 17:28:24,824 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:28:25,153 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:28:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:28:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:28:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:28:25,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:28:25,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:25,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:28:25,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:25,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:28:25,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:25,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 53744 transitions, 681552 flow [2023-10-12 17:28:28,984 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 Received shutdown request... [2023-10-12 17:30:30,421 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:30:30,467 WARN L144 chiPetriNetCegarLoop]: Unhandled de.uni_freiburg.informatik.ultimate.automata.AutomataOperationCanceledException: Timeout or canceled by user.occured during abstraction size reduction. Continuing with non-reduced net [2023-10-12 17:30:30,467 INFO L430 stractBuchiCegarLoop]: Abstraction has has 80 places, 53744 transitions, 681552 flow [2023-10-12 17:30:30,467 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:30:30,467 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 80 places, 53744 transitions, 681552 flow [2023-10-12 17:30:30,483 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:30:30,488 INFO L201 PluginConnector]: Adding new model buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:30:30 BoogieIcfgContainer [2023-10-12 17:30:30,488 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:30:30,489 INFO L158 Benchmark]: Toolchain (without parser) took 274697.43ms. Allocated memory was 215.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 166.4MB in the beginning and 1.1GB in the end (delta: -939.1MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2023-10-12 17:30:30,489 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.31ms. Allocated memory is still 215.0MB. Free memory was 167.6MB in the beginning and 167.5MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:30:30,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.00ms. Allocated memory is still 215.0MB. Free memory was 166.3MB in the beginning and 164.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:30,490 INFO L158 Benchmark]: Boogie Preprocessor took 25.88ms. Allocated memory is still 215.0MB. Free memory was 164.8MB in the beginning and 163.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:30:30,490 INFO L158 Benchmark]: RCFGBuilder took 259.62ms. Allocated memory is still 215.0MB. Free memory was 163.6MB in the beginning and 152.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:30:30,491 INFO L158 Benchmark]: BuchiAutomizer took 274383.30ms. Allocated memory was 215.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 152.3MB in the beginning and 1.1GB in the end (delta: -953.1MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2023-10-12 17:30:30,492 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.31ms. Allocated memory is still 215.0MB. Free memory was 167.6MB in the beginning and 167.5MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.00ms. Allocated memory is still 215.0MB. Free memory was 166.3MB in the beginning and 164.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.88ms. Allocated memory is still 215.0MB. Free memory was 164.8MB in the beginning and 163.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 259.62ms. Allocated memory is still 215.0MB. Free memory was 163.6MB in the beginning and 152.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 274383.30ms. Allocated memory was 215.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 152.3MB in the beginning and 1.1GB in the end (delta: -953.1MB). Peak memory consumption was 2.6GB. 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 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function N + -1 * j and consists of 5 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 4 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 681552 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 274.2s and 6 iterations. TraceHistogramMax:0. Analysis of lassos took 2.4s. Construction of modules took 0.3s. Büchi inclusion checks took 112.1s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 435 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 431 mSDsluCounter, 363 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 468 IncrementalHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 218 mSDtfsCounter, 468 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital60 mio100 ax100 hnf100 lsp65 ukn87 mio100 lsp59 div100 bol100 ite100 ukn100 eq171 hnf91 smp100 dnf106 smp98 tf100 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 77ms VariablesStem: 6 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderBuchi. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 40 PlacesBefore, 32 PlacesAfterwards, 31 TransitionsBefore, 23 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 505 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 388, independent: 366, independent conditional: 0, independent unconditional: 366, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 219, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 219, independent: 201, independent conditional: 0, independent unconditional: 201, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 388, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 219, unknown conditional: 0, unknown unconditional: 219] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown