/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-mult.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:25:49,206 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:25:49,264 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:49,290 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:25:49,290 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:25:49,291 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:25:49,292 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:25:49,292 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:25:49,292 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:25:49,295 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:25:49,295 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:25:49,295 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:25:49,295 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:25:49,296 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:25:49,297 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:25:49,297 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:25:49,297 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:25:49,297 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:25:49,297 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:25:49,298 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:25:49,298 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:25:49,298 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:25:49,299 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:25:49,299 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:25:49,299 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:25:49,299 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:25:49,300 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:25:49,300 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:25:49,300 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:25:49,300 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:25:49,301 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:25:49,301 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:25:49,301 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:25:49,302 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:25:49,302 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:49,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:25:49,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:25:49,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:25:49,511 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:25:49,512 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:25:49,513 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-mult.wvr.bpl [2023-10-12 17:25:49,513 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-mult.wvr.bpl' [2023-10-12 17:25:49,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:25:49,546 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:25:49,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:25:49,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:25:49,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:25:49,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:49" (1/1) ... [2023-10-12 17:25:49,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:49" (1/1) ... [2023-10-12 17:25:49,579 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:25:49,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:25:49,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:25:49,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:25:49,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:25:49,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:49" (1/1) ... [2023-10-12 17:25:49,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:49" (1/1) ... [2023-10-12 17:25:49,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:49" (1/1) ... [2023-10-12 17:25:49,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:49" (1/1) ... [2023-10-12 17:25:49,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:49" (1/1) ... [2023-10-12 17:25:49,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:49" (1/1) ... [2023-10-12 17:25:49,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:49" (1/1) ... [2023-10-12 17:25:49,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:49" (1/1) ... [2023-10-12 17:25:49,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:25:49,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:25:49,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:25:49,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:25:49,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:49" (1/1) ... [2023-10-12 17:25:49,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:49,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:49,621 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:49,637 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:49,669 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:25:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:25:49,672 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:25:49,672 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:25:49,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:25:49,674 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:25:49,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:25:49,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:25:49,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:25:49,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:25:49,674 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:25:49,674 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:25:49,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:25:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:25:49,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:25:49,675 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:49,755 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:25:49,757 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:25:49,911 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:25:49,926 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:25:49,927 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:25:49,928 INFO L201 PluginConnector]: Adding new model buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:25:49 BoogieIcfgContainer [2023-10-12 17:25:49,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:25:49,929 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:25:49,929 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:25:49,932 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:25:49,933 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:25:49,940 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:49" (1/2) ... [2023-10-12 17:25:49,941 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d58f0f0 and model type buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:25:49, skipping insertion in model container [2023-10-12 17:25:49,941 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:25:49,941 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:25:49" (2/2) ... [2023-10-12 17:25:49,942 INFO L332 chiAutomizerObserver]: Analyzing ICFG buffer-mult.wvr.bpl [2023-10-12 17:25:49,986 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:25:50,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:25:50,027 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:25:50,027 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:25:50,035 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:50,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:25:50,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2023-10-12 17:25:50,041 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:25:50,050 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:25:50,052 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:25:50,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 86 flow [2023-10-12 17:25:50,059 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:25:50,059 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:25:50,059 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:50,060 INFO L119 LiptonReduction]: Number of co-enabled transitions 350 [2023-10-12 17:25:50,235 INFO L134 LiptonReduction]: Checked pairs total: 505 [2023-10-12 17:25:50,235 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:25:50,245 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:25:50,245 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:25:50,245 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:25:50,245 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:25:50,245 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:25:50,245 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:25:50,245 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:25:50,246 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:25:50,246 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:25:50,249 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:50,249 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:25:50,249 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:25:50,249 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:50,251 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:25:50,252 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:25:50,253 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:50,253 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:25:50,253 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:25:50,253 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:50,256 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, 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_5, i=v_i_5, 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:50,257 INFO L750 eck$LassoCheckResult]: Loop: 52#[L73-1, L24]true [126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back] 55#[L73-1, L25-1]true [90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i] 52#[L73-1, L24]true [2023-10-12 17:25:50,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash 3578, now seen corresponding path program 1 times [2023-10-12 17:25:50,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:50,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373234819] [2023-10-12 17:25:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:50,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:50,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:50,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:50,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:50,334 INFO L85 PathProgramCache]: Analyzing trace with hash 4957, now seen corresponding path program 1 times [2023-10-12 17:25:50,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:50,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932032357] [2023-10-12 17:25:50,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:50,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:50,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:50,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:50,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash 3442454, now seen corresponding path program 1 times [2023-10-12 17:25:50,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:50,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114743362] [2023-10-12 17:25:50,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:50,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:50,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:50,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:50,431 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:50,431 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:50,431 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:50,431 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:50,431 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:50,432 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:50,432 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:50,432 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:50,432 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:25:50,432 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:50,432 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:50,443 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:50,457 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:50,464 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:50,467 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:50,469 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:50,472 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:50,546 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:50,549 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:50,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:50,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:50,553 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:50,566 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:50,577 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:50,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:50,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:25:50,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:50,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:50,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:50,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:25:50,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:25:50,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:50,596 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:50,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:50,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:50,604 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:50,605 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:50,607 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:50,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:50,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:50,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:50,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:50,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:50,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:50,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:50,659 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:50,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:50,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:50,661 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:50,664 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:50,666 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:50,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:50,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:50,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:50,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:50,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:50,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:50,696 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:50,705 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:25:50,705 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:25:50,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:50,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:50,708 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:50,710 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:50,742 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:50,749 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:25:50,749 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:50,749 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:25:50,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:50,757 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:25:50,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:50,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:25:50,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:50,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:50,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:50,830 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:50,854 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:50,855 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:51,032 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:51,033 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:25:51,041 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:25:51,044 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:51,050 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:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-10-12 17:25:51,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:25:51,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:51,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:25:51,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:51,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:25:51,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:51,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:51,296 INFO L124 PetriNetUnfolderBase]: 1684/2258 cut-off events. [2023-10-12 17:25:51,298 INFO L125 PetriNetUnfolderBase]: For 395/395 co-relation queries the response was YES. [2023-10-12 17:25:51,304 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:51,305 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:51,305 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:51,311 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:51,312 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:51,312 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:25:51,313 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:51,317 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:51,317 INFO L124 PetriNetUnfolderBase]: 25/44 cut-off events. [2023-10-12 17:25:51,317 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-10-12 17:25:51,317 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:51,318 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, 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_5, i=v_i_5, 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:51,318 INFO L750 eck$LassoCheckResult]: Loop: 109#[L36, L74, L24]true [121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= 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_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back] 112#[L74, L37-1, L24]true [95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j] 109#[L36, L74, L24]true [2023-10-12 17:25:51,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash 111027, now seen corresponding path program 1 times [2023-10-12 17:25:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113642893] [2023-10-12 17:25:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:51,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:51,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:51,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:51,346 INFO L85 PathProgramCache]: Analyzing trace with hash 4807, now seen corresponding path program 1 times [2023-10-12 17:25:51,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:51,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946620143] [2023-10-12 17:25:51,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:51,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:51,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:51,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:51,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash 106700793, now seen corresponding path program 1 times [2023-10-12 17:25:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:51,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182631552] [2023-10-12 17:25:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:51,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:51,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:51,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:51,443 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:51,444 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:51,444 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:51,444 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:51,444 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:51,444 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:51,444 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:51,444 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:51,444 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:25:51,444 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:51,444 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:51,446 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:51,449 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:51,451 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:51,460 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:51,462 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:51,472 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:51,475 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:51,477 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:51,552 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:51,553 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:51,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:51,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:51,554 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:51,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:25:51,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:51,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:51,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:51,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:51,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:51,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:51,587 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:51,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:51,615 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:51,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:51,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:51,629 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:51,639 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:51,644 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:51,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:51,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:51,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:51,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:51,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:51,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:51,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:51,689 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:51,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:51,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:51,701 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:51,704 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:51,706 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:51,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:51,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:51,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:51,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:51,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:51,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:51,730 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:51,736 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:25:51,737 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:25:51,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:51,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:51,741 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:51,755 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:51,755 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:51,762 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:25:51,762 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:51,762 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, N) = -1*j + 1*N Supporting invariants [] [2023-10-12 17:25:51,765 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:51,766 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:25:51,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:51,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:25:51,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:51,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:51,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:51,799 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:51,799 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:51,800 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:51,909 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:51,909 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:25:51,932 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:25:51,932 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:51,933 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:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-10-12 17:25:51,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:25:51,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:51,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:25:51,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:51,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:25:51,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:51,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:52,089 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:52,754 INFO L124 PetriNetUnfolderBase]: 5333/7066 cut-off events. [2023-10-12 17:25:52,755 INFO L125 PetriNetUnfolderBase]: For 1269/1269 co-relation queries the response was YES. [2023-10-12 17:25:52,761 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:52,761 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:52,808 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:52,808 INFO L430 stractBuchiCegarLoop]: Abstraction has has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:52,808 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:25:52,808 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:52,870 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:52,870 INFO L124 PetriNetUnfolderBase]: 219/321 cut-off events. [2023-10-12 17:25:52,870 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-10-12 17:25:52,870 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:52,871 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, 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_5, i=v_i_5, 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 (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} 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:52,871 INFO L750 eck$LassoCheckResult]: Loop: 166#[L75, L36, L25-1, L49-1]true [97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, 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:52,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash 106716775, now seen corresponding path program 1 times [2023-10-12 17:25:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:52,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474540662] [2023-10-12 17:25:52,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:52,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:52,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:52,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:52,881 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2023-10-12 17:25:52,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:52,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232130315] [2023-10-12 17:25:52,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:52,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:52,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:52,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:52,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:52,888 INFO L85 PathProgramCache]: Analyzing trace with hash -524391223, now seen corresponding path program 1 times [2023-10-12 17:25:52,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455517483] [2023-10-12 17:25:52,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:52,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:52,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:52,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:53,009 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:53,009 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:53,009 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:53,010 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:53,010 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:53,010 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:53,010 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:53,010 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:53,010 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:25:53,010 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:53,010 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:53,011 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:53,013 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:53,029 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:53,031 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:53,033 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:53,034 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:53,036 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:53,038 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:53,040 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:53,042 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:53,044 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:53,141 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:53,141 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:53,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:53,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:53,142 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:53,146 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:53,146 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:53,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:53,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:53,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:53,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:53,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:53,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:53,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:53,166 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:53,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:53,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:53,168 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:53,200 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:53,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:53,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:53,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:53,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:53,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:53,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:53,214 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:53,233 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:53,238 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:25:53,238 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:25:53,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:53,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:53,253 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:53,274 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:53,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:53,281 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:25:53,282 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:53,282 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:53,284 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:53,285 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:25:53,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:53,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:25:53,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:53,311 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:53,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:53,313 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:53,314 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:53,314 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:25:53,360 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:25:53,360 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:25:53,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-10-12 17:25:53,991 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:25:53,991 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:25:53,992 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:25:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:25:53,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:25:53,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:53,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:25:53,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:53,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:25:53,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:53,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 75112 transitions, 686912 flow [2023-10-12 17:26:34,373 INFO L124 PetriNetUnfolderBase]: 17454/22962 cut-off events. [2023-10-12 17:26:34,373 INFO L125 PetriNetUnfolderBase]: For 4080/4080 co-relation queries the response was YES. [2023-10-12 17:26:34,395 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:34,396 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 72 places, 75112 transitions, 686912 flow [2023-10-12 17:26:35,061 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 72 places, 75112 transitions, 686912 flow [2023-10-12 17:26:35,061 INFO L430 stractBuchiCegarLoop]: Abstraction has has 72 places, 75112 transitions, 686912 flow [2023-10-12 17:26:35,061 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:26:35,061 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 72 places, 75112 transitions, 686912 flow [2023-10-12 17:26:39,996 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:39,997 INFO L124 PetriNetUnfolderBase]: 1225/1641 cut-off events. [2023-10-12 17:26:39,997 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2023-10-12 17:26:39,997 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:39,997 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, 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_5, i=v_i_5, 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 (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} 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 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} 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_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 229#[L36, L61, L24, L76, L49-1]true [2023-10-12 17:26:39,997 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_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 229#[L36, L61, L24, L76, L49-1]true [2023-10-12 17:26:39,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash 923735141, now seen corresponding path program 1 times [2023-10-12 17:26:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:39,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281805582] [2023-10-12 17:26:39,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:39,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:40,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:40,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:40,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash 4255, now seen corresponding path program 1 times [2023-10-12 17:26:40,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:40,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503220795] [2023-10-12 17:26:40,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:40,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:40,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:40,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:40,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1348756477, now seen corresponding path program 1 times [2023-10-12 17:26:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:40,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052905761] [2023-10-12 17:26:40,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:40,056 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:40,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:26:40,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052905761] [2023-10-12 17:26:40,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052905761] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:26:40,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:26:40,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:26:40,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651144443] [2023-10-12 17:26:40,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:26:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:26:40,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:26:40,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:26:40,085 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:40,085 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:26:40,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:28:54,561 INFO L124 PetriNetUnfolderBase]: 24544/32609 cut-off events. [2023-10-12 17:28:54,561 INFO L125 PetriNetUnfolderBase]: For 5705/5705 co-relation queries the response was YES. [2023-10-12 17:28:54,592 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:54,727 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 2729 selfloop transitions, 118 changer transitions 1093/3940 dead transitions. [2023-10-12 17:28:54,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 3940 transitions, 42016 flow [2023-10-12 17:28:54,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 3940 transitions, 42016 flow [2023-10-12 17:28:59,834 INFO L124 PetriNetUnfolderBase]: 24544/32609 cut-off events. [2023-10-12 17:28:59,834 INFO L125 PetriNetUnfolderBase]: For 5705/5705 co-relation queries the response was YES. [2023-10-12 17:28:59,861 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:59,861 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 68 places, 3940 transitions, 42016 flow [2023-10-12 17:28:59,886 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 68 places, 3940 transitions, 42016 flow [2023-10-12 17:28:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:28:59,887 INFO L430 stractBuchiCegarLoop]: Abstraction has has 68 places, 3940 transitions, 42016 flow [2023-10-12 17:28:59,888 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:28:59,888 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 68 places, 3940 transitions, 42016 flow [2023-10-12 17:29:00,204 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:00,204 INFO L124 PetriNetUnfolderBase]: 1576/2132 cut-off events. [2023-10-12 17:29:00,204 INFO L125 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2023-10-12 17:29:00,204 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:00,205 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, 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_5, i=v_i_5, 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 (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} 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 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i] 225#[L75, L36, L24, L49-1]true [126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back] 166#[L75, L36, L25-1, L49-1]true [97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 169#[L49, L75, L36, L25-1]true [2023-10-12 17:29:00,205 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_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 169#[L49, L75, L36, L25-1]true [2023-10-12 17:29:00,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:00,205 INFO L85 PathProgramCache]: Analyzing trace with hash 452739768, now seen corresponding path program 1 times [2023-10-12 17:29:00,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:00,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859301230] [2023-10-12 17:29:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:00,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:00,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:00,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:00,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:00,215 INFO L85 PathProgramCache]: Analyzing trace with hash 4127, now seen corresponding path program 2 times [2023-10-12 17:29:00,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:00,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815493803] [2023-10-12 17:29:00,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:00,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:00,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:00,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:00,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:00,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1291223318, now seen corresponding path program 1 times [2023-10-12 17:29:00,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:00,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160592863] [2023-10-12 17:29:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:00,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:00,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:00,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:00,367 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:29:00,367 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:29:00,368 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:29:00,368 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:29:00,368 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:29:00,368 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:00,368 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:29:00,368 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:29:00,368 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:29:00,368 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:29:00,368 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:29:00,369 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:29:00,371 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:29:00,373 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:29:00,374 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:29:00,376 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:29:00,377 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:29:00,379 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:29:00,381 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:29:00,382 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:29:00,527 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:29:00,528 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:29:00,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:00,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:00,530 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:29:00,531 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:29:00,537 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:29:00,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:00,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:00,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:00,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:00,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:00,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:00,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:00,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:29:00,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:00,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:00,561 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:29:00,573 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:29:00,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:29:00,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:00,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:00,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:00,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:00,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:00,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:00,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:00,589 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:29:00,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:00,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:00,609 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:29:00,611 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:29:00,613 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:29:00,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:00,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:00,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:00,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:00,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:00,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:00,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:00,640 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:29:00,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:00,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:00,653 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:29:00,665 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:29:00,666 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:29:00,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:00,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:00,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:00,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:00,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:00,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:00,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:00,691 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:29:00,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:00,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:00,706 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:29:00,708 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:29:00,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:29:00,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:00,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:00,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:00,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:00,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:00,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:00,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:00,737 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:29:00,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:00,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:00,738 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:29:00,740 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:29:00,742 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:29:00,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:00,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:00,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:00,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:00,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:00,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:00,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:00,762 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:29:00,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:00,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:00,763 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:29:00,765 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:29:00,767 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:29:00,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:00,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:00,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:00,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:00,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:00,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:00,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:00,789 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:29:00,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:00,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:00,791 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:29:00,793 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:29:00,794 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:29:00,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:00,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:00,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:00,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:00,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:00,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:00,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:00,807 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:29:00,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:00,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:00,808 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:29:00,810 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:29:00,811 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:29:00,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:00,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:00,817 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:29:00,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:00,824 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:29:00,824 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:29:00,839 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:29:00,856 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2023-10-12 17:29:00,857 INFO L444 ModelExtractionUtils]: 13 out of 26 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-10-12 17:29:00,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:00,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:00,859 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:29:00,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:29:00,862 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:29:00,885 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2023-10-12 17:29:00,885 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:29:00,885 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:29:00,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:00,892 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:29:00,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:00,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:29:00,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:00,922 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:29:00,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:00,936 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:29:00,937 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:29:00,937 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:29:00,976 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:29:00,976 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:29:01,279 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:29:01,279 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:29:01,280 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:29:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:29:01,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:29:01,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:01,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:29:01,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:01,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:29:01,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:01,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 53744 transitions, 681552 flow [2023-10-12 17:29:03,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 Received shutdown request... [2023-10-12 17:30:31,867 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:31,886 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:31,886 INFO L430 stractBuchiCegarLoop]: Abstraction has has 80 places, 53744 transitions, 681552 flow [2023-10-12 17:30:31,886 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:30:31,886 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 80 places, 53744 transitions, 681552 flow [2023-10-12 17:30:31,903 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:30:31,913 INFO L201 PluginConnector]: Adding new model buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:30:31 BoogieIcfgContainer [2023-10-12 17:30:31,914 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:30:31,914 INFO L158 Benchmark]: Toolchain (without parser) took 282369.24ms. Allocated memory was 239.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 192.8MB in the beginning and 1.0GB in the end (delta: -856.0MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-10-12 17:30:31,914 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 239.1MB. Free memory is still 193.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:30:31,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.46ms. Allocated memory is still 239.1MB. Free memory was 192.7MB in the beginning and 191.3MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:30:31,915 INFO L158 Benchmark]: Boogie Preprocessor took 13.30ms. Allocated memory is still 239.1MB. Free memory was 191.1MB in the beginning and 190.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:31,915 INFO L158 Benchmark]: RCFGBuilder took 333.38ms. Allocated memory is still 239.1MB. Free memory was 190.1MB in the beginning and 206.6MB in the end (delta: -16.5MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:31,916 INFO L158 Benchmark]: BuchiAutomizer took 281984.45ms. Allocated memory was 239.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 206.6MB in the beginning and 1.0GB in the end (delta: -842.3MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-10-12 17:30:31,918 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24ms. Allocated memory is still 239.1MB. Free memory is still 193.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.46ms. Allocated memory is still 239.1MB. Free memory was 192.7MB in the beginning and 191.3MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.30ms. Allocated memory is still 239.1MB. Free memory was 191.1MB in the beginning and 190.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 333.38ms. Allocated memory is still 239.1MB. Free memory was 190.1MB in the beginning and 206.6MB in the end (delta: -16.5MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 281984.45ms. Allocated memory was 239.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 206.6MB in the beginning and 1.0GB in the end (delta: -842.3MB). Peak memory consumption was 2.0GB. 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 281.9s and 6 iterations. TraceHistogramMax:0. Analysis of lassos took 2.1s. Construction of modules took 0.2s. Büchi inclusion checks took 141.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.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 431 mSDsluCounter, 363 SdHoareTripleChecker+Invalid, 0.2s 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: inital58 mio100 ax100 hnf100 lsp48 ukn97 mio100 lsp80 div100 bol100 ite100 ukn100 eq171 hnf91 smp100 dnf106 smp98 tf100 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 78ms 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.2s - 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: 57, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 31, dependent conditional: 0, dependent unconditional: 31, 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