/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/dec-subseq.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:26:20,722 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:26:20,777 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:26:20,805 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:26:20,806 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:26:20,806 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:26:20,807 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:26:20,807 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:26:20,807 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:26:20,808 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:26:20,808 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:26:20,808 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:26:20,808 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:26:20,812 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:26:20,812 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:26:20,813 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:26:20,813 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:26:20,814 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:26:20,814 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:26:20,814 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:26:20,814 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:26:20,814 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:26:20,815 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:26:20,815 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:26:20,815 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:26:20,815 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:26:20,815 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:26:20,815 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:26:20,815 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:26:20,816 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:26:20,816 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:26:20,816 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:26:20,817 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:26:20,818 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:26:20,818 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:26:21,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:26:21,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:26:21,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:26:21,046 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:26:21,047 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:26:21,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dec-subseq.wvr.bpl [2023-10-12 17:26:21,048 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dec-subseq.wvr.bpl' [2023-10-12 17:26:21,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:26:21,076 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:26:21,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:26:21,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:26:21,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:26:21,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:21" (1/1) ... [2023-10-12 17:26:21,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:21" (1/1) ... [2023-10-12 17:26:21,097 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:26:21,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:26:21,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:26:21,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:26:21,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:26:21,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:21" (1/1) ... [2023-10-12 17:26:21,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:21" (1/1) ... [2023-10-12 17:26:21,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:21" (1/1) ... [2023-10-12 17:26:21,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:21" (1/1) ... [2023-10-12 17:26:21,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:21" (1/1) ... [2023-10-12 17:26:21,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:21" (1/1) ... [2023-10-12 17:26:21,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:21" (1/1) ... [2023-10-12 17:26:21,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:21" (1/1) ... [2023-10-12 17:26:21,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:26:21,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:26:21,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:26:21,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:26:21,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:21" (1/1) ... [2023-10-12 17:26:21,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:21,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:21,137 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:26:21,159 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:26:21,165 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:26:21,165 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:26:21,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:26:21,166 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:26:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:26:21,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:26:21,166 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:26:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:26:21,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:26:21,167 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:26:21,209 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:26:21,211 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:26:21,295 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:26:21,306 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:26:21,307 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:26:21,308 INFO L201 PluginConnector]: Adding new model dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:26:21 BoogieIcfgContainer [2023-10-12 17:26:21,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:26:21,309 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:26:21,309 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:26:21,323 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:26:21,324 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:26:21,324 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:21" (1/2) ... [2023-10-12 17:26:21,325 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8d5c98a and model type dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:26:21, skipping insertion in model container [2023-10-12 17:26:21,325 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:26:21,325 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:26:21" (2/2) ... [2023-10-12 17:26:21,326 INFO L332 chiAutomizerObserver]: Analyzing ICFG dec-subseq.wvr.bpl [2023-10-12 17:26:21,373 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:26:21,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:26:21,422 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:26:21,423 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:26:21,426 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:26:21,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:26:21,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 64 flow [2023-10-12 17:26:21,431 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:26:21,448 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:26:21,450 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:26:21,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 64 flow [2023-10-12 17:26:21,463 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:26:21,463 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:26:21,463 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:26:21,464 INFO L119 LiptonReduction]: Number of co-enabled transitions 124 [2023-10-12 17:26:21,927 INFO L134 LiptonReduction]: Checked pairs total: 166 [2023-10-12 17:26:21,927 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:26:21,938 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:26:21,939 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:26:21,939 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:26:21,939 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:26:21,939 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:26:21,939 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:26:21,939 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:26:21,939 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:26:21,940 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:26:21,943 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:21,943 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:26:21,943 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:26:21,943 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:21,945 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:26:21,945 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:26:21,946 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:21,946 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:26:21,946 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:26:21,946 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:21,950 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:26:21,950 INFO L750 eck$LassoCheckResult]: Loop: 40#[L23, L57-1]true [100] L23-->L23: Formula: (and (< v_last_19 (select v_A_30 v_i_51)) (= v_i_50 (+ v_i_51 1)) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i] 40#[L23, L57-1]true [2023-10-12 17:26:21,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:21,954 INFO L85 PathProgramCache]: Analyzing trace with hash 4272, now seen corresponding path program 1 times [2023-10-12 17:26:21,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:21,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366320870] [2023-10-12 17:26:21,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:21,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:22,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:22,054 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 1 times [2023-10-12 17:26:22,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:22,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552431779] [2023-10-12 17:26:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:22,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:22,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash 132532, now seen corresponding path program 1 times [2023-10-12 17:26:22,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:22,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636149344] [2023-10-12 17:26:22,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:22,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:22,148 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:26:22,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:26:22,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636149344] [2023-10-12 17:26:22,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636149344] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:26:22,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:26:22,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:26:22,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165576392] [2023-10-12 17:26:22,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:26:22,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:26:22,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:26:22,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:26:22,199 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:26:22,199 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:26:22,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:26:22,254 INFO L124 PetriNetUnfolderBase]: 35/70 cut-off events. [2023-10-12 17:26:22,254 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:26:22,254 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:26:22,257 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 21 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-10-12 17:26:22,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 23 transitions, 113 flow [2023-10-12 17:26:22,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:26:22,265 INFO L124 PetriNetUnfolderBase]: 35/70 cut-off events. [2023-10-12 17:26:22,265 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:26:22,266 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:26:22,266 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:26:22,267 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 19 places, 23 transitions, 113 flow [2023-10-12 17:26:22,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:26:22,272 INFO L430 stractBuchiCegarLoop]: Abstraction has has 19 places, 23 transitions, 113 flow [2023-10-12 17:26:22,272 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:26:22,272 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:26:22,274 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:22,274 INFO L124 PetriNetUnfolderBase]: 2/10 cut-off events. [2023-10-12 17:26:22,274 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:26:22,274 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:22,275 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:26:22,275 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#[L40, L23, 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 60#[L23, L39, L58]true [2023-10-12 17:26:22,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash 132516, now seen corresponding path program 1 times [2023-10-12 17:26:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:22,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911457314] [2023-10-12 17:26:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:22,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:22,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:22,284 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 1 times [2023-10-12 17:26:22,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:22,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193432531] [2023-10-12 17:26:22,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:22,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:22,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash 127350366, now seen corresponding path program 1 times [2023-10-12 17:26:22,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:22,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521528996] [2023-10-12 17:26:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:22,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:22,316 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:26:22,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:26:22,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521528996] [2023-10-12 17:26:22,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521528996] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:26:22,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:26:22,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:26:22,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395986693] [2023-10-12 17:26:22,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:26:22,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:26:22,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:26:22,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:26:22,399 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:26:22,399 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:26:22,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:26:22,449 INFO L124 PetriNetUnfolderBase]: 32/67 cut-off events. [2023-10-12 17:26:22,449 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:26:22,449 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:26:22,451 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 24 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-10-12 17:26:22,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 26 transitions, 180 flow [2023-10-12 17:26:22,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:26:22,459 INFO L124 PetriNetUnfolderBase]: 32/67 cut-off events. [2023-10-12 17:26:22,459 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:26:22,459 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:26:22,460 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:26:22,461 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 21 places, 26 transitions, 180 flow [2023-10-12 17:26:22,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:26:22,463 INFO L430 stractBuchiCegarLoop]: Abstraction has has 21 places, 26 transitions, 180 flow [2023-10-12 17:26:22,464 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:26:22,464 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:26:22,469 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:22,470 INFO L124 PetriNetUnfolderBase]: 6/16 cut-off events. [2023-10-12 17:26:22,472 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:26:22,473 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:22,476 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) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 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:26:22,476 INFO L750 eck$LassoCheckResult]: Loop: 40#[L23, L57-1]true [100] L23-->L23: Formula: (and (< v_last_19 (select v_A_30 v_i_51)) (= v_i_50 (+ v_i_51 1)) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i] 40#[L23, L57-1]true [2023-10-12 17:26:22,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:22,477 INFO L85 PathProgramCache]: Analyzing trace with hash 4108555, now seen corresponding path program 1 times [2023-10-12 17:26:22,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:22,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713496707] [2023-10-12 17:26:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:22,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:22,498 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 2 times [2023-10-12 17:26:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:22,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067043584] [2023-10-12 17:26:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:22,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:22,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:22,504 INFO L85 PathProgramCache]: Analyzing trace with hash 127365305, now seen corresponding path program 1 times [2023-10-12 17:26:22,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:22,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938090576] [2023-10-12 17:26:22,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:22,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:22,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:22,643 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:26:22,644 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:26:22,644 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:26:22,644 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:26:22,645 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:26:22,645 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:22,645 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:26:22,645 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:26:22,645 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:26:22,645 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:26:22,645 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:26:22,657 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:26:22,674 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:26:22,702 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:26:22,769 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:26:22,772 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:26:22,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:22,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:22,775 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:26:22,776 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:26:22,777 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:26:22,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:22,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:22,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:22,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:22,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:22,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:22,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:22,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:26:22,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:22,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:22,818 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:26:22,820 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:26:22,822 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:26:22,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:22,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:22,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:22,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:22,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:22,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:22,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:22,870 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:26:22,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:22,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:22,872 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:26:22,874 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:26:22,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:26:22,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:22,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:22,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:22,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:22,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:22,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:22,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:22,907 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:26:22,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:22,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:22,910 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:26:22,912 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:26:22,916 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:26:22,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:22,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:22,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:22,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:22,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:22,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:22,951 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:26:22,991 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:26:22,991 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:26:22,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:22,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:23,001 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:26:23,002 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:26:23,006 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:26:23,026 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:26:23,026 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:26:23,027 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:26:23,034 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:26:23,037 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:26:23,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:23,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:26:23,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:23,077 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:26:23,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:23,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:26:23,080 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:26:23,080 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:26:23,162 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:26:23,163 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:26:23,166 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:26:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:26:23,168 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:26:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2023-10-12 17:26:23,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:26:23,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:23,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:26:23,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:23,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:26:23,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:23,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 308 transitions, 2752 flow [2023-10-12 17:26:23,188 INFO L124 PetriNetUnfolderBase]: 99/172 cut-off events. [2023-10-12 17:26:23,188 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-10-12 17:26:23,189 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:26:23,189 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 31 places, 308 transitions, 2752 flow [2023-10-12 17:26:23,193 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 31 places, 308 transitions, 2752 flow [2023-10-12 17:26:23,193 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 308 transitions, 2752 flow [2023-10-12 17:26:23,193 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:26:23,194 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 308 transitions, 2752 flow [2023-10-12 17:26:23,197 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:23,197 INFO L124 PetriNetUnfolderBase]: 8/22 cut-off events. [2023-10-12 17:26:23,197 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:26:23,197 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:23,198 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#[L40, L23, 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) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 128#[L39, L58, L25-1]true [2023-10-12 17:26:23,198 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 128#[L39, L58, L25-1]true [2023-10-12 17:26:23,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:23,198 INFO L85 PathProgramCache]: Analyzing trace with hash -347105971, now seen corresponding path program 1 times [2023-10-12 17:26:23,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:23,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042487440] [2023-10-12 17:26:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:23,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:23,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:23,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:23,212 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 2 times [2023-10-12 17:26:23,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:23,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850316339] [2023-10-12 17:26:23,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:23,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:23,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:23,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:23,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1438613447, now seen corresponding path program 2 times [2023-10-12 17:26:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794530601] [2023-10-12 17:26:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:23,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:23,274 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:26:23,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:26:23,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794530601] [2023-10-12 17:26:23,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794530601] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:26:23,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957070565] [2023-10-12 17:26:23,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:26:23,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:26:23,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:23,276 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:26:23,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:26:23,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:26:23,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:26:23,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:23,308 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:26:23,339 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:26:23,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:26:23,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957070565] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:26:23,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:26:23,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:26:23,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453846180] [2023-10-12 17:26:23,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:26:23,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:26:23,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:26:23,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:26:23,411 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:26:23,411 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:26:23,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:26:23,502 INFO L124 PetriNetUnfolderBase]: 215/386 cut-off events. [2023-10-12 17:26:23,502 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-10-12 17:26:23,505 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:26:23,510 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 103 selfloop transitions, 36 changer transitions 22/161 dead transitions. [2023-10-12 17:26:23,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 161 transitions, 1718 flow [2023-10-12 17:26:23,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 161 transitions, 1718 flow [2023-10-12 17:26:23,535 INFO L124 PetriNetUnfolderBase]: 215/386 cut-off events. [2023-10-12 17:26:23,535 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-10-12 17:26:23,536 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:26:23,536 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 31 places, 161 transitions, 1718 flow [2023-10-12 17:26:23,538 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 31 places, 161 transitions, 1718 flow [2023-10-12 17:26:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:26:23,540 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 161 transitions, 1718 flow [2023-10-12 17:26:23,540 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:26:23,540 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 161 transitions, 1718 flow [2023-10-12 17:26:23,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:23,547 INFO L124 PetriNetUnfolderBase]: 44/86 cut-off events. [2023-10-12 17:26:23,547 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:26:23,547 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:23,548 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) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 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) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 77#[L57-1, L25-1]true [2023-10-12 17:26:23,548 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) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 77#[L57-1, L25-1]true [2023-10-12 17:26:23,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:23,548 INFO L85 PathProgramCache]: Analyzing trace with hash 127365304, now seen corresponding path program 2 times [2023-10-12 17:26:23,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:23,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579052482] [2023-10-12 17:26:23,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:23,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:23,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:23,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:23,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:23,565 INFO L85 PathProgramCache]: Analyzing trace with hash 3974, now seen corresponding path program 1 times [2023-10-12 17:26:23,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:23,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605891738] [2023-10-12 17:26:23,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:23,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:23,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:23,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:23,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:23,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2138975869, now seen corresponding path program 3 times [2023-10-12 17:26:23,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:23,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066420030] [2023-10-12 17:26:23,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:23,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:23,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:23,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:23,684 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:26:23,685 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:26:23,686 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:26:23,686 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:26:23,686 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:26:23,686 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:23,686 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:26:23,686 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:26:23,686 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:26:23,686 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:26:23,686 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:26:23,688 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:26:23,690 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:26:23,692 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:26:23,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:26:23,847 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:26:23,848 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:26:23,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:23,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:23,849 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:26:23,851 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:26:23,852 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:26:23,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:23,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:23,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:23,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:23,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:23,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:23,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:23,886 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:26:23,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:23,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:23,887 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:26:23,895 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:26:23,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:23,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:23,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:23,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:23,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:23,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:23,906 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:26:23,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:23,925 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:26:23,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:23,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:23,927 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:26:23,928 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:26:23,930 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:26:23,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:23,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:23,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:23,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:23,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:23,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:23,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:23,963 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:26:23,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:23,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:23,964 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:26:23,966 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:26:23,967 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:26:23,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:23,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:23,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:23,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:23,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:23,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:23,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:24,002 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:26:24,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:24,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:24,003 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:26:24,023 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:26:24,023 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:26:24,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:24,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:24,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:24,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:24,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:24,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:24,052 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:26:24,063 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:26:24,063 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:26:24,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:24,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:24,067 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:26:24,068 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:26:24,069 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:26:24,089 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:26:24,090 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:26:24,090 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:26:24,093 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:26:24,095 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:26:24,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:24,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:26:24,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:24,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:26:24,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:24,121 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:26:24,122 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:26:24,122 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:26:24,238 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:26:24,238 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:26:24,252 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:26:24,253 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:26:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:26:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2023-10-12 17:26:24,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:26:24,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:24,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:26:24,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:24,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:26:24,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:24,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:26:24,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:26:24,634 INFO L124 PetriNetUnfolderBase]: 869/1537 cut-off events. [2023-10-12 17:26:24,634 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2023-10-12 17:26:24,636 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:26:24,636 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:26:24,664 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:26:24,664 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:26:24,664 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:26:24,664 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:26:24,791 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:24,791 INFO L124 PetriNetUnfolderBase]: 314/528 cut-off events. [2023-10-12 17:26:24,791 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-10-12 17:26:24,791 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:24,792 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) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 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) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 128#[L39, L58, L25-1]true [2023-10-12 17:26:24,797 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 128#[L39, L58, L25-1]true [2023-10-12 17:26:24,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:24,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1883299860, now seen corresponding path program 1 times [2023-10-12 17:26:24,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:24,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30254738] [2023-10-12 17:26:24,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:24,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:24,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:24,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:24,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:24,809 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 3 times [2023-10-12 17:26:24,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:24,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607315784] [2023-10-12 17:26:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:24,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:24,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:24,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1669936334, now seen corresponding path program 2 times [2023-10-12 17:26:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:24,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210329961] [2023-10-12 17:26:24,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:24,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:24,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:24,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:25,044 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:26:25,044 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:26:25,044 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:26:25,044 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:26:25,044 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:26:25,044 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:25,044 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:26:25,044 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:26:25,044 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:26:25,044 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:26:25,044 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:26:25,046 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:26:25,048 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:26:25,050 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:26:25,053 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:26:25,055 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:26:25,057 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:26:25,323 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:26:25,323 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:26:25,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:25,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:25,333 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:26:25,336 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:26:25,337 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:26:25,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:25,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:25,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:25,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:25,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:25,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:25,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:25,361 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:26:25,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:25,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:25,363 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:26:25,365 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:26:25,367 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:26:25,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:25,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:25,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:25,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:25,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:25,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:25,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:25,403 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:26:25,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:25,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:25,404 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:26:25,412 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:26:25,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:25,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:25,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:25,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:25,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:25,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:25,421 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:26:25,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:25,441 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:26:25,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:25,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:25,442 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:26:25,455 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:26:25,455 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:26:25,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:25,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:25,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:25,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:25,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:25,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:25,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:25,483 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:26:25,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:25,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:25,485 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:26:25,487 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:26:25,488 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:26:25,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:25,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:25,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:25,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:25,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:25,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:25,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:25,504 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:26:25,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:25,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:25,506 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:26:25,508 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:26:25,509 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:26:25,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:25,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:25,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:25,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:25,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:25,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:25,522 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:26:25,530 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:26:25,530 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:26:25,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:25,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:25,531 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:26:25,538 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:26:25,538 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:26:25,544 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:26:25,544 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:26:25,544 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:26:25,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:26:25,549 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:26:25,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:25,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:26:25,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:25,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:26:25,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:25,582 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:26:25,583 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:26:25,583 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:26:25,629 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:26:25,630 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:26:25,811 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:26:25,854 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:26:25,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:26:25,855 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:26:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:26:25,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:26:25,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:25,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:26:25,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:25,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:26:25,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:25,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:26:48,579 INFO L124 PetriNetUnfolderBase]: 2385/4234 cut-off events. [2023-10-12 17:26:48,579 INFO L125 PetriNetUnfolderBase]: For 881/881 co-relation queries the response was YES. [2023-10-12 17:26:48,583 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:26:48,583 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:26:49,016 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:26:49,016 INFO L430 stractBuchiCegarLoop]: Abstraction has has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:26:49,016 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:26:49,017 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:27:05,513 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:05,513 INFO L124 PetriNetUnfolderBase]: 1856/3197 cut-off events. [2023-10-12 17:27:05,513 INFO L125 PetriNetUnfolderBase]: For 635/635 co-relation queries the response was YES. [2023-10-12 17:27:05,513 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:05,514 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#[L40, L23, 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) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 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#[L40, L23, 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) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 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#[L40, L23, 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 60#[L23, L39, L58]true [100] L23-->L23: Formula: (and (< v_last_19 (select v_A_30 v_i_51)) (= v_i_50 (+ v_i_51 1)) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i] 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) (<= .cse0 v_last_17))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 128#[L39, L58, L25-1]true [2023-10-12 17:27:05,514 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 128#[L39, L58, L25-1]true [2023-10-12 17:27:05,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1982958041, now seen corresponding path program 1 times [2023-10-12 17:27:05,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:05,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684169880] [2023-10-12 17:27:05,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:05,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:05,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:05,531 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 4 times [2023-10-12 17:27:05,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:05,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315676463] [2023-10-12 17:27:05,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:05,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:05,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1342804513, now seen corresponding path program 2 times [2023-10-12 17:27:05,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:05,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442383312] [2023-10-12 17:27:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:05,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:05,848 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:27:05,848 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:27:05,848 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:27:05,848 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:27:05,848 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:27:05,848 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:05,848 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:27:05,848 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:27:05,848 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:27:05,848 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:27:05,848 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:27:05,850 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:05,854 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:05,856 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:05,858 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:05,860 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:05,863 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,175 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:27:06,175 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:27:06,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,181 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:06,183 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:06,189 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,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:06,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:06,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:06,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:06,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:06,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:06,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:06,211 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:06,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,212 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:06,213 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:06,216 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,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:06,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:06,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:06,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:06,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:06,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:06,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:06,236 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:06,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,237 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:06,239 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:06,241 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,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:06,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:06,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:06,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:06,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:06,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:06,258 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:06,274 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:06,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,276 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:06,277 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:06,280 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,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:06,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:06,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:06,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:06,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:06,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:06,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:06,291 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:06,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,292 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:06,292 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:06,297 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,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:06,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:06,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:06,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:06,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:06,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:06,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:06,321 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:06,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,322 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:06,323 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:06,325 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,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:06,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:06,332 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:27:06,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:06,355 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:27:06,356 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:27:06,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:06,400 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:06,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,401 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:06,403 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:06,404 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,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:06,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:06,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:06,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:06,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:06,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:06,416 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:27:06,422 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:27:06,422 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:27:06,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:06,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:06,423 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:06,423 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:06,426 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:27:06,433 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:27:06,433 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:27:06,433 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:27:06,436 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:06,441 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:27:06,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:06,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:27:06,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:06,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:06,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:06,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:06,482 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,482 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:06,523 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:06,523 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:27:08,609 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:27:11,126 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:27:11,127 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:11,128 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:27:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:27:11,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:27:11,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:11,129 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:27:11,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:11,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:27:11,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:11,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:11,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:11,177 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:11,177 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:27:11,177 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:11,225 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:27:11,225 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:27:15,214 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:27:15,215 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:15,215 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:27:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:27:15,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:27:15,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:15,216 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:27:15,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:15,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:27:15,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:15,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:15,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:15,248 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:15,249 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:27:15,249 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:15,307 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:27:15,308 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:27:20,101 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:27:20,102 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:20,102 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:27:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2023-10-12 17:27:20,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:27:20,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:20,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:27:20,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:20,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 11 letters. Loop has 4 letters. [2023-10-12 17:27:20,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:20,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 494616 transitions, 8300928 flow Received shutdown request... [2023-10-12 17:30:30,671 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:30:30,673 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:30:30,841 WARN L144 chiPetriNetCegarLoop]: Unhandled de.uni_freiburg.informatik.ultimate.automata.AutomataOperationCanceledException: Timeout or canceled by user.occured during abstraction size reduction. Continuing with non-reduced net [2023-10-12 17:30:30,842 INFO L430 stractBuchiCegarLoop]: Abstraction has has 69 places, 494616 transitions, 8300928 flow [2023-10-12 17:30:30,842 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:30:30,842 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 69 places, 494616 transitions, 8300928 flow [2023-10-12 17:30:31,242 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:30:31,247 INFO L201 PluginConnector]: Adding new model dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:30:31 BoogieIcfgContainer [2023-10-12 17:30:31,247 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:30:31,247 INFO L158 Benchmark]: Toolchain (without parser) took 250171.38ms. Allocated memory was 206.6MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 161.6MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 5.9GB. Max. memory is 8.0GB. [2023-10-12 17:30:31,248 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 206.6MB. Free memory is still 162.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:30:31,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.85ms. Allocated memory is still 206.6MB. Free memory was 161.6MB in the beginning and 160.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:31,248 INFO L158 Benchmark]: Boogie Preprocessor took 15.21ms. Allocated memory is still 206.6MB. Free memory was 160.1MB in the beginning and 159.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:31,248 INFO L158 Benchmark]: RCFGBuilder took 193.85ms. Allocated memory is still 206.6MB. Free memory was 159.1MB in the beginning and 148.9MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:30:31,248 INFO L158 Benchmark]: BuchiAutomizer took 249938.04ms. Allocated memory was 206.6MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 148.8MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 5.9GB. Max. memory is 8.0GB. [2023-10-12 17:30:31,249 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.23ms. Allocated memory is still 206.6MB. Free memory is still 162.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.85ms. Allocated memory is still 206.6MB. Free memory was 161.6MB in the beginning and 160.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.21ms. Allocated memory is still 206.6MB. Free memory was 160.1MB in the beginning and 159.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 193.85ms. Allocated memory is still 206.6MB. Free memory was 159.1MB in the beginning and 148.9MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 249938.04ms. Allocated memory was 206.6MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 148.8MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 5.9GB. 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 249.8s and 8 iterations. TraceHistogramMax:0. Analysis of lassos took 3.3s. Construction of modules took 0.3s. Büchi inclusion checks took 14.2s. 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: 75ms 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: 67, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 42, dependent conditional: 0, dependent unconditional: 42, 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