/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-split.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:01,235 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:01,303 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:37:01,329 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:01,330 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:01,330 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:01,331 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:01,332 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:01,332 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:01,335 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:01,335 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:01,335 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:01,335 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:01,336 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:01,337 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:01,337 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:01,337 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:01,337 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:01,338 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:01,338 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:01,338 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:01,339 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:01,339 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:01,339 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:01,339 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:01,340 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:01,340 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:01,340 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:01,340 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:01,340 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:01,341 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:01,341 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:01,341 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:01,342 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:01,343 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:37:01,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:01,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:01,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:01,525 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:01,526 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:01,527 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 [2023-10-12 17:37:01,527 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-split.bpl' [2023-10-12 17:37:01,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:01,544 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:01,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:01,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:01,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:01,554 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 12.10 05:37:01" (1/1) ... [2023-10-12 17:37:01,559 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 12.10 05:37:01" (1/1) ... [2023-10-12 17:37:01,563 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:01,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:01,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:01,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:01,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:01,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:01" (1/1) ... [2023-10-12 17:37:01,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:01" (1/1) ... [2023-10-12 17:37:01,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:01" (1/1) ... [2023-10-12 17:37:01,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:01" (1/1) ... [2023-10-12 17:37:01,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:01" (1/1) ... [2023-10-12 17:37:01,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:01" (1/1) ... [2023-10-12 17:37:01,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:01" (1/1) ... [2023-10-12 17:37:01,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:01" (1/1) ... [2023-10-12 17:37:01,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:01,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:01,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:01,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:01,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:01" (1/1) ... [2023-10-12 17:37:01,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:01,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:01,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:01,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:37:01,672 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:37:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:37:01,672 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:37:01,672 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:37:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:37:01,672 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:37:01,672 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:01,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:01,673 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:37:01,708 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:01,710 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:01,815 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:01,823 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:01,823 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:37:01,825 INFO L201 PluginConnector]: Adding new model map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:01 BoogieIcfgContainer [2023-10-12 17:37:01,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:01,835 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:01,835 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:01,872 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:01,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:01,873 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:01" (1/2) ... [2023-10-12 17:37:01,874 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1864df77 and model type map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:01, skipping insertion in model container [2023-10-12 17:37:01,874 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:01,874 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:01" (2/2) ... [2023-10-12 17:37:01,875 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-incr-split.bpl [2023-10-12 17:37:01,925 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:37:01,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 66 flow [2023-10-12 17:37:01,958 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2023-10-12 17:37:01,958 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:01,961 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. [2023-10-12 17:37:01,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 66 flow [2023-10-12 17:37:01,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2023-10-12 17:37:01,967 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:01,977 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 54 flow [2023-10-12 17:37:01,979 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 54 flow [2023-10-12 17:37:01,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 54 flow [2023-10-12 17:37:01,983 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2023-10-12 17:37:01,984 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:01,984 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. [2023-10-12 17:37:01,984 INFO L119 LiptonReduction]: Number of co-enabled transitions 96 [2023-10-12 17:37:02,168 INFO L134 LiptonReduction]: Checked pairs total: 70 [2023-10-12 17:37:02,168 INFO L136 LiptonReduction]: Total number of compositions: 8 [2023-10-12 17:37:02,177 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:02,178 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:02,178 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:02,178 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:02,178 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:02,178 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:02,178 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:02,178 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:02,178 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:37:02,181 ERROR L47 etriNetUnfolderRabin]: [1:1A:[75] $Ultimate##0-->L19: Formula: (and (<= 0 v_k_7) (< v_k_7 (* v_N_11 2)) (= (select v_A_30 v_k_7) v_ULTIMATE.start_x_6)) InVars {A=v_A_30, N=v_N_11, k=v_k_7} OutVars{A=v_A_30, N=v_N_11, k=v_k_7, ULTIMATE.start_x=v_ULTIMATE.start_x_6} AuxVars[] AssignedVars[ULTIMATE.start_x][8], 2:2A:[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][6], 3:3A:[50] $Ultimate##0-->L33-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i][0]][4:4A:[76] L33-1-->L33-1: Formula: (and (< v_thread1Thread1of1ForFork0_i_26 v_N_13) (= v_A_32 (store v_A_33 v_thread1Thread1of1ForFork0_i_26 (+ (select v_A_33 v_thread1Thread1of1ForFork0_i_26) 1))) (= v_thread1Thread1of1ForFork0_i_25 (+ v_thread1Thread1of1ForFork0_i_26 1))) InVars {A=v_A_33, N=v_N_13, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_26} OutVars{A=v_A_32, N=v_N_13, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_25} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i][12]] [2023-10-12 17:37:02,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:02,186 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:37:02,186 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:02,186 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:02,188 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:02,188 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:37:02,189 ERROR L47 etriNetUnfolderRabin]: [1:1A:[75] $Ultimate##0-->L19: Formula: (and (<= 0 v_k_7) (< v_k_7 (* v_N_11 2)) (= (select v_A_30 v_k_7) v_ULTIMATE.start_x_6)) InVars {A=v_A_30, N=v_N_11, k=v_k_7} OutVars{A=v_A_30, N=v_N_11, k=v_k_7, ULTIMATE.start_x=v_ULTIMATE.start_x_6} AuxVars[] AssignedVars[ULTIMATE.start_x][8], 2:2A:[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][6], 3:3A:[50] $Ultimate##0-->L33-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i][0]][4:4A:[76] L33-1-->L33-1: Formula: (and (< v_thread1Thread1of1ForFork0_i_26 v_N_13) (= v_A_32 (store v_A_33 v_thread1Thread1of1ForFork0_i_26 (+ (select v_A_33 v_thread1Thread1of1ForFork0_i_26) 1))) (= v_thread1Thread1of1ForFork0_i_25 (+ v_thread1Thread1of1ForFork0_i_26 1))) InVars {A=v_A_33, N=v_N_13, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_26} OutVars{A=v_A_32, N=v_N_13, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_25} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i][12]] [2023-10-12 17:37:02,190 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:02,190 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:37:02,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:02,190 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:02,194 INFO L748 eck$LassoCheckResult]: Stem: 32#[$Ultimate##0]true [75] $Ultimate##0-->L19: Formula: (and (<= 0 v_k_7) (< v_k_7 (* v_N_11 2)) (= (select v_A_30 v_k_7) v_ULTIMATE.start_x_6)) InVars {A=v_A_30, N=v_N_11, k=v_k_7} OutVars{A=v_A_30, N=v_N_11, k=v_k_7, ULTIMATE.start_x=v_ULTIMATE.start_x_6} AuxVars[] AssignedVars[ULTIMATE.start_x] 34#[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] 36#[$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] 38#[L33-1, L19-1]true [2023-10-12 17:37:02,194 INFO L750 eck$LassoCheckResult]: Loop: 38#[L33-1, L19-1]true [76] L33-1-->L33-1: Formula: (and (< v_thread1Thread1of1ForFork0_i_26 v_N_13) (= v_A_32 (store v_A_33 v_thread1Thread1of1ForFork0_i_26 (+ (select v_A_33 v_thread1Thread1of1ForFork0_i_26) 1))) (= v_thread1Thread1of1ForFork0_i_25 (+ v_thread1Thread1of1ForFork0_i_26 1))) InVars {A=v_A_33, N=v_N_13, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_26} OutVars{A=v_A_32, N=v_N_13, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_25} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i] 38#[L33-1, L19-1]true [2023-10-12 17:37:02,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:02,197 INFO L85 PathProgramCache]: Analyzing trace with hash 103900, now seen corresponding path program 1 times [2023-10-12 17:37:02,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:02,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132762327] [2023-10-12 17:37:02,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:02,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:02,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:02,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:02,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:02,330 INFO L85 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 1 times [2023-10-12 17:37:02,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134787624] [2023-10-12 17:37:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:02,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:02,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:02,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash 3220976, now seen corresponding path program 1 times [2023-10-12 17:37:02,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:02,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365077997] [2023-10-12 17:37:02,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:02,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:02,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:02,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:02,441 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:02,442 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:02,442 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:02,442 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:02,442 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:02,442 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:02,442 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:02,442 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:02,443 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-incr-split.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:02,443 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:02,443 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:02,453 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:02,481 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:02,526 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:02,528 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:02,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:02,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:02,536 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:02,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:02,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:02,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:02,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:02,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:02,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:02,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:02,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:02,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:02,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:37:02,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:02,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:02,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:02,579 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:02,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:37:02,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:02,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:02,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:02,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:02,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:02,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:02,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:02,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:02,633 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:37:02,633 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:37:02,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:02,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:02,637 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:02,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:37:02,644 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:02,655 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:02,655 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:02,656 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2023-10-12 17:37:02,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:02,679 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:02,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:02,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:02,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:02,715 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:02,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:02,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:37:02,780 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:02,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2023-10-12 17:37:02,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 95 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:02,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:02,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 95 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:02,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:02,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 95 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:02,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:02,864 INFO L430 stractBuchiCegarLoop]: Abstraction has has 22 places, 52 transitions, 256 flow [2023-10-12 17:37:02,864 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:02,864 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 52 transitions, 256 flow [2023-10-12 17:37:02,869 ERROR L47 etriNetUnfolderRabin]: [1:1A:[75] $Ultimate##0-->L19: Formula: (and (<= 0 v_k_7) (< v_k_7 (* v_N_11 2)) (= (select v_A_30 v_k_7) v_ULTIMATE.start_x_6)) InVars {A=v_A_30, N=v_N_11, k=v_k_7} OutVars{A=v_A_30, N=v_N_11, k=v_k_7, ULTIMATE.start_x=v_ULTIMATE.start_x_6} AuxVars[] AssignedVars[ULTIMATE.start_x][35], 2:2A:[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][27], 5:3A:[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][11], 14:4A:[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][23]][15:5A:[77] L45-1-->L45-1: Formula: (and (= v_thread2Thread1of1ForFork1_i_25 (+ v_thread2Thread1of1ForFork1_i_26 1)) (= v_A_36 (store v_A_37 v_thread2Thread1of1ForFork1_i_26 (+ (select v_A_37 v_thread2Thread1of1ForFork1_i_26) 1))) (< v_thread2Thread1of1ForFork1_i_26 (* v_N_15 2))) InVars {A=v_A_37, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_26, N=v_N_15} OutVars{A=v_A_36, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_25, N=v_N_15} AuxVars[] AssignedVars[A, thread2Thread1of1ForFork1_i][47]] [2023-10-12 17:37:02,870 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:02,870 INFO L124 PetriNetUnfolderBase]: 6/14 cut-off events. [2023-10-12 17:37:02,870 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:02,870 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:02,870 INFO L748 eck$LassoCheckResult]: Stem: 32#[$Ultimate##0]true [75] $Ultimate##0-->L19: Formula: (and (<= 0 v_k_7) (< v_k_7 (* v_N_11 2)) (= (select v_A_30 v_k_7) v_ULTIMATE.start_x_6)) InVars {A=v_A_30, N=v_N_11, k=v_k_7} OutVars{A=v_A_30, N=v_N_11, k=v_k_7, ULTIMATE.start_x=v_ULTIMATE.start_x_6} AuxVars[] AssignedVars[ULTIMATE.start_x] 34#[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] 36#[$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] 78#[$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] 80#[L45-1, $Ultimate##0, L20]true [2023-10-12 17:37:02,871 INFO L750 eck$LassoCheckResult]: Loop: 80#[L45-1, $Ultimate##0, L20]true [77] L45-1-->L45-1: Formula: (and (= v_thread2Thread1of1ForFork1_i_25 (+ v_thread2Thread1of1ForFork1_i_26 1)) (= v_A_36 (store v_A_37 v_thread2Thread1of1ForFork1_i_26 (+ (select v_A_37 v_thread2Thread1of1ForFork1_i_26) 1))) (< v_thread2Thread1of1ForFork1_i_26 (* v_N_15 2))) InVars {A=v_A_37, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_26, N=v_N_15} OutVars{A=v_A_36, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_25, N=v_N_15} AuxVars[] AssignedVars[A, thread2Thread1of1ForFork1_i] 80#[L45-1, $Ultimate##0, L20]true [2023-10-12 17:37:02,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash 3221483, now seen corresponding path program 1 times [2023-10-12 17:37:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:02,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598084234] [2023-10-12 17:37:02,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:02,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:02,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:02,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:02,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:02,896 INFO L85 PathProgramCache]: Analyzing trace with hash 108, now seen corresponding path program 1 times [2023-10-12 17:37:02,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:02,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476398554] [2023-10-12 17:37:02,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:02,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:02,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:02,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:02,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:02,912 INFO L85 PathProgramCache]: Analyzing trace with hash 99866050, now seen corresponding path program 1 times [2023-10-12 17:37:02,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:02,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275648280] [2023-10-12 17:37:02,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:02,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:02,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:02,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:02,989 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:02,989 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:02,989 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:02,989 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:02,989 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:02,990 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:02,990 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:02,990 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:02,990 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-incr-split.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:02,990 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:02,990 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:02,991 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:02,994 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:03,012 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:03,014 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:03,016 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:03,070 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:03,071 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:03,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:03,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:03,072 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:03,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:37:03,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:03,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:03,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:03,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:03,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:03,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:03,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:03,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:03,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:03,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:03,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:03,110 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:03,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:37:03,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:03,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:03,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:03,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:03,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:03,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:03,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:03,143 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:03,156 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:37:03,156 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:37:03,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:03,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:03,157 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) [2023-10-12 17:37:03,181 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:03,181 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 [2023-10-12 17:37:03,198 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:03,198 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:03,198 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 2*N Supporting invariants [] [2023-10-12 17:37:03,215 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 [2023-10-12 17:37:03,216 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:03,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:03,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:03,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:03,247 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:03,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:03,249 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:03,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2023-10-12 17:37:03,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 95 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:03,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:03,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 95 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:03,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:03,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 95 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:37:03,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:03,309 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 208 transitions, 1440 flow [2023-10-12 17:37:03,310 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:03,310 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 208 transitions, 1440 flow [2023-10-12 17:37:03,316 INFO L124 PetriNetUnfolderBase]: 25/49 cut-off events. [2023-10-12 17:37:03,317 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-10-12 17:37:03,317 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:03,321 INFO L201 PluginConnector]: Adding new model map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:03 BoogieIcfgContainer [2023-10-12 17:37:03,321 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:03,321 INFO L158 Benchmark]: Toolchain (without parser) took 1777.41ms. Allocated memory is still 212.9MB. Free memory was 168.8MB in the beginning and 151.7MB in the end (delta: 17.1MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB. [2023-10-12 17:37:03,322 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 212.9MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:03,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.51ms. Allocated memory is still 212.9MB. Free memory was 168.7MB in the beginning and 167.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:03,322 INFO L158 Benchmark]: Boogie Preprocessor took 13.00ms. Allocated memory is still 212.9MB. Free memory was 167.2MB in the beginning and 166.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:03,323 INFO L158 Benchmark]: RCFGBuilder took 246.53ms. Allocated memory is still 212.9MB. Free memory was 166.0MB in the beginning and 156.5MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:03,323 INFO L158 Benchmark]: BuchiAutomizer took 1486.05ms. Allocated memory is still 212.9MB. Free memory was 188.9MB in the beginning and 151.7MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-10-12 17:37:03,324 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.27ms. Allocated memory is still 212.9MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.51ms. Allocated memory is still 212.9MB. Free memory was 168.7MB in the beginning and 167.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.00ms. Allocated memory is still 212.9MB. Free memory was 167.2MB in the beginning and 166.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 246.53ms. Allocated memory is still 212.9MB. Free memory was 166.0MB in the beginning and 156.5MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1486.05ms. Allocated memory is still 212.9MB. Free memory was 188.9MB in the beginning and 151.7MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. 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 3 locations. One deterministic module has affine ranking function 2 * N + -1 * i and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 68 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital43 mio100 ax100 hnf100 lsp86 ukn67 mio100 lsp87 div100 bol100 ite100 ukn100 eq145 hnf93 smp100 dnf100 smp100 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 77ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 26 PlacesBefore, 18 PlacesAfterwards, 21 TransitionsBefore, 13 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 70 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:37:03,342 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 [2023-10-12 17:37:03,546 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...