/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 true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-decr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:25:50,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:25:50,717 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 00:25:50,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:25:50,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:25:50,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:25:50,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:25:50,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:25:50,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:25:50,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:25:50,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:25:50,775 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:25:50,775 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:25:50,775 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:25:50,775 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:25:50,776 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:25:50,776 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:25:50,776 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:25:50,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:25:50,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:25:50,777 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:25:50,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:25:50,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:25:50,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:25:50,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:25:50,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:25:50,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:25:50,780 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:25:50,780 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:25:50,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:25:50,781 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:25:50,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:25:50,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:25:50,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:25:50,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:25:50,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:25:50,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:25:50,783 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:25:50,783 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 -> true [2024-02-10 00:25:51,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:25:51,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:25:51,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:25:51,112 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:25:51,113 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:25:51,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-decr.bpl [2024-02-10 00:25:51,114 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-decr.bpl' [2024-02-10 00:25:51,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:25:51,144 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:25:51,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:25:51,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:25:51,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:25:51,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:51" (1/1) ... [2024-02-10 00:25:51,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:51" (1/1) ... [2024-02-10 00:25:51,190 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:25:51,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:25:51,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:25:51,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:25:51,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:25:51,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:51" (1/1) ... [2024-02-10 00:25:51,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:51" (1/1) ... [2024-02-10 00:25:51,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:51" (1/1) ... [2024-02-10 00:25:51,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:51" (1/1) ... [2024-02-10 00:25:51,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:51" (1/1) ... [2024-02-10 00:25:51,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:51" (1/1) ... [2024-02-10 00:25:51,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:51" (1/1) ... [2024-02-10 00:25:51,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:51" (1/1) ... [2024-02-10 00:25:51,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:25:51,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:25:51,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:25:51,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:25:51,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:51" (1/1) ... [2024-02-10 00:25:51,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:51,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:51,258 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 00:25:51,280 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 00:25:51,305 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 00:25:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:25:51,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:25:51,306 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 00:25:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:25:51,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:25:51,306 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:25:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:25:51,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:25:51,307 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 00:25:51,351 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:25:51,353 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:25:51,473 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:25:51,478 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:25:51,478 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:25:51,480 INFO L201 PluginConnector]: Adding new model map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:25:51 BoogieIcfgContainer [2024-02-10 00:25:51,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:25:51,484 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:25:51,485 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:25:51,489 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:25:51,489 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:25:51,489 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:51" (1/2) ... [2024-02-10 00:25:51,491 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bd07196 and model type map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:25:51, skipping insertion in model container [2024-02-10 00:25:51,491 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:25:51,491 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:25:51" (2/2) ... [2024-02-10 00:25:51,494 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-incr-decr.bpl [2024-02-10 00:25:51,571 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:25:51,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 66 flow [2024-02-10 00:25:51,618 INFO L124 PetriNetUnfolderBase]: 2/22 cut-off events. [2024-02-10 00:25:51,618 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:25:51,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 2/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2024-02-10 00:25:51,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 66 flow [2024-02-10 00:25:51,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 22 transitions, 56 flow [2024-02-10 00:25:51,634 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:25:51,634 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:25:51,635 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:25:51,635 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:25:51,635 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:25:51,635 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:25:51,635 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:25:51,635 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:25:51,635 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:51,636 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 27 places, 22 transitions, 56 flow [2024-02-10 00:25:51,656 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 56 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 55 states have internal predecessors, (104), 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 00:25:51,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 56 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 55 states have internal predecessors, (104), 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 00:25:51,683 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2024-02-10 00:25:51,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:51,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:51,688 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:25:51,688 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:51,688 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 27 places, 22 transitions, 56 flow [2024-02-10 00:25:51,694 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 56 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 55 states have internal predecessors, (104), 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 00:25:51,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 56 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 55 states have internal predecessors, (104), 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 00:25:51,698 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2024-02-10 00:25:51,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:51,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:51,706 INFO L748 eck$LassoCheckResult]: Stem: Black: 146#[$Ultimate##0]don't care [43] $Ultimate##0-->L17: Formula: (= v_B_1 v_A_5) InVars {A=v_A_5} OutVars{A=v_A_5, B=v_B_1} AuxVars[] AssignedVars[B] 149#[L17]don't care [35] L17-->L18: Formula: (and (<= 0 v_k_1) (< v_k_1 v_N_5)) InVars {k=v_k_1, N=v_N_5} OutVars{k=v_k_1, N=v_N_5} AuxVars[] AssignedVars[] 151#[L18]don't care [37] L18-->L20: Formula: (= (select v_A_6 v_k_2) v_ULTIMATE.start_x_1) InVars {A=v_A_6, k=v_k_2} OutVars{A=v_A_6, ULTIMATE.start_x=v_ULTIMATE.start_x_1, k=v_k_2} AuxVars[] AssignedVars[ULTIMATE.start_x] 153#[L20]don't care [66] L20-->$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] 155#[$Ultimate##0, L20-1]don't care [52] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 157#[L34-1, L20-1]don't care [2024-02-10 00:25:51,706 INFO L750 eck$LassoCheckResult]: Loop: 157#[L34-1, L20-1]don't care [54] L34-1-->L35: 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[] 165#[L35, L20-1]don't care [56] L35-->L37: 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] 177#[L37, L20-1]don't care [57] L37-->L34-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] 157#[L34-1, L20-1]don't care [2024-02-10 00:25:51,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:51,715 INFO L85 PathProgramCache]: Analyzing trace with hash 69420894, now seen corresponding path program 1 times [2024-02-10 00:25:51,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:51,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502487621] [2024-02-10 00:25:51,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:51,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash 83478, now seen corresponding path program 1 times [2024-02-10 00:25:51,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:51,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404430146] [2024-02-10 00:25:51,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:51,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:51,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:51,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2056329831, now seen corresponding path program 1 times [2024-02-10 00:25:51,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:51,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291141543] [2024-02-10 00:25:51,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:51,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:52,078 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:25:52,079 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:25:52,079 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:25:52,079 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:25:52,079 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:25:52,079 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:52,079 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:25:52,079 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:25:52,080 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-incr-decr.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:25:52,080 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:25:52,081 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:25:52,096 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 00:25:52,109 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 00:25:52,260 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:25:52,268 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:25:52,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:52,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:52,273 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 00:25:52,280 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 00:25:52,281 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 00:25:52,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:52,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:52,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:52,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:52,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:52,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:52,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:52,319 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 00:25:52,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:52,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:52,323 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 00:25:52,356 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 00:25:52,362 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 00:25:52,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:52,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:52,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:52,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:52,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:52,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:52,407 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:25:52,419 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 00:25:52,420 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 00:25:52,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:52,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:52,424 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 00:25:52,426 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 00:25:52,427 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:25:52,445 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:25:52,445 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:25:52,446 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2024-02-10 00:25:52,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:52,455 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:25:52,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:52,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:25:52,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:52,519 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:25:52,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:52,569 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 00:25:52,585 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 00:25:52,623 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 00:25:52,625 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 00:25:52,827 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 322 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:25:52,828 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:25:52,828 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:25:52,830 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:25:52,872 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:25:52,873 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:25:52,875 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 00:25:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 00:25:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-02-10 00:25:52,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 5 letters. Loop has 3 letters. [2024-02-10 00:25:52,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:52,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 8 letters. Loop has 3 letters. [2024-02-10 00:25:52,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:52,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 5 letters. Loop has 6 letters. [2024-02-10 00:25:52,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:52,883 INFO L428 stractBuchiCegarLoop]: Abstraction has has 36 places, 270 transitions, 1221 flow [2024-02-10 00:25:52,883 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:25:52,883 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:52,883 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 36 places, 270 transitions, 1221 flow [2024-02-10 00:25:52,910 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 116 states, 110 states have (on average 2.8727272727272726) internal successors, (316), 115 states have internal predecessors, (316), 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 00:25:52,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 116 states, 110 states have (on average 2.8727272727272726) internal successors, (316), 115 states have internal predecessors, (316), 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 00:25:52,917 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2024-02-10 00:25:52,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:52,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:52,919 INFO L748 eck$LassoCheckResult]: Stem: Black: 308#[$Ultimate##0]don't care [43] $Ultimate##0-->L17: Formula: (= v_B_1 v_A_5) InVars {A=v_A_5} OutVars{A=v_A_5, B=v_B_1} AuxVars[] AssignedVars[B] 314#[L17]don't care [35] L17-->L18: Formula: (and (<= 0 v_k_1) (< v_k_1 v_N_5)) InVars {k=v_k_1, N=v_N_5} OutVars{k=v_k_1, N=v_N_5} AuxVars[] AssignedVars[] 319#[L18]don't care [37] L18-->L20: Formula: (= (select v_A_6 v_k_2) v_ULTIMATE.start_x_1) InVars {A=v_A_6, k=v_k_2} OutVars{A=v_A_6, ULTIMATE.start_x=v_ULTIMATE.start_x_1, k=v_k_2} AuxVars[] AssignedVars[ULTIMATE.start_x] 324#[L20]don't care [66] L20-->$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] 329#[L20-1, $Ultimate##0]don't care [69] L20-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] 337#[$Ultimate##0, $Ultimate##0, L21]don't care [58] $Ultimate##0-->L47-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 360#[L47-1, $Ultimate##0, L21]don't care [2024-02-10 00:25:52,920 INFO L750 eck$LassoCheckResult]: Loop: 360#[L47-1, $Ultimate##0, L21]don't care [60] L47-1-->L48: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[] 398#[$Ultimate##0, L21, L48]don't care [62] L48-->L50: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ (- 1) (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) 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] 444#[$Ultimate##0, L50, L21]don't care [63] L50-->L47-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] 360#[L47-1, $Ultimate##0, L21]don't care [2024-02-10 00:25:52,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:52,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2142918997, now seen corresponding path program 1 times [2024-02-10 00:25:52,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:52,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807914464] [2024-02-10 00:25:52,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:52,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:52,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:52,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:52,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:52,935 INFO L85 PathProgramCache]: Analyzing trace with hash 89436, now seen corresponding path program 1 times [2024-02-10 00:25:52,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:52,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779869010] [2024-02-10 00:25:52,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:52,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:52,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:52,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:52,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash 694107762, now seen corresponding path program 1 times [2024-02-10 00:25:52,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:52,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317336251] [2024-02-10 00:25:52,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:52,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:52,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:52,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:53,050 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:25:53,050 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:25:53,050 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:25:53,050 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:25:53,050 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:25:53,050 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:53,051 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:25:53,051 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:25:53,051 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-incr-decr.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:25:53,051 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:25:53,051 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:25:53,052 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 00:25:53,056 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 00:25:53,060 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 00:25:53,081 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 00:25:53,086 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 00:25:53,151 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:25:53,151 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:25:53,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:53,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:53,170 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 00:25:53,210 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 00:25:53,214 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 00:25:53,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:53,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:53,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:53,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:53,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:53,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:53,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:53,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:53,232 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 00:25:53,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:53,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:53,234 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 00:25:53,250 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 00:25:53,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:53,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:53,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:53,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:53,260 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 00:25:53,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:53,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:53,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:53,287 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 00:25:53,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:53,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:53,297 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 00:25:53,303 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 00:25:53,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:53,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:53,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:53,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:53,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:53,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:53,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:53,320 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 00:25:53,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:53,335 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 00:25:53,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:53,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:53,337 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 00:25:53,339 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 00:25:53,340 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 00:25:53,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:53,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:53,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:53,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:53,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:53,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:53,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:53,405 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 00:25:53,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:53,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:53,410 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 00:25:53,415 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 00:25:53,417 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 00:25:53,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:53,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:53,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:53,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:53,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:53,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:53,452 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:25:53,460 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 00:25:53,461 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 00:25:53,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:53,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:53,481 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 00:25:53,482 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 00:25:53,484 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:25:53,501 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:25:53,501 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:25:53,502 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 1*N Supporting invariants [] [2024-02-10 00:25:53,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-02-10 00:25:53,531 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:25:53,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:53,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:25:53,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:53,567 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:25:53,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:53,594 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 00:25:53,595 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 00:25:53,595 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:53,686 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 322 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:25:53,686 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:25:53,686 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:25:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 322 transitions. [2024-02-10 00:25:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 322 transitions. [2024-02-10 00:25:53,697 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:25:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 322 transitions. [2024-02-10 00:25:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 322 transitions. [2024-02-10 00:25:53,777 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-10 00:25:53,938 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:25:53,938 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:25:53,939 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 00:25:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-02-10 00:25:53,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-10 00:25:53,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:53,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 9 letters. Loop has 3 letters. [2024-02-10 00:25:53,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:53,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 6 letters. Loop has 6 letters. [2024-02-10 00:25:53,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:53,941 INFO L428 stractBuchiCegarLoop]: Abstraction has has 49 places, 4291 transitions, 27870 flow [2024-02-10 00:25:53,941 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:25:53,941 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:53,941 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 49 places, 4291 transitions, 27870 flow [2024-02-10 00:25:54,084 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 286 states, 256 states have (on average 3.8203125) internal successors, (978), 285 states have internal predecessors, (978), 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 00:25:54,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 286 states, 256 states have (on average 3.8203125) internal successors, (978), 285 states have internal predecessors, (978), 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 00:25:54,096 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 00:25:54,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 00:25:54,103 INFO L201 PluginConnector]: Adding new model map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:25:54 BoogieIcfgContainer [2024-02-10 00:25:54,103 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:25:54,104 INFO L158 Benchmark]: Toolchain (without parser) took 2959.10ms. Allocated memory was 163.6MB in the beginning and 281.0MB in the end (delta: 117.4MB). Free memory was 132.4MB in the beginning and 178.3MB in the end (delta: -45.9MB). Peak memory consumption was 111.4MB. Max. memory is 8.0GB. [2024-02-10 00:25:54,104 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 163.6MB. Free memory was 133.5MB in the beginning and 133.4MB in the end (delta: 96.4kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:25:54,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.71ms. Allocated memory is still 163.6MB. Free memory was 132.3MB in the beginning and 137.7MB in the end (delta: -5.3MB). Peak memory consumption was 4.3MB. Max. memory is 8.0GB. [2024-02-10 00:25:54,105 INFO L158 Benchmark]: Boogie Preprocessor took 19.86ms. Allocated memory is still 163.6MB. Free memory was 137.6MB in the beginning and 136.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:25:54,105 INFO L158 Benchmark]: RCFGBuilder took 264.14ms. Allocated memory is still 163.6MB. Free memory was 136.6MB in the beginning and 127.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-02-10 00:25:54,106 INFO L158 Benchmark]: BuchiAutomizer took 2618.62ms. Allocated memory was 163.6MB in the beginning and 281.0MB in the end (delta: 117.4MB). Free memory was 127.0MB in the beginning and 178.3MB in the end (delta: -51.4MB). Peak memory consumption was 107.1MB. Max. memory is 8.0GB. [2024-02-10 00:25:54,108 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 163.6MB. Free memory was 133.5MB in the beginning and 133.4MB in the end (delta: 96.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.71ms. Allocated memory is still 163.6MB. Free memory was 132.3MB in the beginning and 137.7MB in the end (delta: -5.3MB). Peak memory consumption was 4.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.86ms. Allocated memory is still 163.6MB. Free memory was 137.6MB in the beginning and 136.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 264.14ms. Allocated memory is still 163.6MB. Free memory was 136.6MB in the beginning and 127.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2618.62ms. Allocated memory was 163.6MB in the beginning and 281.0MB in the end (delta: 117.4MB). Free memory was 127.0MB in the beginning and 178.3MB in the end (delta: -51.4MB). Peak memory consumption was 107.1MB. 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 -1 * i + N and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s 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, 139 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 104 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital47 mio100 ax100 hnf100 lsp87 ukn70 mio100 lsp79 div100 bol100 ite100 ukn100 eq143 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms 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 00:25:54,147 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...