/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-comp.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:25:47,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:25:48,008 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:48,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:25:48,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:25:48,018 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:48,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:25:48,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:25:48,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:25:48,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:25:48,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:25:48,054 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:25:48,055 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:25:48,055 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:25:48,055 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:25:48,055 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:25:48,056 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:25:48,056 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:25:48,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:25:48,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:25:48,057 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:25:48,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:25:48,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:25:48,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:25:48,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:25:48,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:25:48,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:25:48,073 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:25:48,073 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:25:48,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:25:48,106 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:25:48,106 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:25:48,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:25:48,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:25:48,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:25:48,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:25:48,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:25:48,107 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:25:48,107 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:48,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:25:48,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:25:48,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:25:48,418 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:25:48,419 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:25:48,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl [2024-02-10 00:25:48,420 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl' [2024-02-10 00:25:48,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:25:48,440 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:25:48,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:25:48,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:25:48,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:25:48,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:48" (1/1) ... [2024-02-10 00:25:48,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:48" (1/1) ... [2024-02-10 00:25:48,504 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:25:48,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:25:48,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:25:48,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:25:48,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:25:48,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:48" (1/1) ... [2024-02-10 00:25:48,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:48" (1/1) ... [2024-02-10 00:25:48,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:48" (1/1) ... [2024-02-10 00:25:48,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:48" (1/1) ... [2024-02-10 00:25:48,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:48" (1/1) ... [2024-02-10 00:25:48,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:48" (1/1) ... [2024-02-10 00:25:48,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:48" (1/1) ... [2024-02-10 00:25:48,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:48" (1/1) ... [2024-02-10 00:25:48,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:25:48,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:25:48,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:25:48,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:25:48,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:48" (1/1) ... [2024-02-10 00:25:48,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:48,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:48,573 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:48,580 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:48,618 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 00:25:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:25:48,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:25:48,619 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 00:25:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:25:48,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:25:48,619 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-02-10 00:25:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 00:25:48,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 00:25:48,619 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:25:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:25:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:25:48,620 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:48,660 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:25:48,661 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:25:48,749 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:25:48,757 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:25:48,757 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:25:48,759 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:25:48 BoogieIcfgContainer [2024-02-10 00:25:48,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:25:48,760 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:25:48,760 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:25:48,763 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:25:48,764 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:25:48,764 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:48" (1/2) ... [2024-02-10 00:25:48,765 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@231821aa and model type map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:25:48, skipping insertion in model container [2024-02-10 00:25:48,765 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:25:48,765 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:25:48" (2/2) ... [2024-02-10 00:25:48,766 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-comp.bpl [2024-02-10 00:25:48,830 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-10 00:25:48,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2024-02-10 00:25:48,882 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2024-02-10 00:25:48,882 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 00:25:48,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-02-10 00:25:48,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2024-02-10 00:25:48,890 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2024-02-10 00:25:48,900 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:25:48,900 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:25:48,900 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:25:48,900 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:25:48,901 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:25:48,901 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:25:48,901 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:25:48,901 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:25:48,902 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:48,902 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 76 flow [2024-02-10 00:25:48,942 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 307 states, 305 states have (on average 2.9344262295081966) internal successors, (895), 306 states have internal predecessors, (895), 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:48,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 307 states, 305 states have (on average 2.9344262295081966) internal successors, (895), 306 states have internal predecessors, (895), 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:48,978 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 249 [2024-02-10 00:25:48,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:48,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:48,982 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:25:48,982 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:48,982 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 76 flow [2024-02-10 00:25:48,998 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 307 states, 305 states have (on average 2.9344262295081966) internal successors, (895), 306 states have internal predecessors, (895), 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:48,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 307 states, 305 states have (on average 2.9344262295081966) internal successors, (895), 306 states have internal predecessors, (895), 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:49,007 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 249 [2024-02-10 00:25:49,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:49,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:49,012 INFO L748 eck$LassoCheckResult]: Stem: Black: 658#[$Ultimate##0]don't care [65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[] 661#[L16]don't care [41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B] 663#[L18]don't care [90] L18-->$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] 665#[L18-1, $Ultimate##0]don't care [70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 667#[L34-1, L18-1]don't care [2024-02-10 00:25:49,012 INFO L750 eck$LassoCheckResult]: Loop: 667#[L34-1, L18-1]don't care [72] 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[] 673#[L18-1, L35]don't care [74] L35-->L36: 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] 685#[L18-1, L36]don't care [75] L36-->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] 667#[L34-1, L18-1]don't care [2024-02-10 00:25:49,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:49,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2902197, now seen corresponding path program 1 times [2024-02-10 00:25:49,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:49,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124586632] [2024-02-10 00:25:49,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:49,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:49,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:49,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:49,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:49,108 INFO L85 PathProgramCache]: Analyzing trace with hash 101352, now seen corresponding path program 1 times [2024-02-10 00:25:49,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:49,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271048686] [2024-02-10 00:25:49,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:49,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:49,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:49,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:49,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:49,127 INFO L85 PathProgramCache]: Analyzing trace with hash 560076468, now seen corresponding path program 1 times [2024-02-10 00:25:49,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:49,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309929856] [2024-02-10 00:25:49,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:49,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:49,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:49,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:49,271 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:25:49,272 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:25:49,272 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:25:49,272 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:25:49,272 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:25:49,272 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:49,272 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:25:49,272 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:25:49,272 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:25:49,286 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:25:49,286 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:25:49,299 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:49,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:25:49,402 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:25:49,406 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:25:49,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:49,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:49,411 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:49,415 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:49,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:49,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:49,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:49,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:49,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:49,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:49,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:49,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:49,436 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:49,443 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:49,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:49,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:49,446 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:49,450 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:49,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:49,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:49,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:49,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:49,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:49,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:49,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:49,461 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:49,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:49,488 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:49,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:49,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:49,493 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:49,496 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:49,497 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:49,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:49,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:49,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:49,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:49,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:49,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:49,528 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:25:49,567 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-10 00:25:49,567 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-10 00:25:49,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:49,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:49,572 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:49,574 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:49,575 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:25:49,595 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:25:49,595 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:25:49,596 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:49,603 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:49,607 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:25:49,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:49,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:25:49,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:49,680 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:25:49,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:49,705 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:49,737 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:49,739 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:49,894 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 439 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:25:49,895 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:25:49,895 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:25:49,897 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:25:49,933 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:25:49,933 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:25:49,935 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:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-02-10 00:25:49,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 4 letters. Loop has 3 letters. [2024-02-10 00:25:49,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:49,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 7 letters. Loop has 3 letters. [2024-02-10 00:25:49,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:49,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 4 letters. Loop has 6 letters. [2024-02-10 00:25:49,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:49,953 INFO L428 stractBuchiCegarLoop]: Abstraction has has 45 places, 361 transitions, 1663 flow [2024-02-10 00:25:49,953 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:25:49,953 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:49,954 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 45 places, 361 transitions, 1663 flow [2024-02-10 00:25:50,005 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 654 states, 648 states have (on average 4.390432098765432) internal successors, (2845), 653 states have internal predecessors, (2845), 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:50,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 654 states, 648 states have (on average 4.390432098765432) internal successors, (2845), 653 states have internal predecessors, (2845), 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:50,031 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 210 [2024-02-10 00:25:50,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:50,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:50,033 INFO L748 eck$LassoCheckResult]: Stem: Black: 1319#[$Ultimate##0]don't care [65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[] Black: 1322#[L16]don't care [41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B] Black: 1327#[L18]don't care [90] L18-->$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] Black: 1332#[$Ultimate##0, L18-1]don't care [93] L18-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] 1343#[$Ultimate##0, L19, $Ultimate##0]don't care [76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 1363#[$Ultimate##0, L19, L46-1]don't care [2024-02-10 00:25:50,033 INFO L750 eck$LassoCheckResult]: Loop: 1363#[$Ultimate##0, L19, L46-1]don't care [78] L46-1-->L47: 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[] 1419#[$Ultimate##0, L19, L47]don't care [80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (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] 1511#[$Ultimate##0, L19, L48]don't care [81] L48-->L46-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] 1363#[$Ultimate##0, L19, L46-1]don't care [2024-02-10 00:25:50,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:50,034 INFO L85 PathProgramCache]: Analyzing trace with hash 89968896, now seen corresponding path program 1 times [2024-02-10 00:25:50,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:50,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106193504] [2024-02-10 00:25:50,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:50,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:50,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:50,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:50,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 1 times [2024-02-10 00:25:50,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:50,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906841362] [2024-02-10 00:25:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:50,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:50,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:50,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash 203865551, now seen corresponding path program 1 times [2024-02-10 00:25:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:50,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415865528] [2024-02-10 00:25:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:50,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:50,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:50,139 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:25:50,139 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:25:50,139 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:25:50,139 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:25:50,140 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:25:50,140 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:50,140 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:25:50,140 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:25:50,140 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:25:50,140 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:25:50,140 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:25:50,142 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:50,145 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:50,147 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:50,161 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:50,164 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:50,216 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:25:50,216 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:25:50,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:50,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:50,221 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:50,227 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:50,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:50,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:50,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:50,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:50,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:50,240 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:50,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:50,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:50,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:50,263 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:50,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:50,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:50,266 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:50,271 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:50,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:50,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:50,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:50,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:50,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:50,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:50,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:50,313 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:50,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-02-10 00:25:50,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-10 00:25:50,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:50,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:50,332 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:50,337 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:50,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:50,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:50,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:50,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:50,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:50,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:50,360 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:50,366 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:25:50,373 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-10 00:25:50,373 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-02-10 00:25:50,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:50,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:50,375 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:50,380 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:25:50,388 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:50,408 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:25:50,408 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:25:50,408 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:50,429 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:50,430 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:25:50,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:50,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:25:50,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:50,464 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:25:50,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:50,491 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:50,493 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:50,493 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:50,591 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 439 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:25:50,594 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:25:50,594 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:25:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 439 transitions. [2024-02-10 00:25:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 439 transitions. [2024-02-10 00:25:50,602 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:25:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 439 transitions. [2024-02-10 00:25:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 439 transitions. [2024-02-10 00:25:50,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:50,803 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:25:50,803 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:25:50,804 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:50,805 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:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-02-10 00:25:50,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 5 letters. Loop has 3 letters. [2024-02-10 00:25:50,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:50,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 8 letters. Loop has 3 letters. [2024-02-10 00:25:50,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:50,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 5 letters. Loop has 6 letters. [2024-02-10 00:25:50,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:50,806 INFO L428 stractBuchiCegarLoop]: Abstraction has has 58 places, 5838 transitions, 38478 flow [2024-02-10 00:25:50,806 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:25:50,806 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:50,806 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 58 places, 5838 transitions, 38478 flow [2024-02-10 00:25:51,686 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1694 states, 1664 states have (on average 5.7782451923076925) internal successors, (9615), 1693 states have internal predecessors, (9615), 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,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1694 states, 1664 states have (on average 5.7782451923076925) internal successors, (9615), 1693 states have internal predecessors, (9615), 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,719 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 258 [2024-02-10 00:25:51,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:51,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:51,720 INFO L748 eck$LassoCheckResult]: Stem: Black: 3029#[$Ultimate##0]don't care [65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[] Black: 3041#[L16]don't care [41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B] 3056#[L18]don't care [90] L18-->$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] Black: 3067#[$Ultimate##0, L18-1]don't care [93] L18-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] 3090#[$Ultimate##0, $Ultimate##0, L19]don't care [96] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_14, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_i, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] Black: 3155#[L20, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [82] $Ultimate##0-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i] 3302#[$Ultimate##0, L58-1, $Ultimate##0, L20]don't care [2024-02-10 00:25:51,720 INFO L750 eck$LassoCheckResult]: Loop: 3302#[$Ultimate##0, L58-1, $Ultimate##0, L20]don't care [84] L58-1-->L59: Formula: (< v_thread3Thread1of1ForFork2_i_5 v_N_5) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} AuxVars[] AssignedVars[] Black: 3577#[L20, L59, $Ultimate##0, $Ultimate##0]don't care [86] L59-->L60: Formula: (= v_B_1 (store v_B_2 v_thread3Thread1of1ForFork2_i_7 (+ 3 (select v_B_2 v_thread3Thread1of1ForFork2_i_7)))) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_2} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_1} AuxVars[] AssignedVars[B] 4050#[$Ultimate##0, L60, $Ultimate##0, L20]don't care [87] L60-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_10 (+ v_thread3Thread1of1ForFork2_i_9 1)) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_9} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i] Black: 3299#[$Ultimate##0, L58-1, $Ultimate##0, L20]don't care [84] L58-1-->L59: Formula: (< v_thread3Thread1of1ForFork2_i_5 v_N_5) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} AuxVars[] AssignedVars[] 3588#[L20, L59, $Ultimate##0, $Ultimate##0]don't care [86] L59-->L60: Formula: (= v_B_1 (store v_B_2 v_thread3Thread1of1ForFork2_i_7 (+ 3 (select v_B_2 v_thread3Thread1of1ForFork2_i_7)))) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_2} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_1} AuxVars[] AssignedVars[B] Black: 4047#[$Ultimate##0, L60, $Ultimate##0, L20]don't care [87] L60-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_10 (+ v_thread3Thread1of1ForFork2_i_9 1)) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_9} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i] 3302#[$Ultimate##0, L58-1, $Ultimate##0, L20]don't care [2024-02-10 00:25:51,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1505930818, now seen corresponding path program 1 times [2024-02-10 00:25:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:51,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421447010] [2024-02-10 00:25:51,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:51,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:51,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:51,744 INFO L85 PathProgramCache]: Analyzing trace with hash -920516831, now seen corresponding path program 1 times [2024-02-10 00:25:51,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:51,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243903029] [2024-02-10 00:25:51,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:51,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:51,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash -195537122, now seen corresponding path program 1 times [2024-02-10 00:25:51,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:51,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044144827] [2024-02-10 00:25:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:51,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,790 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:51,906 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:25:51,907 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:25:51,907 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:25:51,907 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:25:51,907 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:25:51,907 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:51,907 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:25:51,907 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:25:51,907 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration3_Lasso [2024-02-10 00:25:51,907 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:25:51,907 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:25:51,909 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:51,936 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:51,938 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:51,940 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:51,942 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:51,944 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:51,946 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:51,948 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:51,950 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,029 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:25:52,029 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:25:52,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:52,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:52,031 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:52,037 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,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:52,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:52,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:52,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:52,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:52,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:52,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:52,052 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:52,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:52,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:52,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:52,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:52,093 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:25:52,123 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,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:52,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:52,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:52,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:52,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:52,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:52,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:52,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 00:25:52,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:52,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:52,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:52,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:52,154 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:25:52,160 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,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:52,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:52,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:52,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:52,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:52,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:52,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:52,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 00:25:52,180 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:52,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:52,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:52,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:52,195 INFO L229 MonitoredProcess]: Starting monitored process 13 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,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 00:25:52,198 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,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:52,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:52,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:52,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:52,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:52,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:52,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:52,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:52,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:52,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:52,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:52,229 INFO L229 MonitoredProcess]: Starting monitored process 14 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,234 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,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:52,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:52,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:52,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:52,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:52,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:52,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 00:25:52,264 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:25:52,274 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-02-10 00:25:52,274 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 00:25:52,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:52,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:52,276 INFO L229 MonitoredProcess]: Starting monitored process 15 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,281 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:25:52,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 00:25:52,299 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:25:52,299 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:25:52,299 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_i, N) = -1*thread3Thread1of1ForFork2_i + 1*N Supporting invariants [] [2024-02-10 00:25:52,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:52,309 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:25:52,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:52,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:25:52,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:52,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 00:25:52,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:25:52,375 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 00:25:52,375 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:52,447 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 406 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:25:52,447 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:25:52,447 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:25:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 406 transitions. [2024-02-10 00:25:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 406 transitions. [2024-02-10 00:25:52,449 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:25:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 406 transitions. [2024-02-10 00:25:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 406 transitions. [2024-02-10 00:25:52,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:55,545 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:25:55,546 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:25:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:25:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-02-10 00:25:55,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 6 letters. Loop has 6 letters. [2024-02-10 00:25:55,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:55,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 12 letters. Loop has 6 letters. [2024-02-10 00:25:55,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:55,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 6 letters. Loop has 12 letters. [2024-02-10 00:25:55,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:55,549 INFO L428 stractBuchiCegarLoop]: Abstraction has has 70 places, 88988 transitions, 762463 flow [2024-02-10 00:25:55,550 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:25:55,550 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:55,550 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 70 places, 88988 transitions, 762463 flow [2024-02-10 00:27:44,443 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 5685 states, 5511 states have (on average 8.183814189802213) internal successors, (45101), 5684 states have internal predecessors, (45101), 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:27:44,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5685 states, 5511 states have (on average 8.183814189802213) internal successors, (45101), 5684 states have internal predecessors, (45101), 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:27:44,658 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 00:27:44,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 00:27:44,678 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:27:44 BoogieIcfgContainer [2024-02-10 00:27:44,678 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:27:44,679 INFO L158 Benchmark]: Toolchain (without parser) took 116238.72ms. Allocated memory was 182.5MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 146.9MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2024-02-10 00:27:44,679 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:27:44,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.85ms. Allocated memory is still 182.5MB. Free memory was 146.9MB in the beginning and 155.3MB in the end (delta: -8.3MB). Peak memory consumption was 4.0MB. Max. memory is 8.0GB. [2024-02-10 00:27:44,683 INFO L158 Benchmark]: Boogie Preprocessor took 21.46ms. Allocated memory is still 182.5MB. Free memory was 155.3MB in the beginning and 154.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:27:44,683 INFO L158 Benchmark]: RCFGBuilder took 224.78ms. Allocated memory is still 182.5MB. Free memory was 154.2MB in the beginning and 144.5MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 00:27:44,685 INFO L158 Benchmark]: BuchiAutomizer took 115918.24ms. Allocated memory was 182.5MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 144.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2024-02-10 00:27:44,690 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.85ms. Allocated memory is still 182.5MB. Free memory was 146.9MB in the beginning and 155.3MB in the end (delta: -8.3MB). Peak memory consumption was 4.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.46ms. Allocated memory is still 182.5MB. Free memory was 155.3MB in the beginning and 154.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 224.78ms. Allocated memory is still 182.5MB. Free memory was 154.2MB in the beginning and 144.5MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 115918.24ms. Allocated memory was 182.5MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 144.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 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. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 115.8s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 289 mSDsluCounter, 378 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 207 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital49 mio100 ax100 hnf100 lsp81 ukn58 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 106ms 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.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-10 00:27:44,738 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...