/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/inc-subseq.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:27:03,894 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:27:03,966 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:27:04,004 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:27:04,005 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:27:04,005 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:27:04,007 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:27:04,008 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:27:04,008 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:27:04,013 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:27:04,014 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:27:04,014 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:27:04,014 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:27:04,015 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:27:04,016 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:27:04,016 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:27:04,017 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:27:04,017 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:27:04,017 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:27:04,017 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:27:04,018 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:27:04,019 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:27:04,020 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:27:04,020 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:27:04,020 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:27:04,020 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:27:04,020 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:27:04,021 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:27:04,021 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:27:04,021 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:27:04,022 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:27:04,022 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:27:04,022 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:27:04,024 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:27:04,024 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:27:04,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:27:04,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:27:04,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:27:04,250 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:27:04,251 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:27:04,253 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/inc-subseq.wvr.bpl [2023-10-12 17:27:04,253 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq.wvr.bpl' [2023-10-12 17:27:04,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:27:04,284 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:27:04,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:27:04,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:27:04,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:27:04,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:04" (1/1) ... [2023-10-12 17:27:04,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:04" (1/1) ... [2023-10-12 17:27:04,309 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:27:04,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:27:04,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:27:04,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:27:04,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:27:04,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:04" (1/1) ... [2023-10-12 17:27:04,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:04" (1/1) ... [2023-10-12 17:27:04,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:04" (1/1) ... [2023-10-12 17:27:04,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:04" (1/1) ... [2023-10-12 17:27:04,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:04" (1/1) ... [2023-10-12 17:27:04,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:04" (1/1) ... [2023-10-12 17:27:04,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:04" (1/1) ... [2023-10-12 17:27:04,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:04" (1/1) ... [2023-10-12 17:27:04,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:27:04,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:27:04,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:27:04,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:27:04,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:04" (1/1) ... [2023-10-12 17:27:04,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:04,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:04,366 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:27:04,393 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:27:04,412 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:27:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:27:04,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:27:04,413 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:27:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:27:04,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:27:04,414 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:27:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:27:04,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:27:04,415 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:27:04,468 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:27:04,470 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:27:04,564 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:27:04,579 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:27:04,579 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:27:04,581 INFO L201 PluginConnector]: Adding new model inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:27:04 BoogieIcfgContainer [2023-10-12 17:27:04,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:27:04,583 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:27:04,583 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:27:04,591 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:27:04,592 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:27:04,592 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:04" (1/2) ... [2023-10-12 17:27:04,593 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57501d01 and model type inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:27:04, skipping insertion in model container [2023-10-12 17:27:04,594 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:27:04,594 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:27:04" (2/2) ... [2023-10-12 17:27:04,595 INFO L332 chiAutomizerObserver]: Analyzing ICFG inc-subseq.wvr.bpl [2023-10-12 17:27:04,679 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:27:04,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:27:04,728 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:27:04,729 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:27:04,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2023-10-12 17:27:04,732 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:27:04,736 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 64 flow [2023-10-12 17:27:04,739 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:27:04,751 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:27:04,753 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:27:04,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 64 flow [2023-10-12 17:27:04,761 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:27:04,761 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:27:04,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2023-10-12 17:27:04,762 INFO L119 LiptonReduction]: Number of co-enabled transitions 124 [2023-10-12 17:27:05,215 INFO L134 LiptonReduction]: Checked pairs total: 166 [2023-10-12 17:27:05,215 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:27:05,227 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:27:05,227 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:27:05,227 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:27:05,227 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:27:05,227 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:27:05,228 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:27:05,228 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:27:05,228 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:27:05,229 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:27:05,232 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:05,232 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:27:05,232 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:27:05,232 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:05,235 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:27:05,235 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:27:05,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:05,236 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:27:05,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:27:05,237 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:05,241 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 38#[L57]true [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 40#[L23, L57-1]true [2023-10-12 17:27:05,241 INFO L750 eck$LassoCheckResult]: Loop: 40#[L23, L57-1]true [100] L23-->L23: Formula: (and (= v_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i] 40#[L23, L57-1]true [2023-10-12 17:27:05,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:05,245 INFO L85 PathProgramCache]: Analyzing trace with hash 4272, now seen corresponding path program 1 times [2023-10-12 17:27:05,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:05,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009580068] [2023-10-12 17:27:05,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:05,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:05,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:05,371 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 1 times [2023-10-12 17:27:05,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:05,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750951458] [2023-10-12 17:27:05,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:05,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:05,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:05,387 INFO L85 PathProgramCache]: Analyzing trace with hash 132532, now seen corresponding path program 1 times [2023-10-12 17:27:05,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:05,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135048576] [2023-10-12 17:27:05,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:05,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:05,481 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:27:05,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:27:05,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135048576] [2023-10-12 17:27:05,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135048576] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:27:05,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:27:05,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:27:05,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109128818] [2023-10-12 17:27:05,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:27:05,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:27:05,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:27:05,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:27:05,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 40 flow. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:27:05,548 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:27:05,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:27:05,609 INFO L124 PetriNetUnfolderBase]: 35/70 cut-off events. [2023-10-12 17:27:05,609 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:27:05,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 70 events. 35/70 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 159 event pairs, 8 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 116. Up to 41 conditions per place. [2023-10-12 17:27:05,614 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 21 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-10-12 17:27:05,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 23 transitions, 113 flow [2023-10-12 17:27:05,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:27:05,633 INFO L124 PetriNetUnfolderBase]: 35/70 cut-off events. [2023-10-12 17:27:05,633 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:27:05,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 70 events. 35/70 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 161 event pairs, 8 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 116. Up to 41 conditions per place. [2023-10-12 17:27:05,633 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:27:05,638 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 19 places, 23 transitions, 113 flow [2023-10-12 17:27:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:27:05,644 INFO L430 stractBuchiCegarLoop]: Abstraction has has 19 places, 23 transitions, 113 flow [2023-10-12 17:27:05,645 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:27:05,645 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:27:05,647 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:05,648 INFO L124 PetriNetUnfolderBase]: 2/10 cut-off events. [2023-10-12 17:27:05,648 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:27:05,648 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:05,648 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 38#[L57]true [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 40#[L23, L57-1]true [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 60#[L23, L39, L58]true [2023-10-12 17:27:05,649 INFO L750 eck$LassoCheckResult]: Loop: 60#[L23, L39, L58]true [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 63#[L23, L40, L58]true [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 60#[L23, L39, L58]true [2023-10-12 17:27:05,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:05,649 INFO L85 PathProgramCache]: Analyzing trace with hash 132516, now seen corresponding path program 1 times [2023-10-12 17:27:05,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:05,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299650732] [2023-10-12 17:27:05,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:05,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:05,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:05,675 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 1 times [2023-10-12 17:27:05,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:05,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963195145] [2023-10-12 17:27:05,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:05,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:05,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:05,699 INFO L85 PathProgramCache]: Analyzing trace with hash 127350366, now seen corresponding path program 1 times [2023-10-12 17:27:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:05,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774181890] [2023-10-12 17:27:05,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:05,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:05,740 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:27:05,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:27:05,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774181890] [2023-10-12 17:27:05,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774181890] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:27:05,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:27:05,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:27:05,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142952586] [2023-10-12 17:27:05,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:27:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:27:05,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:27:05,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:27:05,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 23 transitions, 113 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:27:05,853 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:27:05,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:27:05,889 INFO L124 PetriNetUnfolderBase]: 32/67 cut-off events. [2023-10-12 17:27:05,889 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:27:05,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 67 events. 32/67 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 162 event pairs, 5 based on Foata normal form. 3/50 useless extension candidates. Maximal degree in co-relation 162. Up to 49 conditions per place. [2023-10-12 17:27:05,890 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 24 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-10-12 17:27:05,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 26 transitions, 180 flow [2023-10-12 17:27:05,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:27:05,896 INFO L124 PetriNetUnfolderBase]: 32/67 cut-off events. [2023-10-12 17:27:05,897 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:27:05,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 67 events. 32/67 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 160 event pairs, 5 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 162. Up to 49 conditions per place. [2023-10-12 17:27:05,897 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:27:05,898 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 21 places, 26 transitions, 180 flow [2023-10-12 17:27:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:27:05,899 INFO L430 stractBuchiCegarLoop]: Abstraction has has 21 places, 26 transitions, 180 flow [2023-10-12 17:27:05,900 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:27:05,900 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:27:05,902 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:05,902 INFO L124 PetriNetUnfolderBase]: 6/16 cut-off events. [2023-10-12 17:27:05,902 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:27:05,902 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:05,903 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 38#[L57]true [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 40#[L23, L57-1]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 77#[L57-1, L25-1]true [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 40#[L23, L57-1]true [2023-10-12 17:27:05,903 INFO L750 eck$LassoCheckResult]: Loop: 40#[L23, L57-1]true [100] L23-->L23: Formula: (and (= v_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i] 40#[L23, L57-1]true [2023-10-12 17:27:05,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:05,903 INFO L85 PathProgramCache]: Analyzing trace with hash 4108555, now seen corresponding path program 1 times [2023-10-12 17:27:05,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:05,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313091422] [2023-10-12 17:27:05,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:05,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:05,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 2 times [2023-10-12 17:27:05,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:05,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835580163] [2023-10-12 17:27:05,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:05,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:05,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash 127365305, now seen corresponding path program 1 times [2023-10-12 17:27:05,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:05,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659521305] [2023-10-12 17:27:05,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:06,063 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:27:06,065 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:27:06,065 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:27:06,065 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:27:06,065 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:27:06,065 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,065 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:27:06,065 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:27:06,065 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:27:06,065 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:27:06,066 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:27:06,080 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:27:06,094 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:27:06,136 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:27:06,236 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:27:06,239 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:27:06,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,244 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:27:06,247 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:27:06,248 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:27:06,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:06,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:06,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:06,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:06,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:06,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:06,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:06,304 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:27:06,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,310 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:27:06,320 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:27:06,337 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:27:06,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:06,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:06,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:06,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:06,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:06,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:06,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:06,379 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:27:06,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,381 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:27:06,384 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:27:06,385 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:27:06,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:06,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:06,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:06,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:06,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:06,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:06,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:06,420 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:27:06,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,422 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:27:06,428 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:27:06,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:06,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:06,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:06,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:06,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:06,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:06,456 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:27:06,473 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:27:06,490 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:27:06,490 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:27:06,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,498 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:27:06,500 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:27:06,532 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:27:06,554 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:27:06,554 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:27:06,555 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:27:06,561 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:27:06,564 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:27:06,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:06,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:27:06,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:06,614 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:06,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:06,615 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:27:06,618 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:27:06,619 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:27:06,741 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 262 transitions. [2023-10-12 17:27:06,742 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:27:06,748 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:27:06,750 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:27:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:27:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2023-10-12 17:27:06,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:27:06,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:06,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:27:06,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:06,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:27:06,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:06,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 308 transitions, 2752 flow [2023-10-12 17:27:06,802 INFO L124 PetriNetUnfolderBase]: 99/172 cut-off events. [2023-10-12 17:27:06,803 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-10-12 17:27:06,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 172 events. 99/172 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 550 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 582. Up to 154 conditions per place. [2023-10-12 17:27:06,803 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 31 places, 308 transitions, 2752 flow [2023-10-12 17:27:06,809 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 31 places, 308 transitions, 2752 flow [2023-10-12 17:27:06,810 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 308 transitions, 2752 flow [2023-10-12 17:27:06,810 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:27:06,810 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 308 transitions, 2752 flow [2023-10-12 17:27:06,815 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:06,816 INFO L124 PetriNetUnfolderBase]: 8/22 cut-off events. [2023-10-12 17:27:06,816 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:27:06,816 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:06,817 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 38#[L57]true [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 40#[L23, L57-1]true [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 60#[L23, L39, L58]true [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 63#[L23, L40, L58]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 126#[L40, L58, L25-1]true [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 128#[L39, L58, L25-1]true [2023-10-12 17:27:06,817 INFO L750 eck$LassoCheckResult]: Loop: 128#[L39, L58, L25-1]true [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 126#[L40, L58, L25-1]true [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 128#[L39, L58, L25-1]true [2023-10-12 17:27:06,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash -347105971, now seen corresponding path program 1 times [2023-10-12 17:27:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:06,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254003597] [2023-10-12 17:27:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:06,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:06,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:06,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:06,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 2 times [2023-10-12 17:27:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:06,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312544647] [2023-10-12 17:27:06,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:06,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:06,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:06,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:06,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1438613447, now seen corresponding path program 2 times [2023-10-12 17:27:06,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:06,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978858333] [2023-10-12 17:27:06,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:06,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:27:06,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:27:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978858333] [2023-10-12 17:27:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978858333] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:27:06,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759962933] [2023-10-12 17:27:06,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:27:06,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:27:06,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,936 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:27:06,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-10-12 17:27:06,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:27:06,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:27:06,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:06,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:27:07,004 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:27:07,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759962933] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:27:07,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:27:07,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:27:07,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278893592] [2023-10-12 17:27:07,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:27:07,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:27:07,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:27:07,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:27:07,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 308 transitions, 2752 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:27:07,090 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:27:07,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:27:07,209 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:27:07,219 INFO L124 PetriNetUnfolderBase]: 215/386 cut-off events. [2023-10-12 17:27:07,219 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-10-12 17:27:07,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 386 events. 215/386 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1532 event pairs, 0 based on Foata normal form. 15/238 useless extension candidates. Maximal degree in co-relation 1574. Up to 368 conditions per place. [2023-10-12 17:27:07,228 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 103 selfloop transitions, 36 changer transitions 22/161 dead transitions. [2023-10-12 17:27:07,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 161 transitions, 1718 flow [2023-10-12 17:27:07,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 161 transitions, 1718 flow [2023-10-12 17:27:07,264 INFO L124 PetriNetUnfolderBase]: 215/386 cut-off events. [2023-10-12 17:27:07,264 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-10-12 17:27:07,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 386 events. 215/386 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1542 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 1574. Up to 368 conditions per place. [2023-10-12 17:27:07,265 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 31 places, 161 transitions, 1718 flow [2023-10-12 17:27:07,268 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 31 places, 161 transitions, 1718 flow [2023-10-12 17:27:07,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:27:07,271 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 161 transitions, 1718 flow [2023-10-12 17:27:07,271 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:27:07,271 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 161 transitions, 1718 flow [2023-10-12 17:27:07,280 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:07,281 INFO L124 PetriNetUnfolderBase]: 44/86 cut-off events. [2023-10-12 17:27:07,281 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:27:07,281 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:07,282 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 38#[L57]true [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 40#[L23, L57-1]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 77#[L57-1, L25-1]true [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 40#[L23, L57-1]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 77#[L57-1, L25-1]true [2023-10-12 17:27:07,282 INFO L750 eck$LassoCheckResult]: Loop: 77#[L57-1, L25-1]true [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 40#[L23, L57-1]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 77#[L57-1, L25-1]true [2023-10-12 17:27:07,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:07,282 INFO L85 PathProgramCache]: Analyzing trace with hash 127365304, now seen corresponding path program 2 times [2023-10-12 17:27:07,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:07,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91734139] [2023-10-12 17:27:07,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:07,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:07,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:07,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:07,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:07,314 INFO L85 PathProgramCache]: Analyzing trace with hash 3974, now seen corresponding path program 1 times [2023-10-12 17:27:07,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:07,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920874179] [2023-10-12 17:27:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:07,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:07,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:07,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:07,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2138975869, now seen corresponding path program 3 times [2023-10-12 17:27:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:07,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865404808] [2023-10-12 17:27:07,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:07,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:07,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:07,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:07,522 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:27:07,523 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:27:07,523 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:27:07,524 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:27:07,524 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:27:07,524 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:07,524 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:27:07,524 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:27:07,524 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:27:07,524 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:27:07,524 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:27:07,526 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:27:07,528 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:27:07,531 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:27:07,710 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:27:07,710 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:27:07,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:07,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:07,713 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:27:07,716 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:27:07,717 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:27:07,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:07,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:07,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:07,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:07,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:07,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:07,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:07,747 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:27:07,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:07,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:07,749 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:27:07,751 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:27:07,753 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:27:07,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:07,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:07,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:07,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:07,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:07,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:07,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:07,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:07,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:07,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:07,784 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:27:07,789 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:27:07,790 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:27:07,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:07,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:07,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:07,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:07,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:07,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:07,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:07,820 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:27:07,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:07,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:07,821 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:27:07,822 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:27:07,824 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:27:07,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:07,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:07,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:07,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:07,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:07,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:07,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:07,858 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:27:07,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:07,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:07,860 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:27:07,872 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:27:07,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:07,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:07,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:07,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:07,884 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:27:07,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:07,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:07,903 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:27:07,917 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:27:07,918 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:27:07,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:07,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:07,921 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:27:07,928 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:27:07,936 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:27:07,938 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:27:07,938 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:27:07,938 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:27:07,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:07,948 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:27:07,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:07,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:27:07,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:07,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:07,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:07,988 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:27:07,988 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:27:07,989 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:27:08,120 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 7 states and 346 transitions. [2023-10-12 17:27:08,120 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:27:08,136 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:27:08,136 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:27:08,137 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:27:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2023-10-12 17:27:08,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:27:08,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:08,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:27:08,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:08,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:27:08,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:08,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:27:08,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:08,662 INFO L124 PetriNetUnfolderBase]: 869/1537 cut-off events. [2023-10-12 17:27:08,662 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2023-10-12 17:27:08,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9505 conditions, 1537 events. 869/1537 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 8813 event pairs, 1 based on Foata normal form. 0/889 useless extension candidates. Maximal degree in co-relation 7312. Up to 1519 conditions per place. [2023-10-12 17:27:08,665 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:27:08,711 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:27:08,711 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:27:08,711 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:27:08,712 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:27:08,888 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:08,888 INFO L124 PetriNetUnfolderBase]: 314/528 cut-off events. [2023-10-12 17:27:08,888 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-10-12 17:27:08,890 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:08,891 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 38#[L57]true [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 40#[L23, L57-1]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 77#[L57-1, L25-1]true [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 40#[L23, L57-1]true [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 60#[L23, L39, L58]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 128#[L39, L58, L25-1]true [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 126#[L40, L58, L25-1]true [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 128#[L39, L58, L25-1]true [2023-10-12 17:27:08,892 INFO L750 eck$LassoCheckResult]: Loop: 128#[L39, L58, L25-1]true [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 126#[L40, L58, L25-1]true [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 128#[L39, L58, L25-1]true [2023-10-12 17:27:08,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1883299860, now seen corresponding path program 1 times [2023-10-12 17:27:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:08,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562228226] [2023-10-12 17:27:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:08,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:08,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:08,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 3 times [2023-10-12 17:27:08,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:08,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057003501] [2023-10-12 17:27:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:08,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:08,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:08,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:08,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1669936334, now seen corresponding path program 2 times [2023-10-12 17:27:08,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:08,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990601636] [2023-10-12 17:27:08,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:08,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:08,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:08,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:09,257 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:27:09,258 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:27:09,258 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:27:09,258 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:27:09,258 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:27:09,258 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:09,258 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:27:09,258 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:27:09,258 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:27:09,258 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:27:09,258 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:27:09,260 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:27:09,263 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:27:09,266 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:27:09,270 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:27:09,273 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:27:09,275 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:27:09,583 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:27:09,583 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:27:09,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:09,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:09,585 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:27:09,588 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:27:09,589 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:27:09,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:09,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:09,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:09,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:09,599 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:09,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:09,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:09,634 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:27:09,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:09,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:09,635 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:27:09,638 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:27:09,640 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:27:09,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:09,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:09,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:09,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:09,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:09,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:09,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:09,679 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:27:09,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:09,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:09,681 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:27:09,683 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:27:09,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:27:09,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:09,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:09,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:09,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:09,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:09,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:09,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:09,717 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:27:09,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:09,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:09,718 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:27:09,728 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:27:09,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:09,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:09,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:09,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:09,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:09,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:09,741 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:27:09,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:09,755 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:27:09,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:09,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:09,758 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:27:09,761 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:27:09,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:27:09,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:09,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:09,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:09,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:09,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:09,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:09,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:09,806 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:27:09,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:09,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:09,808 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:27:09,810 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:27:09,812 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:27:09,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:09,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:09,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:09,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:09,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:09,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:09,845 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:27:09,856 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:27:09,857 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:27:09,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:09,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:09,861 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:27:09,864 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:27:09,865 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:27:09,871 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:27:09,872 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:27:09,872 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:27:09,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-10-12 17:27:09,879 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:27:09,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:09,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:27:09,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:09,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:09,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:09,917 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:27:09,917 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:27:09,918 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:27:09,981 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 297 transitions. [2023-10-12 17:27:09,981 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:27:10,330 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:27:10,330 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:27:10,331 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:27:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:27:10,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:27:10,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:10,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:27:10,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:10,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:27:10,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:10,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:27:10,369 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:27:37,494 INFO L124 PetriNetUnfolderBase]: 2385/4234 cut-off events. [2023-10-12 17:27:37,494 INFO L125 PetriNetUnfolderBase]: For 881/881 co-relation queries the response was YES. [2023-10-12 17:27:37,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30349 conditions, 4234 events. 2385/4234 cut-off events. For 881/881 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 28803 event pairs, 4 based on Foata normal form. 0/2332 useless extension candidates. Maximal degree in co-relation 25718. Up to 4216 conditions per place. [2023-10-12 17:27:37,498 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:27:37,967 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:27:37,967 INFO L430 stractBuchiCegarLoop]: Abstraction has has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:27:37,967 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:27:37,967 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:27:56,259 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:56,259 INFO L124 PetriNetUnfolderBase]: 1856/3197 cut-off events. [2023-10-12 17:27:56,259 INFO L125 PetriNetUnfolderBase]: For 635/635 co-relation queries the response was YES. [2023-10-12 17:27:56,259 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:56,260 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 38#[L57]true [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 40#[L23, L57-1]true [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 60#[L23, L39, L58]true [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 63#[L23, L40, L58]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 126#[L40, L58, L25-1]true [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 63#[L23, L40, L58]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 126#[L40, L58, L25-1]true [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 63#[L23, L40, L58]true [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 60#[L23, L39, L58]true [100] L23-->L23: Formula: (and (= v_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i] 60#[L23, L39, L58]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 128#[L39, L58, L25-1]true [2023-10-12 17:27:56,260 INFO L750 eck$LassoCheckResult]: Loop: 128#[L39, L58, L25-1]true [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 126#[L40, L58, L25-1]true [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 128#[L39, L58, L25-1]true [2023-10-12 17:27:56,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:56,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1982958041, now seen corresponding path program 1 times [2023-10-12 17:27:56,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:56,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146530563] [2023-10-12 17:27:56,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:56,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:56,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:56,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:56,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 4 times [2023-10-12 17:27:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560667297] [2023-10-12 17:27:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:56,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:56,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:56,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:56,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1342804513, now seen corresponding path program 2 times [2023-10-12 17:27:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:56,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596608154] [2023-10-12 17:27:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:56,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:56,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:56,665 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:27:56,665 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:27:56,665 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:27:56,665 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:27:56,665 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:27:56,665 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:56,665 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:27:56,665 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:27:56,665 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:27:56,666 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:27:56,666 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:27:56,671 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:27:56,673 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:27:56,675 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:27:56,678 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:27:56,680 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:27:56,683 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:27:57,056 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:27:57,057 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:27:57,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:57,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:57,058 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:27:57,060 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:27:57,068 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:27:57,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:57,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:57,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:57,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:57,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:57,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:57,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:57,091 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:27:57,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:57,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:57,092 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:27:57,094 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:27:57,096 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:27:57,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:57,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:57,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:57,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:57,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:57,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:57,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:57,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:57,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:57,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:57,119 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:27:57,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:27:57,122 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:27:57,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:57,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:57,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:57,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:57,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:57,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:57,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:57,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:57,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:57,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:57,150 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:27:57,159 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:27:57,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:57,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:57,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:57,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:57,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:57,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:57,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:27:57,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:57,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:57,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:57,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:57,188 INFO L229 MonitoredProcess]: Starting monitored process 25 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:27:57,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:27:57,197 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:27:57,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:57,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:57,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:57,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:57,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:57,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:57,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:57,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:57,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:57,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:57,226 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:27:57,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:27:57,230 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:27:57,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:57,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:57,238 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:27:57,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:57,279 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:27:57,280 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:27:57,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:57,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:57,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:57,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:57,343 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:27:57,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:27:57,347 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:27:57,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:57,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:57,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:57,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:57,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:57,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:57,373 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:27:57,384 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:27:57,384 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:27:57,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:57,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:57,389 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:27:57,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:27:57,393 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:27:57,418 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:27:57,418 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:27:57,418 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:27:57,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:57,430 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:27:57,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:57,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:27:57,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:57,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:57,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:57,472 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:27:57,472 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:27:57,472 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:27:57,526 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 297 transitions. [2023-10-12 17:27:57,526 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:27:57,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:28:02,918 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:28:02,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:28:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:28:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:28:02,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:28:02,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:02,920 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:28:02,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:02,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:28:02,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:02,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:28:02,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:28:02,969 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:28:02,970 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:28:03,013 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 301 transitions. [2023-10-12 17:28:03,013 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:28:08,035 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:28:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:28:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:28:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:28:08,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:28:08,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:08,037 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:28:08,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:08,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:28:08,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:08,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:28:08,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:08,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:28:08,078 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:28:08,078 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:28:08,128 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 333 transitions. [2023-10-12 17:28:08,128 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:28:13,660 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:28:13,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:28:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:28:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2023-10-12 17:28:13,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:28:13,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:13,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:28:13,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:13,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 11 letters. Loop has 4 letters. [2023-10-12 17:28:13,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:13,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 494616 transitions, 8300928 flow Received shutdown request... [2023-10-12 17:31:04,039 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:31:04,039 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:31:04,422 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:31:04,422 INFO L430 stractBuchiCegarLoop]: Abstraction has has 69 places, 494616 transitions, 8300928 flow [2023-10-12 17:31:04,422 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:31:04,422 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 69 places, 494616 transitions, 8300928 flow [2023-10-12 17:31:04,835 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:31:04,840 INFO L201 PluginConnector]: Adding new model inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:31:04 BoogieIcfgContainer [2023-10-12 17:31:04,841 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:31:04,841 INFO L158 Benchmark]: Toolchain (without parser) took 240557.12ms. Allocated memory was 176.2MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 126.0MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2023-10-12 17:31:04,841 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.29ms. Allocated memory is still 176.2MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:31:04,842 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.64ms. Allocated memory is still 176.2MB. Free memory was 126.0MB in the beginning and 124.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:31:04,842 INFO L158 Benchmark]: Boogie Preprocessor took 21.50ms. Allocated memory is still 176.2MB. Free memory was 124.5MB in the beginning and 123.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:31:04,842 INFO L158 Benchmark]: RCFGBuilder took 247.35ms. Allocated memory is still 176.2MB. Free memory was 123.4MB in the beginning and 113.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:31:04,842 INFO L158 Benchmark]: BuchiAutomizer took 240258.12ms. Allocated memory was 176.2MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 113.1MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2023-10-12 17:31:04,843 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.29ms. Allocated memory is still 176.2MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.64ms. Allocated memory is still 176.2MB. Free memory was 126.0MB in the beginning and 124.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.50ms. Allocated memory is still 176.2MB. Free memory was 124.5MB in the beginning and 123.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 247.35ms. Allocated memory is still 176.2MB. Free memory was 123.4MB in the beginning and 113.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 240258.12ms. Allocated memory was 176.2MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 113.1MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 5.1GB. 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 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function end + -1 * start and consists of 4 locations. One nondeterministic module has affine ranking function end + -1 * start and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 8300928 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 240.1s and 8 iterations. TraceHistogramMax:0. Analysis of lassos took 4.2s. Construction of modules took 0.3s. Büchi inclusion checks took 17.0s. 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 [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 547 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 541 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 260 mSDtfsCounter, 540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital95 mio100 ax100 hnf100 lsp93 ukn79 mio100 lsp61 div100 bol108 ite100 ukn100 eq184 hnf88 smp100 dnf140 smp83 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 110ms VariablesStem: 16 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s - 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.5s, 30 PlacesBefore, 18 PlacesAfterwards, 26 TransitionsBefore, 14 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 93, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 93, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 93, unknown conditional: 0, unknown unconditional: 93] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown