/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_diff_incr_decr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:02:28,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:02:28,989 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:28,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:02:28,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:02:28,997 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:29,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:02:29,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:02:29,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:02:29,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:02:29,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:02:29,041 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:02:29,041 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:02:29,043 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:02:29,043 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:02:29,043 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:02:29,043 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:02:29,044 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:02:29,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:02:29,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:02:29,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:02:29,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:02:29,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:02:29,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:02:29,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:02:29,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:02:29,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:02:29,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:02:29,047 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:02:29,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:02:29,049 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:02:29,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:02:29,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:02:29,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:02:29,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:02:29,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:02:29,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:02:29,050 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:02:29,051 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:29,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:02:29,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:02:29,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:02:29,447 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:02:29,448 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:02:29,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sum_diff_incr_decr.bpl [2024-02-10 01:02:29,450 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sum_diff_incr_decr.bpl' [2024-02-10 01:02:29,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:02:29,490 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:02:29,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:02:29,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:02:29,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:02:29,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:29" (1/1) ... [2024-02-10 01:02:29,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:29" (1/1) ... [2024-02-10 01:02:29,529 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:02:29,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:02:29,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:02:29,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:02:29,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:02:29,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:29" (1/1) ... [2024-02-10 01:02:29,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:29" (1/1) ... [2024-02-10 01:02:29,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:29" (1/1) ... [2024-02-10 01:02:29,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:29" (1/1) ... [2024-02-10 01:02:29,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:29" (1/1) ... [2024-02-10 01:02:29,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:29" (1/1) ... [2024-02-10 01:02:29,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:29" (1/1) ... [2024-02-10 01:02:29,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:29" (1/1) ... [2024-02-10 01:02:29,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:02:29,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:02:29,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:02:29,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:02:29,575 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:29" (1/1) ... [2024-02-10 01:02:29,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:29,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:29,612 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:29,615 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:29,660 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:02:29,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:02:29,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:02:29,661 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T1 given in one single declaration [2024-02-10 01:02:29,661 INFO L130 BoogieDeclarations]: Found specification of procedure T1 [2024-02-10 01:02:29,661 INFO L138 BoogieDeclarations]: Found implementation of procedure T1 [2024-02-10 01:02:29,661 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T2 given in one single declaration [2024-02-10 01:02:29,661 INFO L130 BoogieDeclarations]: Found specification of procedure T2 [2024-02-10 01:02:29,661 INFO L138 BoogieDeclarations]: Found implementation of procedure T2 [2024-02-10 01:02:29,662 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:29,708 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:02:29,711 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:02:29,809 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:02:29,823 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:02:29,824 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:02:29,826 INFO L201 PluginConnector]: Adding new model sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:02:29 BoogieIcfgContainer [2024-02-10 01:02:29,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:02:29,827 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:02:29,827 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:02:29,832 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:02:29,832 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:02:29,833 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:29" (1/2) ... [2024-02-10 01:02:29,834 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@744efab8 and model type sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:02:29, skipping insertion in model container [2024-02-10 01:02:29,834 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:02:29,835 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:02:29" (2/2) ... [2024-02-10 01:02:29,836 INFO L332 chiAutomizerObserver]: Analyzing ICFG sum_diff_incr_decr.bpl [2024-02-10 01:02:29,897 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:02:29,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 64 flow [2024-02-10 01:02:29,941 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2024-02-10 01:02:29,941 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:02:29,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2024-02-10 01:02:29,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 64 flow [2024-02-10 01:02:29,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2024-02-10 01:02:29,968 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:02:29,969 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:02:29,969 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:02:29,969 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:02:29,970 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:02:29,970 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:02:29,970 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:02:29,970 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:02:29,971 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 places, 21 transitions, 54 flow [2024-02-10 01:02:29,985 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:29,985 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-02-10 01:02:29,985 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 01:02:29,986 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:29,992 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:02:29,993 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 places, 21 transitions, 54 flow [2024-02-10 01:02:29,998 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:29,998 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-02-10 01:02:29,998 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 01:02:29,999 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:30,004 INFO L748 eck$LassoCheckResult]: Stem: 32#[$Ultimate##0]true [42] $Ultimate##0-->L45: Formula: (and (< v_ULTIMATE.start_m_1 v_N_1) (<= 0 v_ULTIMATE.start_m_1)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_1} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_1} AuxVars[] AssignedVars[] 34#[L45]true [67] L45-->$Ultimate##0: Formula: (= v_T1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_14, T1Thread1of1ForFork0_thidvar0=v_T1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T1Thread1of1ForFork0_i, T1Thread1of1ForFork0_thidvar0] 36#[L45-1, $Ultimate##0]true [52] $Ultimate##0-->L16-1: Formula: (= v_T1Thread1of1ForFork0_i_1 0) InVars {} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[T1Thread1of1ForFork0_i] 38#[L16-1, L45-1]true [2024-02-10 01:02:30,005 INFO L750 eck$LassoCheckResult]: Loop: 38#[L16-1, L45-1]true [54] L16-1-->L17: Formula: (< v_T1Thread1of1ForFork0_i_5 v_N_3) InVars {T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_5, N=v_N_3} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_5, N=v_N_3} AuxVars[] AssignedVars[] 41#[L17, L45-1]true [56] L17-->L17-1: Formula: (and (= v_A_7 (store v_A_8 v_T1Thread1of1ForFork0_i_7 (+ (select v_A_8 v_T1Thread1of1ForFork0_i_7) 1))) (= (store v_B_8 v_T1Thread1of1ForFork0_i_7 (+ (- 1) (select v_B_8 v_T1Thread1of1ForFork0_i_7))) v_B_7)) InVars {A=v_A_8, T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_7, B=v_B_8} OutVars{A=v_A_7, T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_7, B=v_B_7} AuxVars[] AssignedVars[A, B] 43#[L17-1, L45-1]true [57] L17-1-->L16-1: Formula: (= (+ v_T1Thread1of1ForFork0_i_9 1) v_T1Thread1of1ForFork0_i_10) InVars {T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_9} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[T1Thread1of1ForFork0_i] 38#[L16-1, L45-1]true [2024-02-10 01:02:30,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:30,014 INFO L85 PathProgramCache]: Analyzing trace with hash 72282, now seen corresponding path program 1 times [2024-02-10 01:02:30,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:30,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421637184] [2024-02-10 01:02:30,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:30,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:30,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:30,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:30,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash 83478, now seen corresponding path program 1 times [2024-02-10 01:02:30,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:30,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674737214] [2024-02-10 01:02:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:30,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:30,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:30,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:30,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2141560547, now seen corresponding path program 1 times [2024-02-10 01:02:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:30,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471236348] [2024-02-10 01:02:30,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:30,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:30,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:30,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:30,297 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:02:30,298 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:02:30,298 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:02:30,298 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:02:30,298 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:02:30,298 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:30,298 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:02:30,298 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:02:30,299 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum_diff_incr_decr.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:02:30,299 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:02:30,299 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:02:30,318 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:30,343 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:30,423 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:02:30,427 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:02:30,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:30,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:30,431 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:30,433 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:30,434 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:30,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:30,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:30,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:30,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:30,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:30,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:30,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:30,484 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 [2024-02-10 01:02:30,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:30,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:30,488 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:30,489 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:30,493 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:30,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:30,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:30,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:30,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:30,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:30,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:30,536 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:02:30,557 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 01:02:30,558 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 01:02:30,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:30,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:30,563 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:30,569 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:02:30,579 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:30,595 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:02:30,595 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:02:30,596 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(T1Thread1of1ForFork0_i, N) = -1*T1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2024-02-10 01:02:30,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-02-10 01:02:30,609 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:02:30,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:30,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:02:30,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:30,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:02:30,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:30,732 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:30,783 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 [2024-02-10 01:02:30,787 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:30,940 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 9 states and 309 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:02:30,942 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:02:30,942 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:02:30,944 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 01:02:30,985 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 01:02:30,985 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:02:30,993 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 [2024-02-10 01:02:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-02-10 01:02:31,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 119 transitions. Stem has 3 letters. Loop has 3 letters. [2024-02-10 01:02:31,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:31,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 119 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-10 01:02:31,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:31,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 119 transitions. Stem has 3 letters. Loop has 6 letters. [2024-02-10 01:02:31,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:31,020 INFO L428 stractBuchiCegarLoop]: Abstraction has has 35 places, 257 transitions, 1169 flow [2024-02-10 01:02:31,021 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:02:31,021 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 places, 257 transitions, 1169 flow [2024-02-10 01:02:31,101 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:31,101 INFO L124 PetriNetUnfolderBase]: 135/204 cut-off events. [2024-02-10 01:02:31,101 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-02-10 01:02:31,102 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:31,103 INFO L748 eck$LassoCheckResult]: Stem: 32#[$Ultimate##0]true [42] $Ultimate##0-->L45: Formula: (and (< v_ULTIMATE.start_m_1 v_N_1) (<= 0 v_ULTIMATE.start_m_1)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_1} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_1} AuxVars[] AssignedVars[] 34#[L45]true [67] L45-->$Ultimate##0: Formula: (= v_T1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_14, T1Thread1of1ForFork0_thidvar0=v_T1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T1Thread1of1ForFork0_i, T1Thread1of1ForFork0_thidvar0] 36#[L45-1, $Ultimate##0]true [70] L45-1-->$Ultimate##0: Formula: (and (= v_T2Thread1of1ForFork1_thidvar1_2 2) (= v_T2Thread1of1ForFork1_thidvar0_2 2)) InVars {} OutVars{T2Thread1of1ForFork1_thidvar0=v_T2Thread1of1ForFork1_thidvar0_2, T2Thread1of1ForFork1_thidvar1=v_T2Thread1of1ForFork1_thidvar1_2, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_16} AuxVars[] AssignedVars[T2Thread1of1ForFork1_thidvar0, T2Thread1of1ForFork1_thidvar1, T2Thread1of1ForFork1_j] 100#[L46, $Ultimate##0, $Ultimate##0]true [58] $Ultimate##0-->L31-1: Formula: (= v_T2Thread1of1ForFork1_j_1 0) InVars {} OutVars{T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[T2Thread1of1ForFork1_j] 102#[L31-1, L46, $Ultimate##0]true [60] L31-1-->L32: Formula: (< v_T2Thread1of1ForFork1_j_5 v_N_4) InVars {T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_5, N=v_N_4} OutVars{T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_5, N=v_N_4} AuxVars[] AssignedVars[] 104#[L32, L46, $Ultimate##0]true [62] L32-->L33: Formula: (= (store v_C_4 v_T2Thread1of1ForFork1_j_7 (+ (select v_B_5 v_T2Thread1of1ForFork1_j_7) (select v_A_5 v_T2Thread1of1ForFork1_j_7))) v_C_3) InVars {A=v_A_5, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_7, C=v_C_4, B=v_B_5} OutVars{A=v_A_5, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_7, C=v_C_3, B=v_B_5} AuxVars[] AssignedVars[C] 106#[L46, L33, $Ultimate##0]true [63] L33-->L34: Formula: (= (store v_D_2 v_T2Thread1of1ForFork1_j_9 (+ (select v_A_6 v_T2Thread1of1ForFork1_j_9) (* (- 1) (select v_B_6 v_T2Thread1of1ForFork1_j_9)))) v_D_1) InVars {A=v_A_6, D=v_D_2, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_9, B=v_B_6} OutVars{A=v_A_6, D=v_D_1, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_9, B=v_B_6} AuxVars[] AssignedVars[D] 108#[L34, L46, $Ultimate##0]true [64] L34-->L31-1: Formula: (= v_T2Thread1of1ForFork1_j_12 (+ v_T2Thread1of1ForFork1_j_11 1)) InVars {T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_11} OutVars{T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_12} AuxVars[] AssignedVars[T2Thread1of1ForFork1_j] 102#[L31-1, L46, $Ultimate##0]true [2024-02-10 01:02:31,103 INFO L750 eck$LassoCheckResult]: Loop: 102#[L31-1, L46, $Ultimate##0]true [60] L31-1-->L32: Formula: (< v_T2Thread1of1ForFork1_j_5 v_N_4) InVars {T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_5, N=v_N_4} OutVars{T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_5, N=v_N_4} AuxVars[] AssignedVars[] 104#[L32, L46, $Ultimate##0]true [62] L32-->L33: Formula: (= (store v_C_4 v_T2Thread1of1ForFork1_j_7 (+ (select v_B_5 v_T2Thread1of1ForFork1_j_7) (select v_A_5 v_T2Thread1of1ForFork1_j_7))) v_C_3) InVars {A=v_A_5, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_7, C=v_C_4, B=v_B_5} OutVars{A=v_A_5, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_7, C=v_C_3, B=v_B_5} AuxVars[] AssignedVars[C] 106#[L46, L33, $Ultimate##0]true [63] L33-->L34: Formula: (= (store v_D_2 v_T2Thread1of1ForFork1_j_9 (+ (select v_A_6 v_T2Thread1of1ForFork1_j_9) (* (- 1) (select v_B_6 v_T2Thread1of1ForFork1_j_9)))) v_D_1) InVars {A=v_A_6, D=v_D_2, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_9, B=v_B_6} OutVars{A=v_A_6, D=v_D_1, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_9, B=v_B_6} AuxVars[] AssignedVars[D] 108#[L34, L46, $Ultimate##0]true [64] L34-->L31-1: Formula: (= v_T2Thread1of1ForFork1_j_12 (+ v_T2Thread1of1ForFork1_j_11 1)) InVars {T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_11} OutVars{T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_12} AuxVars[] AssignedVars[T2Thread1of1ForFork1_j] 102#[L31-1, L46, $Ultimate##0]true [2024-02-10 01:02:31,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:31,106 INFO L85 PathProgramCache]: Analyzing trace with hash -231206095, now seen corresponding path program 1 times [2024-02-10 01:02:31,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:31,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611424596] [2024-02-10 01:02:31,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:31,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:31,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:31,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:31,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:31,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2772580, now seen corresponding path program 1 times [2024-02-10 01:02:31,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:31,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218924293] [2024-02-10 01:02:31,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:31,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:31,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:31,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:31,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:31,185 INFO L85 PathProgramCache]: Analyzing trace with hash 616909204, now seen corresponding path program 2 times [2024-02-10 01:02:31,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065837361] [2024-02-10 01:02:31,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:31,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:31,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:31,370 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:02:31,370 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:02:31,370 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:02:31,370 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:02:31,370 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:02:31,370 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:31,370 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:02:31,371 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:02:31,371 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum_diff_incr_decr.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:02:31,371 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:02:31,371 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:02:31,373 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:31,376 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:31,378 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:31,380 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:31,418 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:31,503 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:02:31,503 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:02:31,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:31,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:31,505 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:31,512 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:31,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:31,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:31,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:31,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:31,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:31,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:31,532 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:31,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:31,556 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 [2024-02-10 01:02:31,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:31,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:31,559 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:31,565 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:31,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:31,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:02:31,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:31,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:31,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:31,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:02:31,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:02:31,580 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:31,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:31,606 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:31,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:31,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:31,608 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:31,615 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:31,624 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:31,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:31,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:31,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:31,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:31,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:31,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:31,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:31,656 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:31,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:31,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:31,658 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:31,661 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:31,662 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:31,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:31,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:02:31,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:31,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:31,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:31,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:02:31,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:02:31,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:31,692 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:31,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:31,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:31,696 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:31,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:02:31,710 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:31,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:31,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:31,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:31,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:31,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:31,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:31,740 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:02:31,748 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:02:31,749 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 01:02:31,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:31,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:31,754 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:31,796 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:31,796 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:31,797 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:02:31,830 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:02:31,830 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:02:31,830 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(T2Thread1of1ForFork1_j, N) = -1*T2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2024-02-10 01:02:31,840 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:31,843 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:02:31,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:31,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:02:31,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:31,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:02:31,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:31,926 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:31,930 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 [2024-02-10 01:02:31,931 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:32,056 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 9 states and 309 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:02:32,057 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:02:32,057 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:02:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 309 transitions. [2024-02-10 01:02:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 309 transitions. [2024-02-10 01:02:32,087 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:02:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 309 transitions. [2024-02-10 01:02:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 309 transitions. [2024-02-10 01:02:32,262 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:32,284 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 01:02:32,284 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:02:32,284 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 [2024-02-10 01:02:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-02-10 01:02:32,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 119 transitions. Stem has 8 letters. Loop has 4 letters. [2024-02-10 01:02:32,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:32,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 119 transitions. Stem has 12 letters. Loop has 4 letters. [2024-02-10 01:02:32,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:32,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 119 transitions. Stem has 8 letters. Loop has 8 letters. [2024-02-10 01:02:32,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:32,287 INFO L428 stractBuchiCegarLoop]: Abstraction has has 48 places, 4070 transitions, 26544 flow [2024-02-10 01:02:32,287 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:02:32,287 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 places, 4070 transitions, 26544 flow [2024-02-10 01:02:32,931 INFO L124 PetriNetUnfolderBase]: 1452/2006 cut-off events. [2024-02-10 01:02:32,931 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2024-02-10 01:02:32,931 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2024-02-10 01:02:32,940 INFO L201 PluginConnector]: Adding new model sum_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:02:32 BoogieIcfgContainer [2024-02-10 01:02:32,941 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:02:32,946 INFO L158 Benchmark]: Toolchain (without parser) took 3451.31ms. Allocated memory was 158.3MB in the beginning and 266.3MB in the end (delta: 108.0MB). Free memory was 127.6MB in the beginning and 187.7MB in the end (delta: -60.1MB). Peak memory consumption was 156.6MB. Max. memory is 8.0GB. [2024-02-10 01:02:32,946 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 158.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:02:32,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.65ms. Allocated memory was 158.3MB in the beginning and 266.3MB in the end (delta: 108.0MB). Free memory was 127.6MB in the beginning and 240.5MB in the end (delta: -112.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-10 01:02:32,949 INFO L158 Benchmark]: Boogie Preprocessor took 40.91ms. Allocated memory is still 266.3MB. Free memory was 240.5MB in the beginning and 240.7MB in the end (delta: -240.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:02:32,949 INFO L158 Benchmark]: RCFGBuilder took 252.67ms. Allocated memory is still 266.3MB. Free memory was 240.7MB in the beginning and 230.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 01:02:32,949 INFO L158 Benchmark]: BuchiAutomizer took 3113.48ms. Allocated memory is still 266.3MB. Free memory was 230.3MB in the beginning and 187.7MB in the end (delta: 42.6MB). Peak memory consumption was 152.5MB. Max. memory is 8.0GB. [2024-02-10 01:02:32,955 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.13ms. Allocated memory is still 158.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.65ms. Allocated memory was 158.3MB in the beginning and 266.3MB in the end (delta: 108.0MB). Free memory was 127.6MB in the beginning and 240.5MB in the end (delta: -112.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.91ms. Allocated memory is still 266.3MB. Free memory was 240.5MB in the beginning and 240.7MB in the end (delta: -240.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 252.67ms. Allocated memory is still 266.3MB. Free memory was 240.7MB in the beginning and 230.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 3113.48ms. Allocated memory is still 266.3MB. Free memory was 230.3MB in the beginning and 187.7MB in the end (delta: 42.6MB). Peak memory consumption was 152.5MB. 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function N + -1 * j and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. 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, 132 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 164 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 92 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf100 lsp91 ukn48 mio100 lsp84 div100 bol100 ite100 ukn100 eq143 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms 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.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-10 01:02:32,988 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...