/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 -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-split.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:50:55,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:50:55,316 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-09 23:50:55,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:50:55,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:50:55,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:50:55,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:50:55,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:50:55,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:50:55,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:50:55,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:50:55,350 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:50:55,350 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:50:55,351 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:50:55,351 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:50:55,351 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:50:55,352 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:50:55,352 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:50:55,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:50:55,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:50:55,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:50:55,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:50:55,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:50:55,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:50:55,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:50:55,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:50:55,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:50:55,359 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:50:55,359 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:50:55,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:50:55,360 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:50:55,360 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:50:55,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:50:55,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:50:55,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:50:55,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:50:55,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:50:55,362 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:50:55,362 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 [2024-02-09 23:50:55,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:50:55,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:50:55,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:50:55,706 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:50:55,707 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:50:55,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-split.bpl [2024-02-09 23:50:55,708 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-split.bpl' [2024-02-09 23:50:55,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:50:55,730 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:50:55,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:50:55,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:50:55,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:50:55,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:50:55" (1/1) ... [2024-02-09 23:50:55,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:50:55" (1/1) ... [2024-02-09 23:50:55,766 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-09 23:50:55,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:50:55,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:50:55,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:50:55,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:50:55,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:50:55" (1/1) ... [2024-02-09 23:50:55,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:50:55" (1/1) ... [2024-02-09 23:50:55,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:50:55" (1/1) ... [2024-02-09 23:50:55,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:50:55" (1/1) ... [2024-02-09 23:50:55,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:50:55" (1/1) ... [2024-02-09 23:50:55,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:50:55" (1/1) ... [2024-02-09 23:50:55,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:50:55" (1/1) ... [2024-02-09 23:50:55,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:50:55" (1/1) ... [2024-02-09 23:50:55,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:50:55,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:50:55,840 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:50:55,840 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:50:55,841 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:50:55" (1/1) ... [2024-02-09 23:50:55,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:50:55,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:50:55,878 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-09 23:50:55,899 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-09 23:50:55,934 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-09 23:50:55,934 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-09 23:50:55,934 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-09 23:50:55,935 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-09 23:50:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-09 23:50:55,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-09 23:50:55,935 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:50:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:50:55,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:50:55,936 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:50:55,986 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:50:55,988 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:50:56,097 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:50:56,103 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:50:56,103 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-09 23:50:56,105 INFO L201 PluginConnector]: Adding new model map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:50:56 BoogieIcfgContainer [2024-02-09 23:50:56,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:50:56,106 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:50:56,106 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:50:56,113 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:50:56,114 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:50:56,114 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:50:55" (1/2) ... [2024-02-09 23:50:56,116 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1455899a and model type map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:50:56, skipping insertion in model container [2024-02-09 23:50:56,116 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:50:56,116 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:50:56" (2/2) ... [2024-02-09 23:50:56,117 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-incr-split.bpl [2024-02-09 23:50:56,190 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-09 23:50:56,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 64 flow [2024-02-09 23:50:56,236 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2024-02-09 23:50:56,236 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:50:56,240 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 24 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2024-02-09 23:50:56,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 64 flow [2024-02-09 23:50:56,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2024-02-09 23:50:56,250 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:50:56,250 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:50:56,250 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:50:56,250 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:50:56,250 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:50:56,250 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:50:56,251 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:50:56,251 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:50:56,251 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 places, 21 transitions, 54 flow [2024-02-09 23:50:56,257 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:50:56,257 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-02-09 23:50:56,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-09 23:50:56,257 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:50:56,260 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:50:56,260 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 places, 21 transitions, 54 flow [2024-02-09 23:50:56,263 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:50:56,263 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-02-09 23:50:56,263 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-09 23:50:56,264 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:50:56,268 INFO L748 eck$LassoCheckResult]: Stem: 32#[$Ultimate##0]true [45] $Ultimate##0-->L17: Formula: (and (<= 0 v_k_1) (< v_k_1 (* 2 v_N_6))) InVars {k=v_k_1, N=v_N_6} OutVars{k=v_k_1, N=v_N_6} AuxVars[] AssignedVars[] 34#[L17]true [38] L17-->L19: Formula: (= (select v_A_5 v_k_2) v_ULTIMATE.start_x_1) InVars {A=v_A_5, k=v_k_2} OutVars{A=v_A_5, ULTIMATE.start_x=v_ULTIMATE.start_x_1, k=v_k_2} AuxVars[] AssignedVars[ULTIMATE.start_x] 36#[L19]true [64] L19-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 38#[$Ultimate##0, L19-1]true [50] $Ultimate##0-->L33-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 40#[L33-1, L19-1]true [2024-02-09 23:50:56,269 INFO L750 eck$LassoCheckResult]: Loop: 40#[L33-1, L19-1]true [52] L33-1-->L34: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[] 43#[L34, L19-1]true [54] L34-->L35: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 1))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A] 45#[L19-1, L35]true [55] L35-->L33-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 40#[L33-1, L19-1]true [2024-02-09 23:50:56,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:50:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2302668, now seen corresponding path program 1 times [2024-02-09 23:50:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:50:56,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140778345] [2024-02-09 23:50:56,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:50:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:50:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:50:56,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:50:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:50:56,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:50:56,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:50:56,379 INFO L85 PathProgramCache]: Analyzing trace with hash 81492, now seen corresponding path program 1 times [2024-02-09 23:50:56,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:50:56,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900203753] [2024-02-09 23:50:56,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:50:56,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:50:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:50:56,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:50:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:50:56,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:50:56,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:50:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash -120642647, now seen corresponding path program 1 times [2024-02-09 23:50:56,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:50:56,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177153872] [2024-02-09 23:50:56,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:50:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:50:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:50:56,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:50:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:50:56,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:50:56,538 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:50:56,538 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:50:56,539 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:50:56,539 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:50:56,539 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:50:56,539 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:50:56,539 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:50:56,539 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:50:56,539 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-incr-split.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:50:56,539 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:50:56,540 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:50:56,556 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-09 23:50:56,566 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-09 23:50:56,695 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:50:56,699 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:50:56,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:50:56,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:50:56,706 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-09 23:50:56,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-09 23:50:56,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:50:56,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:50:56,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:50:56,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:50:56,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:50:56,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:50:56,733 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-09 23:50:56,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:50:56,757 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-09 23:50:56,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:50:56,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:50:56,760 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-09 23:50:56,768 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-09 23:50:56,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:50:56,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:50:56,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:50:56,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:50:56,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:50:56,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:50:56,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:50:56,781 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-09 23:50:56,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:50:56,801 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-09 23:50:56,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:50:56,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:50:56,803 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-09 23:50:56,809 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-09 23:50:56,816 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-09 23:50:56,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:50:56,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:50:56,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:50:56,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:50:56,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:50:56,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:50:56,848 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:50:56,864 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-09 23:50:56,864 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-09 23:50:56,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:50:56,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:50:56,869 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-09 23:50:56,871 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:50:56,879 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-09 23:50:56,889 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:50:56,890 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:50:56,890 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2024-02-09 23:50:56,897 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-09 23:50:56,900 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:50:56,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:50:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:50:56,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:50:56,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:50:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:50:56,967 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:50:56,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:50:57,006 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-09 23:50:57,051 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-09 23:50:57,055 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:50:57,219 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 309 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:50:57,221 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:50:57,221 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:50:57,228 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:50:57,228 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:50:57,232 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-09 23:50:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:50:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-02-09 23:50:57,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 119 transitions. Stem has 4 letters. Loop has 3 letters. [2024-02-09 23:50:57,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:50:57,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 119 transitions. Stem has 7 letters. Loop has 3 letters. [2024-02-09 23:50:57,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:50:57,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 119 transitions. Stem has 4 letters. Loop has 6 letters. [2024-02-09 23:50:57,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:50:57,248 INFO L428 stractBuchiCegarLoop]: Abstraction has has 44 places, 514 transitions, 2338 flow [2024-02-09 23:50:57,248 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:50:57,248 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 44 places, 514 transitions, 2338 flow [2024-02-09 23:50:57,301 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:50:57,302 INFO L124 PetriNetUnfolderBase]: 99/169 cut-off events. [2024-02-09 23:50:57,302 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-09 23:50:57,302 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:50:57,303 INFO L748 eck$LassoCheckResult]: Stem: 32#[$Ultimate##0]true [45] $Ultimate##0-->L17: Formula: (and (<= 0 v_k_1) (< v_k_1 (* 2 v_N_6))) InVars {k=v_k_1, N=v_N_6} OutVars{k=v_k_1, N=v_N_6} AuxVars[] AssignedVars[] 34#[L17]true [38] L17-->L19: Formula: (= (select v_A_5 v_k_2) v_ULTIMATE.start_x_1) InVars {A=v_A_5, k=v_k_2} OutVars{A=v_A_5, ULTIMATE.start_x=v_ULTIMATE.start_x_1, k=v_k_2} AuxVars[] AssignedVars[ULTIMATE.start_x] 36#[L19]true [64] L19-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 38#[$Ultimate##0, L19-1]true [67] L19-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 116#[$Ultimate##0, $Ultimate##0, L20]true [56] $Ultimate##0-->L45-1: Formula: (= v_N_4 v_thread2Thread1of1ForFork1_i_1) InVars {N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1, N=v_N_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 118#[L45-1, $Ultimate##0, L20]true [58] L45-1-->L46: Formula: (< v_thread2Thread1of1ForFork1_i_5 (* 2 v_N_5)) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} AuxVars[] AssignedVars[] 120#[L46, $Ultimate##0, L20]true [60] L46-->L47: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ (select v_A_4 v_thread2Thread1of1ForFork1_i_7) 1)) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A] 122#[$Ultimate##0, L47, L20]true [61] L47-->L45-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 118#[L45-1, $Ultimate##0, L20]true [2024-02-09 23:50:57,303 INFO L750 eck$LassoCheckResult]: Loop: 118#[L45-1, $Ultimate##0, L20]true [58] L45-1-->L46: Formula: (< v_thread2Thread1of1ForFork1_i_5 (* 2 v_N_5)) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} AuxVars[] AssignedVars[] 120#[L46, $Ultimate##0, L20]true [60] L46-->L47: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ (select v_A_4 v_thread2Thread1of1ForFork1_i_7) 1)) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A] 122#[$Ultimate##0, L47, L20]true [61] L47-->L45-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 118#[L45-1, $Ultimate##0, L20]true [58] L45-1-->L46: Formula: (< v_thread2Thread1of1ForFork1_i_5 (* 2 v_N_5)) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} AuxVars[] AssignedVars[] 120#[L46, $Ultimate##0, L20]true [60] L46-->L47: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ (select v_A_4 v_thread2Thread1of1ForFork1_i_7) 1)) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A] 122#[$Ultimate##0, L47, L20]true [61] L47-->L45-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 118#[L45-1, $Ultimate##0, L20]true [2024-02-09 23:50:57,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:50:57,304 INFO L85 PathProgramCache]: Analyzing trace with hash 570868320, now seen corresponding path program 1 times [2024-02-09 23:50:57,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:50:57,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188003354] [2024-02-09 23:50:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:50:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:50:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:50:57,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:50:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:50:57,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:50:57,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:50:57,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1689686687, now seen corresponding path program 1 times [2024-02-09 23:50:57,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:50:57,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736260521] [2024-02-09 23:50:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:50:57,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:50:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:50:57,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:50:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:50:57,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:50:57,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:50:57,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1155093376, now seen corresponding path program 2 times [2024-02-09 23:50:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:50:57,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547897069] [2024-02-09 23:50:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:50:57,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:50:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:50:57,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:50:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:50:57,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:50:57,518 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-09 23:50:57,544 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:50:57,544 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:50:57,544 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:50:57,544 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:50:57,544 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:50:57,544 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:50:57,544 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:50:57,545 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:50:57,545 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-incr-split.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:50:57,545 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:50:57,545 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:50:57,547 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-09 23:50:57,549 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-09 23:50:57,552 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-09 23:50:57,646 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-09 23:50:57,649 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-09 23:50:57,731 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:50:57,732 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:50:57,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:50:57,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:50:57,733 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-09 23:50:57,739 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-09 23:50:57,740 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-09 23:50:57,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:50:57,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:50:57,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:50:57,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:50:57,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:50:57,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:50:57,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:50:57,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:50:57,766 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-09 23:50:57,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:50:57,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:50:57,768 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-09 23:50:57,771 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-09 23:50:57,772 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-09 23:50:57,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:50:57,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:50:57,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:50:57,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:50:57,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:50:57,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:50:57,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:50:57,808 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-09 23:50:57,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:50:57,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:50:57,810 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-09 23:50:57,820 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-09 23:50:57,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:50:57,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:50:57,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:50:57,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:50:57,836 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-09 23:50:57,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:50:57,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:50:57,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:50:57,856 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-09 23:50:57,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:50:57,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:50:57,858 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-09 23:50:57,859 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-09 23:50:57,860 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-09 23:50:57,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:50:57,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:50:57,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:50:57,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:50:57,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:50:57,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:50:57,904 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:50:57,918 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-02-09 23:50:57,918 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-09 23:50:57,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:50:57,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:50:57,921 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-09 23:50:57,934 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:50:57,943 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-09 23:50:57,953 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:50:57,953 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:50:57,953 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 2*N Supporting invariants [] [2024-02-09 23:50:57,964 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-09 23:50:57,968 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:50:57,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:50:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:50:57,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:50:57,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:50:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:50:58,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:50:58,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:50:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:50:58,077 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-09 23:50:58,077 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-09 23:50:58,157 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 286 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:50:58,157 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:50:58,158 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:50:58,212 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:50:58,212 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:50:58,212 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-09 23:50:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-09 23:50:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2024-02-09 23:50:58,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 8 letters. Loop has 6 letters. [2024-02-09 23:50:58,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:50:58,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 14 letters. Loop has 6 letters. [2024-02-09 23:50:58,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:50:58,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 8 letters. Loop has 12 letters. [2024-02-09 23:50:58,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:50:58,215 INFO L428 stractBuchiCegarLoop]: Abstraction has has 60 places, 11608 transitions, 75636 flow [2024-02-09 23:50:58,215 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:50:58,216 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60 places, 11608 transitions, 75636 flow [2024-02-09 23:50:58,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-02-09 23:50:59,494 INFO L124 PetriNetUnfolderBase]: 1994/2952 cut-off events. [2024-02-09 23:50:59,494 INFO L125 PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES. [2024-02-09 23:50:59,494 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2024-02-09 23:50:59,501 INFO L201 PluginConnector]: Adding new model map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:50:59 BoogieIcfgContainer [2024-02-09 23:50:59,501 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:50:59,502 INFO L158 Benchmark]: Toolchain (without parser) took 3771.63ms. Allocated memory was 165.7MB in the beginning and 478.2MB in the end (delta: 312.5MB). Free memory was 138.5MB in the beginning and 418.9MB in the end (delta: -280.4MB). Peak memory consumption was 158.4MB. Max. memory is 8.0GB. [2024-02-09 23:50:59,503 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 165.7MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:50:59,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.37ms. Allocated memory is still 165.7MB. Free memory was 138.2MB in the beginning and 136.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-09 23:50:59,504 INFO L158 Benchmark]: Boogie Preprocessor took 68.29ms. Allocated memory was 165.7MB in the beginning and 244.3MB in the end (delta: 78.6MB). Free memory was 136.9MB in the beginning and 221.9MB in the end (delta: -85.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:50:59,504 INFO L158 Benchmark]: RCFGBuilder took 264.93ms. Allocated memory is still 244.3MB. Free memory was 221.9MB in the beginning and 212.4MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-09 23:50:59,505 INFO L158 Benchmark]: BuchiAutomizer took 3395.24ms. Allocated memory was 244.3MB in the beginning and 478.2MB in the end (delta: 233.8MB). Free memory was 212.1MB in the beginning and 418.9MB in the end (delta: -206.8MB). Peak memory consumption was 154.3MB. Max. memory is 8.0GB. [2024-02-09 23:50:59,507 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.10ms. Allocated memory is still 165.7MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.37ms. Allocated memory is still 165.7MB. Free memory was 138.2MB in the beginning and 136.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.29ms. Allocated memory was 165.7MB in the beginning and 244.3MB in the end (delta: 78.6MB). Free memory was 136.9MB in the beginning and 221.9MB in the end (delta: -85.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 264.93ms. Allocated memory is still 244.3MB. Free memory was 221.9MB in the beginning and 212.4MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3395.24ms. Allocated memory was 244.3MB in the beginning and 478.2MB in the end (delta: 233.8MB). Free memory was 212.1MB in the beginning and 418.9MB in the end (delta: -206.8MB). Peak memory consumption was 154.3MB. 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 -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function 2 * N + -1 * i and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. 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: 3/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 169 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 94 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital61 mio100 ax100 hnf100 lsp90 ukn62 mio100 lsp80 div100 bol100 ite100 ukn100 eq142 hnf94 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms 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-09 23:50:59,526 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...