/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/sum-print2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:02:16,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:02:16,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:02:16,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:02:16,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:02:16,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:02:16,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:02:16,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:02:16,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:02:16,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:02:16,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:02:16,520 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:02:16,521 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:02:16,522 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:02:16,522 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:02:16,522 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:02:16,523 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:02:16,523 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:02:16,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:02:16,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:02:16,524 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:02:16,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:02:16,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:02:16,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:02:16,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:02:16,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:02:16,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:02:16,526 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:02:16,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:02:16,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:02:16,527 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:02:16,528 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:02:16,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:02:16,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:02:16,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:02:16,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:02:16,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:02:16,529 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:02:16,530 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 01:02:17,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:02:17,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:02:17,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:02:17,222 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:02:17,223 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:02:17,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sum-print2.bpl [2024-02-10 01:02:17,224 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sum-print2.bpl' [2024-02-10 01:02:17,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:02:17,249 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:02:17,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:02:17,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:02:17,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:02:17,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:17" (1/1) ... [2024-02-10 01:02:17,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:17" (1/1) ... [2024-02-10 01:02:17,287 INFO L138 Inliner]: procedures = 5, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:02:17,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:02:17,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:02:17,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:02:17,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:02:17,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:17" (1/1) ... [2024-02-10 01:02:17,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:17" (1/1) ... [2024-02-10 01:02:17,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:17" (1/1) ... [2024-02-10 01:02:17,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:17" (1/1) ... [2024-02-10 01:02:17,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:17" (1/1) ... [2024-02-10 01:02:17,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:17" (1/1) ... [2024-02-10 01:02:17,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:17" (1/1) ... [2024-02-10 01:02:17,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:17" (1/1) ... [2024-02-10 01:02:17,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:02:17,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:02:17,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:02:17,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:02:17,343 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:17" (1/1) ... [2024-02-10 01:02:17,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:17,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:17,393 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) [2024-02-10 01:02:17,417 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 [2024-02-10 01:02:17,497 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T4 given in one single declaration [2024-02-10 01:02:17,497 INFO L130 BoogieDeclarations]: Found specification of procedure T4 [2024-02-10 01:02:17,497 INFO L138 BoogieDeclarations]: Found implementation of procedure T4 [2024-02-10 01:02:17,498 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:02:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:02:17,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:02:17,498 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T2 given in one single declaration [2024-02-10 01:02:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure T2 [2024-02-10 01:02:17,498 INFO L138 BoogieDeclarations]: Found implementation of procedure T2 [2024-02-10 01:02:17,498 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T3 given in one single declaration [2024-02-10 01:02:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure T3 [2024-02-10 01:02:17,498 INFO L138 BoogieDeclarations]: Found implementation of procedure T3 [2024-02-10 01:02:17,499 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:02:17,583 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:02:17,585 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:02:17,829 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:02:17,888 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:02:17,889 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-10 01:02:17,891 WARN L332 CfgBuilder]: Unexpected successor node of atomic block begin: T2EXIT is neither atomic block end nor error location. [2024-02-10 01:02:17,892 WARN L332 CfgBuilder]: Unexpected successor node of atomic block begin: T3EXIT is neither atomic block end nor error location. [2024-02-10 01:02:17,894 INFO L201 PluginConnector]: Adding new model sum-print2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:02:17 BoogieIcfgContainer [2024-02-10 01:02:17,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:02:17,896 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:02:17,897 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:02:17,901 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:02:17,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:02:17,902 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:17" (1/2) ... [2024-02-10 01:02:17,903 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c92d2b4 and model type sum-print2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:02:17, skipping insertion in model container [2024-02-10 01:02:17,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:02:17,903 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:02:17" (2/2) ... [2024-02-10 01:02:17,914 INFO L332 chiAutomizerObserver]: Analyzing ICFG sum-print2.bpl [2024-02-10 01:02:18,075 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-10 01:02:18,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2024-02-10 01:02:18,197 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-02-10 01:02:18,197 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 01:02:18,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2024-02-10 01:02:18,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2024-02-10 01:02:18,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 26 transitions, 70 flow [2024-02-10 01:02:18,249 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:02:18,249 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:02:18,249 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:02:18,249 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:02:18,249 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:02:18,250 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:02:18,250 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:02:18,250 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:02:18,251 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 26 transitions, 70 flow [2024-02-10 01:02:18,257 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:18,257 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-02-10 01:02:18,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 01:02:18,258 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:18,261 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:02:18,262 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 26 transitions, 70 flow [2024-02-10 01:02:18,263 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:18,272 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-02-10 01:02:18,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 01:02:18,272 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:18,292 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [69] $Ultimate##0-->L72: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x] 41#[L72]true [71] L72-->L73: Formula: (= v_y_5 0) InVars {} OutVars{y=v_y_5} AuxVars[] AssignedVars[y] 43#[L73]true [70] L73-->L76: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 45#[L76]true [90] L76-->L25: Formula: (and (= v_T2Thread1of1ForFork0_thidvar0_2 2) (= v_T2Thread1of1ForFork0_thidvar1_2 2)) InVars {} OutVars{T2Thread1of1ForFork0_thidvar1=v_T2Thread1of1ForFork0_thidvar1_2, T2Thread1of1ForFork0_thidvar0=v_T2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T2Thread1of1ForFork0_thidvar1, T2Thread1of1ForFork0_thidvar0] 47#[L25, L76-1]true [2024-02-10 01:02:18,293 INFO L750 eck$LassoCheckResult]: Loop: 47#[L25, L76-1]true [85] L25-->L25: Formula: (and (= (+ v_x_17 (select v_A_9 v_i_21)) v_x_16) (= v_i_20 (+ v_i_21 1)) (< v_i_21 v_N_9)) InVars {A=v_A_9, i=v_i_21, x=v_x_17, N=v_N_9} OutVars{A=v_A_9, i=v_i_20, x=v_x_16, N=v_N_9} AuxVars[] AssignedVars[i, x] 47#[L25, L76-1]true [2024-02-10 01:02:18,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:18,299 INFO L85 PathProgramCache]: Analyzing trace with hash 3049591, now seen corresponding path program 1 times [2024-02-10 01:02:18,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:18,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397283621] [2024-02-10 01:02:18,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:18,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:18,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:18,527 INFO L85 PathProgramCache]: Analyzing trace with hash 116, now seen corresponding path program 1 times [2024-02-10 01:02:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297913776] [2024-02-10 01:02:18,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:18,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:18,597 INFO L85 PathProgramCache]: Analyzing trace with hash 94537406, now seen corresponding path program 1 times [2024-02-10 01:02:18,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:18,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643082342] [2024-02-10 01:02:18,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:18,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:18,870 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:02:18,871 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:02:18,871 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:02:18,872 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:02:18,872 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:02:18,872 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:18,872 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:02:18,872 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:02:18,872 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-print2.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:02:18,872 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:02:18,872 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:02:18,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:18,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:18,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:18,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:19,158 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:02:19,162 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:02:19,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:19,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:19,183 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) [2024-02-10 01:02:19,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 [2024-02-10 01:02:19,206 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 [2024-02-10 01:02:19,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:19,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:19,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:19,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:19,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:19,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:19,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:19,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 01:02:19,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:19,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:19,326 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) [2024-02-10 01:02:19,357 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 [2024-02-10 01:02:19,358 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 [2024-02-10 01:02:19,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:19,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:19,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:19,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:19,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:19,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:19,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:19,420 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 [2024-02-10 01:02:19,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:19,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:19,422 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) [2024-02-10 01:02:19,435 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 [2024-02-10 01:02:19,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:19,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:19,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:19,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:19,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:19,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:19,463 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 [2024-02-10 01:02:19,466 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:02:19,473 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:02:19,474 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:02:19,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:19,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:19,479 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) [2024-02-10 01:02:19,484 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:02:19,495 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 [2024-02-10 01:02:19,502 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:02:19,502 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:02:19,503 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2024-02-10 01:02:19,511 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 [2024-02-10 01:02:19,514 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:02:19,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:19,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:02:19,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:19,575 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:02:19,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:02:19,619 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 [2024-02-10 01:02:19,625 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. 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) [2024-02-10 01:02:19,758 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. 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 6 states and 277 transitions.4 powerset states2 rank states. The highest rank that occured is 1 [2024-02-10 01:02:19,760 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:02:19,760 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:02:19,761 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 01:02:19,796 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 01:02:19,796 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:02:19,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-02-10 01:02:19,805 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) [2024-02-10 01:02:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-02-10 01:02:19,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 94 transitions. Stem has 4 letters. Loop has 1 letters. [2024-02-10 01:02:19,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:19,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 94 transitions. Stem has 5 letters. Loop has 1 letters. [2024-02-10 01:02:19,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:19,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 94 transitions. Stem has 4 letters. Loop has 2 letters. [2024-02-10 01:02:19,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:19,824 INFO L428 stractBuchiCegarLoop]: Abstraction has has 38 places, 223 transitions, 1048 flow [2024-02-10 01:02:19,829 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:02:19,829 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 places, 223 transitions, 1048 flow [2024-02-10 01:02:19,967 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:19,968 INFO L124 PetriNetUnfolderBase]: 307/403 cut-off events. [2024-02-10 01:02:19,968 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-02-10 01:02:19,968 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:19,968 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [69] $Ultimate##0-->L72: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x] 41#[L72]true [71] L72-->L73: Formula: (= v_y_5 0) InVars {} OutVars{y=v_y_5} AuxVars[] AssignedVars[y] 43#[L73]true [70] L73-->L76: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 45#[L76]true [90] L76-->L25: Formula: (and (= v_T2Thread1of1ForFork0_thidvar0_2 2) (= v_T2Thread1of1ForFork0_thidvar1_2 2)) InVars {} OutVars{T2Thread1of1ForFork0_thidvar1=v_T2Thread1of1ForFork0_thidvar1_2, T2Thread1of1ForFork0_thidvar0=v_T2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T2Thread1of1ForFork0_thidvar1, T2Thread1of1ForFork0_thidvar0] 47#[L25, L76-1]true [93] L76-1-->L38: Formula: (and (= v_T3Thread1of1ForFork1_thidvar1_2 3) (= v_T3Thread1of1ForFork1_thidvar2_2 3) (= v_T3Thread1of1ForFork1_thidvar0_2 3)) InVars {} OutVars{T3Thread1of1ForFork1_thidvar1=v_T3Thread1of1ForFork1_thidvar1_2, T3Thread1of1ForFork1_thidvar2=v_T3Thread1of1ForFork1_thidvar2_2, T3Thread1of1ForFork1_thidvar0=v_T3Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[T3Thread1of1ForFork1_thidvar1, T3Thread1of1ForFork1_thidvar2, T3Thread1of1ForFork1_thidvar0] 98#[L25, L38, L77]true [96] L77-->$Ultimate##0: Formula: (and (= v_T4Thread1of1ForFork2_thidvar1_2 4) (= v_T4Thread1of1ForFork2_thidvar2_2 4) (= v_T4Thread1of1ForFork2_thidvar3_2 4) (= v_T4Thread1of1ForFork2_thidvar0_2 4)) InVars {} OutVars{T4Thread1of1ForFork2_thidvar2=v_T4Thread1of1ForFork2_thidvar2_2, T4Thread1of1ForFork2_thidvar1=v_T4Thread1of1ForFork2_thidvar1_2, T4Thread1of1ForFork2_thidvar3=v_T4Thread1of1ForFork2_thidvar3_2, T4Thread1of1ForFork2_thidvar0=v_T4Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[T4Thread1of1ForFork2_thidvar2, T4Thread1of1ForFork2_thidvar1, T4Thread1of1ForFork2_thidvar3, T4Thread1of1ForFork2_thidvar0] 100#[$Ultimate##0, L78, L25, L38]true [74] $Ultimate##0-->L54-2: Formula: (= v_k_1 0) InVars {} OutVars{k=v_k_1} AuxVars[] AssignedVars[k] 102#[L54-2, L78, L25, L38]true [76] L54-2-->L52: Formula: (< v_k_3 v_N_2) InVars {k=v_k_3, N=v_N_2} OutVars{k=v_k_3, N=v_N_2} AuxVars[] AssignedVars[] 104#[L78, L52, L25, L38]true [78] L52-->L53: Formula: (= (+ v_y_2 (select v_A_1 v_k_4)) v_y_1) InVars {A=v_A_1, y=v_y_2, k=v_k_4} OutVars{A=v_A_1, y=v_y_1, k=v_k_4} AuxVars[] AssignedVars[y] 106#[L78, L25, L38, L53]true [79] L53-->L54: Formula: (= (+ v_k_6 1) v_k_5) InVars {k=v_k_6} OutVars{k=v_k_5} AuxVars[] AssignedVars[k] 108#[L78, L25, L38, L54]true [81] L54-->L54-2: Formula: (<= v_N_4 v_k_11) InVars {k=v_k_11, N=v_N_4} OutVars{k=v_k_11, N=v_N_4} AuxVars[] AssignedVars[] 102#[L54-2, L78, L25, L38]true [2024-02-10 01:02:19,969 INFO L750 eck$LassoCheckResult]: Loop: 102#[L54-2, L78, L25, L38]true [76] L54-2-->L52: Formula: (< v_k_3 v_N_2) InVars {k=v_k_3, N=v_N_2} OutVars{k=v_k_3, N=v_N_2} AuxVars[] AssignedVars[] 104#[L78, L52, L25, L38]true [78] L52-->L53: Formula: (= (+ v_y_2 (select v_A_1 v_k_4)) v_y_1) InVars {A=v_A_1, y=v_y_2, k=v_k_4} OutVars{A=v_A_1, y=v_y_1, k=v_k_4} AuxVars[] AssignedVars[y] 106#[L78, L25, L38, L53]true [79] L53-->L54: Formula: (= (+ v_k_6 1) v_k_5) InVars {k=v_k_6} OutVars{k=v_k_5} AuxVars[] AssignedVars[k] 108#[L78, L25, L38, L54]true [81] L54-->L54-2: Formula: (<= v_N_4 v_k_11) InVars {k=v_k_11, N=v_N_4} OutVars{k=v_k_11, N=v_N_4} AuxVars[] AssignedVars[] 102#[L54-2, L78, L25, L38]true [2024-02-10 01:02:19,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:19,969 INFO L85 PathProgramCache]: Analyzing trace with hash -650142700, now seen corresponding path program 1 times [2024-02-10 01:02:19,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:19,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263097359] [2024-02-10 01:02:19,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:19,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:19,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:19,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:19,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:19,989 INFO L85 PathProgramCache]: Analyzing trace with hash 3265125, now seen corresponding path program 1 times [2024-02-10 01:02:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:19,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882902522] [2024-02-10 01:02:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:19,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:19,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:20,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:20,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:20,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1185993480, now seen corresponding path program 2 times [2024-02-10 01:02:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:20,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528492350] [2024-02-10 01:02:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:20,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:02:20,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 01:02:20,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528492350] [2024-02-10 01:02:20,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528492350] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 01:02:20,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 01:02:20,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-10 01:02:20,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614740121] [2024-02-10 01:02:20,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 01:02:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 01:02:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-10 01:02:20,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-10 01:02:20,185 INFO L175 Difference]: Start difference. First operand has 38 places, 223 transitions, 1048 flow. Second operand 3 states and 96 transitions. [2024-02-10 01:02:20,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 223 transitions, 1048 flow. Second operand 3 states and 96 transitions. [2024-02-10 01:02:20,188 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 32 [2024-02-10 01:02:20,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 01:02:20,279 INFO L124 PetriNetUnfolderBase]: 646/854 cut-off events. [2024-02-10 01:02:20,280 INFO L125 PetriNetUnfolderBase]: For 237/237 co-relation queries the response was YES. [2024-02-10 01:02:20,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 854 events. 646/854 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2278 event pairs, 78 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 1788. Up to 453 conditions per place. [2024-02-10 01:02:20,293 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 20 selfloop transitions, 10 changer transitions 2/108 dead transitions. [2024-02-10 01:02:20,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 108 transitions, 558 flow [2024-02-10 01:02:20,295 INFO L231 Difference]: Finished difference. Result has 42 places, 106 transitions, 550 flow [2024-02-10 01:02:20,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-10 01:02:20,296 INFO L428 stractBuchiCegarLoop]: Abstraction has has 42 places, 106 transitions, 550 flow [2024-02-10 01:02:20,296 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:02:20,297 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 places, 106 transitions, 550 flow [2024-02-10 01:02:20,381 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:20,381 INFO L124 PetriNetUnfolderBase]: 474/621 cut-off events. [2024-02-10 01:02:20,381 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2024-02-10 01:02:20,381 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:20,382 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [69] $Ultimate##0-->L72: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x] 41#[L72]true [71] L72-->L73: Formula: (= v_y_5 0) InVars {} OutVars{y=v_y_5} AuxVars[] AssignedVars[y] 43#[L73]true [70] L73-->L76: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 45#[L76]true [90] L76-->L25: Formula: (and (= v_T2Thread1of1ForFork0_thidvar0_2 2) (= v_T2Thread1of1ForFork0_thidvar1_2 2)) InVars {} OutVars{T2Thread1of1ForFork0_thidvar1=v_T2Thread1of1ForFork0_thidvar1_2, T2Thread1of1ForFork0_thidvar0=v_T2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T2Thread1of1ForFork0_thidvar1, T2Thread1of1ForFork0_thidvar0] 47#[L25, L76-1]true [93] L76-1-->L38: Formula: (and (= v_T3Thread1of1ForFork1_thidvar1_2 3) (= v_T3Thread1of1ForFork1_thidvar2_2 3) (= v_T3Thread1of1ForFork1_thidvar0_2 3)) InVars {} OutVars{T3Thread1of1ForFork1_thidvar1=v_T3Thread1of1ForFork1_thidvar1_2, T3Thread1of1ForFork1_thidvar2=v_T3Thread1of1ForFork1_thidvar2_2, T3Thread1of1ForFork1_thidvar0=v_T3Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[T3Thread1of1ForFork1_thidvar1, T3Thread1of1ForFork1_thidvar2, T3Thread1of1ForFork1_thidvar0] 98#[L25, L38, L77]true [96] L77-->$Ultimate##0: Formula: (and (= v_T4Thread1of1ForFork2_thidvar1_2 4) (= v_T4Thread1of1ForFork2_thidvar2_2 4) (= v_T4Thread1of1ForFork2_thidvar3_2 4) (= v_T4Thread1of1ForFork2_thidvar0_2 4)) InVars {} OutVars{T4Thread1of1ForFork2_thidvar2=v_T4Thread1of1ForFork2_thidvar2_2, T4Thread1of1ForFork2_thidvar1=v_T4Thread1of1ForFork2_thidvar1_2, T4Thread1of1ForFork2_thidvar3=v_T4Thread1of1ForFork2_thidvar3_2, T4Thread1of1ForFork2_thidvar0=v_T4Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[T4Thread1of1ForFork2_thidvar2, T4Thread1of1ForFork2_thidvar1, T4Thread1of1ForFork2_thidvar3, T4Thread1of1ForFork2_thidvar0] 100#[$Ultimate##0, L78, L25, L38]true [74] $Ultimate##0-->L54-2: Formula: (= v_k_1 0) InVars {} OutVars{k=v_k_1} AuxVars[] AssignedVars[k] 102#[L54-2, L78, L25, L38]true [76] L54-2-->L52: Formula: (< v_k_3 v_N_2) InVars {k=v_k_3, N=v_N_2} OutVars{k=v_k_3, N=v_N_2} AuxVars[] AssignedVars[] 104#[L78, L52, L25, L38]true [78] L52-->L53: Formula: (= (+ v_y_2 (select v_A_1 v_k_4)) v_y_1) InVars {A=v_A_1, y=v_y_2, k=v_k_4} OutVars{A=v_A_1, y=v_y_1, k=v_k_4} AuxVars[] AssignedVars[y] 106#[L78, L25, L38, L53]true [79] L53-->L54: Formula: (= (+ v_k_6 1) v_k_5) InVars {k=v_k_6} OutVars{k=v_k_5} AuxVars[] AssignedVars[k] 108#[L78, L25, L38, L54]true [80] L54-->L55: Formula: (< v_k_7 v_N_3) InVars {k=v_k_7, N=v_N_3} OutVars{k=v_k_7, N=v_N_3} AuxVars[] AssignedVars[] 137#[L55, L78, L25, L38]true [82] L55-->L56: Formula: (= (+ v_y_4 (select v_A_2 v_k_8)) v_y_3) InVars {A=v_A_2, y=v_y_4, k=v_k_8} OutVars{A=v_A_2, y=v_y_3, k=v_k_8} AuxVars[] AssignedVars[y] 139#[L78, L25, L38, L56]true [83] L56-->L54-2: Formula: (= v_k_9 (+ v_k_10 1)) InVars {k=v_k_10} OutVars{k=v_k_9} AuxVars[] AssignedVars[k] 102#[L54-2, L78, L25, L38]true [2024-02-10 01:02:20,382 INFO L750 eck$LassoCheckResult]: Loop: 102#[L54-2, L78, L25, L38]true [76] L54-2-->L52: Formula: (< v_k_3 v_N_2) InVars {k=v_k_3, N=v_N_2} OutVars{k=v_k_3, N=v_N_2} AuxVars[] AssignedVars[] 104#[L78, L52, L25, L38]true [78] L52-->L53: Formula: (= (+ v_y_2 (select v_A_1 v_k_4)) v_y_1) InVars {A=v_A_1, y=v_y_2, k=v_k_4} OutVars{A=v_A_1, y=v_y_1, k=v_k_4} AuxVars[] AssignedVars[y] 106#[L78, L25, L38, L53]true [79] L53-->L54: Formula: (= (+ v_k_6 1) v_k_5) InVars {k=v_k_6} OutVars{k=v_k_5} AuxVars[] AssignedVars[k] 108#[L78, L25, L38, L54]true [80] L54-->L55: Formula: (< v_k_7 v_N_3) InVars {k=v_k_7, N=v_N_3} OutVars{k=v_k_7, N=v_N_3} AuxVars[] AssignedVars[] 137#[L55, L78, L25, L38]true [82] L55-->L56: Formula: (= (+ v_y_4 (select v_A_2 v_k_8)) v_y_3) InVars {A=v_A_2, y=v_y_4, k=v_k_8} OutVars{A=v_A_2, y=v_y_3, k=v_k_8} AuxVars[] AssignedVars[y] 139#[L78, L25, L38, L56]true [83] L56-->L54-2: Formula: (= v_k_9 (+ v_k_10 1)) InVars {k=v_k_10} OutVars{k=v_k_9} AuxVars[] AssignedVars[k] 102#[L54-2, L78, L25, L38]true [2024-02-10 01:02:20,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:20,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2016875116, now seen corresponding path program 1 times [2024-02-10 01:02:20,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:20,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975259720] [2024-02-10 01:02:20,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:20,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:20,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:20,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:20,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:20,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1157180507, now seen corresponding path program 1 times [2024-02-10 01:02:20,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:20,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67228488] [2024-02-10 01:02:20,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:20,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:20,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:20,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:20,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:20,417 INFO L85 PathProgramCache]: Analyzing trace with hash -773978376, now seen corresponding path program 2 times [2024-02-10 01:02:20,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:20,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534249068] [2024-02-10 01:02:20,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:20,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:20,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:20,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-02-10 01:02:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:20,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:20,897 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:02:20,898 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:02:20,898 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:02:20,898 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:02:20,898 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:02:20,898 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:20,898 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:02:20,898 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:02:20,898 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-print2.bpl_BEv2_Iteration3_Lasso [2024-02-10 01:02:20,898 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:02:20,898 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:02:20,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:20,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:20,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:20,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:20,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:20,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:20,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:21,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:21,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:21,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:21,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:21,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:21,219 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:02:21,220 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:02:21,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:21,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:21,223 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) [2024-02-10 01:02:21,225 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 [2024-02-10 01:02:21,226 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 [2024-02-10 01:02:21,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:21,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:21,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:21,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:21,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:21,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:21,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:21,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:21,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:21,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:21,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:02:21,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 01:02:21,294 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 [2024-02-10 01:02:21,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:21,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:21,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:21,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:21,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:21,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:21,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:21,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:21,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:21,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:21,361 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) [2024-02-10 01:02:21,381 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 [2024-02-10 01:02:21,384 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 [2024-02-10 01:02:21,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:21,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:21,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:21,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:21,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:21,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:21,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:21,438 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 [2024-02-10 01:02:21,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:21,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:21,457 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) [2024-02-10 01:02:21,460 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 [2024-02-10 01:02:21,461 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 [2024-02-10 01:02:21,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:21,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:21,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:21,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:21,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:21,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:21,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:21,511 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 [2024-02-10 01:02:21,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:21,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:21,513 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) [2024-02-10 01:02:21,532 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 [2024-02-10 01:02:21,540 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 [2024-02-10 01:02:21,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:21,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:21,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:21,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:21,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:21,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:21,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:21,572 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 [2024-02-10 01:02:21,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:21,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:21,575 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) [2024-02-10 01:02:21,578 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 [2024-02-10 01:02:21,580 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 [2024-02-10 01:02:21,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:21,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:21,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:21,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:21,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:21,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:21,620 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:02:21,632 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-10 01:02:21,632 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-10 01:02:21,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:21,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:21,635 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) [2024-02-10 01:02:21,638 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 [2024-02-10 01:02:21,639 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:02:21,665 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:02:21,666 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:02:21,666 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2024-02-10 01:02:21,676 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 [2024-02-10 01:02:21,682 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:02:21,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:21,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:02:21,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:21,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:02:21,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:02:21,840 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 01:02:21,841 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2024-02-10 01:02:22,043 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 8 states and 373 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:02:22,043 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:02:22,043 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:02:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 373 transitions. [2024-02-10 01:02:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 373 transitions. [2024-02-10 01:02:22,078 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:02:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 373 transitions. [2024-02-10 01:02:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 373 transitions. [2024-02-10 01:02:22,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-02-10 01:02:22,249 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 01:02:22,249 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:02:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:02:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2024-02-10 01:02:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-02-10 01:02:22,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 125 transitions. Stem has 13 letters. Loop has 6 letters. [2024-02-10 01:02:22,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:22,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 125 transitions. Stem has 19 letters. Loop has 6 letters. [2024-02-10 01:02:22,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:22,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 125 transitions. Stem has 13 letters. Loop has 12 letters. [2024-02-10 01:02:22,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:22,255 INFO L428 stractBuchiCegarLoop]: Abstraction has has 54 places, 1616 transitions, 11682 flow [2024-02-10 01:02:22,256 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 01:02:22,256 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 places, 1616 transitions, 11682 flow [2024-02-10 01:02:27,293 INFO L124 PetriNetUnfolderBase]: 4759/5832 cut-off events. [2024-02-10 01:02:27,293 INFO L125 PetriNetUnfolderBase]: For 1345/1345 co-relation queries the response was YES. [2024-02-10 01:02:27,293 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2024-02-10 01:02:27,316 INFO L201 PluginConnector]: Adding new model sum-print2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:02:27 BoogieIcfgContainer [2024-02-10 01:02:27,317 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:02:27,317 INFO L158 Benchmark]: Toolchain (without parser) took 10068.59ms. Allocated memory was 155.2MB in the beginning and 317.7MB in the end (delta: 162.5MB). Free memory was 115.4MB in the beginning and 249.6MB in the end (delta: -134.2MB). Peak memory consumption was 192.1MB. Max. memory is 8.0GB. [2024-02-10 01:02:27,318 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 155.2MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:02:27,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.47ms. Allocated memory is still 155.2MB. Free memory was 115.4MB in the beginning and 126.3MB in the end (delta: -10.9MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2024-02-10 01:02:27,325 INFO L158 Benchmark]: Boogie Preprocessor took 29.43ms. Allocated memory is still 155.2MB. Free memory was 126.1MB in the beginning and 125.2MB in the end (delta: 945.1kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:02:27,326 INFO L158 Benchmark]: RCFGBuilder took 574.42ms. Allocated memory is still 155.2MB. Free memory was 125.0MB in the beginning and 119.6MB in the end (delta: 5.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-02-10 01:02:27,327 INFO L158 Benchmark]: BuchiAutomizer took 9420.10ms. Allocated memory was 155.2MB in the beginning and 317.7MB in the end (delta: 162.5MB). Free memory was 119.4MB in the beginning and 249.6MB in the end (delta: -130.1MB). Peak memory consumption was 197.4MB. Max. memory is 8.0GB. [2024-02-10 01:02:27,336 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.11ms. Allocated memory is still 155.2MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.47ms. Allocated memory is still 155.2MB. Free memory was 115.4MB in the beginning and 126.3MB in the end (delta: -10.9MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.43ms. Allocated memory is still 155.2MB. Free memory was 126.1MB in the beginning and 125.2MB in the end (delta: 945.1kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 574.42ms. Allocated memory is still 155.2MB. Free memory was 125.0MB in the beginning and 119.6MB in the end (delta: 5.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 9420.10ms. Allocated memory was 155.2MB in the beginning and 317.7MB in the end (delta: 162.5MB). Free memory was 119.4MB in the beginning and 249.6MB in the end (delta: -130.1MB). Peak memory consumption was 197.4MB. 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 1. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 201 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 132 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital53 mio100 ax100 hnf100 lsp63 ukn83 mio100 lsp61 div100 bol100 ite100 ukn100 eq163 hnf94 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 63ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-10 01:02:27,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...