/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-aggr-update2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:25:44,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:25:45,044 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:45,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:25:45,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:25:45,053 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:45,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:25:45,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:25:45,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:25:45,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:25:45,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:25:45,110 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:25:45,110 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:25:45,111 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:25:45,112 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:25:45,112 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:25:45,112 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:25:45,112 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:25:45,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:25:45,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:25:45,128 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:25:45,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:25:45,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:25:45,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:25:45,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:25:45,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:25:45,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:25:45,130 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:25:45,130 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:25:45,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:25:45,131 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:25:45,131 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:25:45,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:25:45,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:25:45,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:25:45,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:25:45,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:25:45,133 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:25:45,133 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:45,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:25:45,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:25:45,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:25:45,734 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:25:45,735 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:25:45,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl [2024-02-10 00:25:45,736 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl' [2024-02-10 00:25:45,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:25:45,797 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:25:45,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:25:45,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:25:45,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:25:45,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:45" (1/1) ... [2024-02-10 00:25:45,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:45" (1/1) ... [2024-02-10 00:25:45,850 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:25:45,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:25:45,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:25:45,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:25:45,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:25:45,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:45" (1/1) ... [2024-02-10 00:25:45,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:45" (1/1) ... [2024-02-10 00:25:45,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:45" (1/1) ... [2024-02-10 00:25:45,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:45" (1/1) ... [2024-02-10 00:25:45,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:45" (1/1) ... [2024-02-10 00:25:45,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:45" (1/1) ... [2024-02-10 00:25:45,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:45" (1/1) ... [2024-02-10 00:25:45,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:45" (1/1) ... [2024-02-10 00:25:45,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:25:45,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:25:45,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:25:45,904 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:25:45,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:45" (1/1) ... [2024-02-10 00:25:45,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:45,946 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:45,981 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:46,033 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 00:25:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:25:46,034 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:25:46,034 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 00:25:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:25:46,034 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:25:46,034 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-02-10 00:25:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 00:25:46,034 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 00:25:46,034 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:25:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:25:46,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:25:46,035 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:46,100 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:25:46,102 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:25:46,325 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:25:46,367 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:25:46,368 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:25:46,370 INFO L201 PluginConnector]: Adding new model map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:25:46 BoogieIcfgContainer [2024-02-10 00:25:46,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:25:46,370 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:25:46,371 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:25:46,378 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:25:46,379 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:25:46,379 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:45" (1/2) ... [2024-02-10 00:25:46,381 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2704cca3 and model type map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:25:46, skipping insertion in model container [2024-02-10 00:25:46,381 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:25:46,381 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:25:46" (2/2) ... [2024-02-10 00:25:46,383 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-aggr-update2.bpl [2024-02-10 00:25:46,538 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-10 00:25:46,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2024-02-10 00:25:46,643 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2024-02-10 00:25:46,644 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 00:25:46,649 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 57 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-02-10 00:25:46,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2024-02-10 00:25:46,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2024-02-10 00:25:46,675 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:25:46,676 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:25:46,676 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:25:46,676 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:25:46,676 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:25:46,676 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:25:46,676 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:25:46,677 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:25:46,677 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:46,678 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 76 flow [2024-02-10 00:25:46,755 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 354 states, 352 states have (on average 2.9488636363636362) internal successors, (1038), 353 states have internal predecessors, (1038), 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:46,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 354 states, 352 states have (on average 2.9488636363636362) internal successors, (1038), 353 states have internal predecessors, (1038), 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:46,846 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 282 [2024-02-10 00:25:46,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:46,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:46,850 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:25:46,851 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:46,851 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 76 flow [2024-02-10 00:25:46,876 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 354 states, 352 states have (on average 2.9488636363636362) internal successors, (1038), 353 states have internal predecessors, (1038), 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:46,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 354 states, 352 states have (on average 2.9488636363636362) internal successors, (1038), 353 states have internal predecessors, (1038), 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:46,884 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 282 [2024-02-10 00:25:46,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:46,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:46,889 INFO L748 eck$LassoCheckResult]: Stem: Black: 752#[$Ultimate##0]don't care [85] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 755#[L34]don't care [109] L34-->$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] 757#[$Ultimate##0, L34-1]don't care [88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 759#[L51-1, L34-1]don't care [2024-02-10 00:25:46,889 INFO L750 eck$LassoCheckResult]: Loop: 759#[L51-1, L34-1]don't care [90] L51-1-->L52: 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[] 765#[L52, L34-1]don't care [92] L52-->L53: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork0_i_7))) (ite (< .cse0 0) 0 .cse0)))) 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] 777#[L53, L34-1]don't care [93] L53-->L51-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] 759#[L51-1, L34-1]don't care [2024-02-10 00:25:46,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash 114943, now seen corresponding path program 1 times [2024-02-10 00:25:46,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:46,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147194053] [2024-02-10 00:25:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:47,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:47,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:47,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:47,131 INFO L85 PathProgramCache]: Analyzing trace with hash 119226, now seen corresponding path program 1 times [2024-02-10 00:25:47,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:47,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978900834] [2024-02-10 00:25:47,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:47,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:47,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:47,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:47,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:47,220 INFO L85 PathProgramCache]: Analyzing trace with hash -870610948, now seen corresponding path program 1 times [2024-02-10 00:25:47,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:47,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656327686] [2024-02-10 00:25:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:47,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:47,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:47,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:47,486 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:25:47,486 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:25:47,486 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:25:47,486 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:25:47,487 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:25:47,487 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:47,487 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:25:47,487 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:25:47,487 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:25:47,487 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:25:47,496 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:25:47,517 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:47,579 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:47,658 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:25:47,661 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:25:47,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:47,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:47,760 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:47,789 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:47,793 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:47,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:47,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:47,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:47,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:47,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:47,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:47,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:47,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:47,856 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:47,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:47,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:47,861 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:47,866 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:47,874 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:47,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:47,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:47,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:47,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:47,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:47,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:47,905 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:25:47,918 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 00:25:47,918 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 00:25:47,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:47,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:47,962 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:47,968 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:25:47,986 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:47,987 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:25:47,987 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:25:47,988 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:48,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-02-10 00:25:48,023 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:25:48,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:48,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:25:48,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:48,096 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:25:48,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:48,139 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:48,190 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:48,192 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:48,399 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 439 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:25:48,400 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:25:48,400 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:25:48,401 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:25:48,434 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:25:48,435 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:25:48,437 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:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-02-10 00:25:48,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 3 letters. Loop has 3 letters. [2024-02-10 00:25:48,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:48,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-10 00:25:48,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:48,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 3 letters. Loop has 6 letters. [2024-02-10 00:25:48,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:48,446 INFO L428 stractBuchiCegarLoop]: Abstraction has has 45 places, 361 transitions, 1663 flow [2024-02-10 00:25:48,446 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:25:48,446 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:48,446 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 45 places, 361 transitions, 1663 flow [2024-02-10 00:25:48,500 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:48,660 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 755 states, 749 states have (on average 4.408544726301735) internal successors, (3302), 754 states have internal predecessors, (3302), 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,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 755 states, 749 states have (on average 4.408544726301735) internal successors, (3302), 754 states have internal predecessors, (3302), 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,701 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 231 [2024-02-10 00:25:48,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:48,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:48,703 INFO L748 eck$LassoCheckResult]: Stem: Black: 1504#[$Ultimate##0]don't care [85] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] Black: 1507#[L34]don't care [109] L34-->$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] 1515#[L34-1, $Ultimate##0]don't care [112] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_8, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1523#[$Ultimate##0, $Ultimate##0, L35]don't care [115] L35-->$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_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k] 1551#[$Ultimate##0, $Ultimate##0, L36, $Ultimate##0]don't care [101] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 1602#[$Ultimate##0, L85-1, $Ultimate##0, L36]don't care [2024-02-10 00:25:48,704 INFO L750 eck$LassoCheckResult]: Loop: 1602#[$Ultimate##0, L85-1, $Ultimate##0, L36]don't care [103] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[] 1683#[$Ultimate##0, L86, $Ultimate##0, L36]don't care [105] L86-->L87: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork2_k_7 v_thread3Thread1of1ForFork2_k_7)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_3} AuxVars[] AssignedVars[B] 1826#[$Ultimate##0, L87, $Ultimate##0, L36]don't care [106] L87-->L85-1: Formula: (= v_thread3Thread1of1ForFork2_k_10 (+ v_thread3Thread1of1ForFork2_k_9 1)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 1602#[$Ultimate##0, L85-1, $Ultimate##0, L36]don't care [2024-02-10 00:25:48,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:48,704 INFO L85 PathProgramCache]: Analyzing trace with hash 110486953, now seen corresponding path program 1 times [2024-02-10 00:25:48,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:48,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455711228] [2024-02-10 00:25:48,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:48,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:48,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:48,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:48,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:48,748 INFO L85 PathProgramCache]: Analyzing trace with hash 132135, now seen corresponding path program 1 times [2024-02-10 00:25:48,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:48,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292337501] [2024-02-10 00:25:48,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:48,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:48,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:48,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:48,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:48,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1571970431, now seen corresponding path program 1 times [2024-02-10 00:25:48,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:48,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743930958] [2024-02-10 00:25:48,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:48,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:48,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:48,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:48,911 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:25:48,912 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:25:48,912 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:25:48,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:25:48,912 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:25:48,912 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:48,912 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:25:48,912 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:25:48,912 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:25:48,912 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:25:48,912 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:25:48,917 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:48,920 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:48,922 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:48,923 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:48,926 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:48,928 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:48,931 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:48,949 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:48,952 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:48,954 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,063 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:25:49,063 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:25:49,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:49,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:49,065 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,103 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,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:49,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:49,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:49,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:49,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:49,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:49,118 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,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:49,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:49,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:49,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:49,161 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:49,187 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,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:49,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:49,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:49,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:49,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:49,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:49,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:49,197 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:49,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:49,226 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:49,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:49,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:49,237 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:49,255 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,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:49,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:49,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:49,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:49,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:49,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:49,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:49,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:49,286 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:49,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:49,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:49,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:49,341 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:49,372 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,380 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:49,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:49,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:49,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:49,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:49,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:49,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:49,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:49,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-02-10 00:25:49,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:49,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:49,449 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:49,475 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,482 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:49,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:49,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:49,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:49,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:49,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:49,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:49,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:49,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:49,525 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:49,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:49,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:49,528 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:49,530 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:49,553 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,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:49,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:49,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:49,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:49,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:49,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:49,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:49,620 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:49,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:49,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:49,622 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:49,629 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,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:49,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:49,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:49,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:49,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:49,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:49,668 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:49,668 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:25:49,679 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 00:25:49,679 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 00:25:49,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:49,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:49,697 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:49,719 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:25:49,726 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:49,731 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:25:49,731 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:25:49,731 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_k, N) = -1*thread3Thread1of1ForFork2_k + 1*N Supporting invariants [] [2024-02-10 00:25:49,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-02-10 00:25:49,752 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:25:49,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:49,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:25:49,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:49,786 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:25:49,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:49,819 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,820 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,821 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,090 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,091 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:25:50,091 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:25:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 439 transitions. [2024-02-10 00:25:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 439 transitions. [2024-02-10 00:25:50,123 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:25:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 439 transitions. [2024-02-10 00:25:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 439 transitions. [2024-02-10 00:25:50,236 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:50,370 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:25:50,371 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:25:50,371 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,372 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,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-02-10 00:25:50,373 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,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:50,373 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,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:50,373 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,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:50,373 INFO L428 stractBuchiCegarLoop]: Abstraction has has 58 places, 5838 transitions, 38478 flow [2024-02-10 00:25:50,373 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:25:50,373 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:50,373 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 58 places, 5838 transitions, 38478 flow [2024-02-10 00:25:51,286 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1947 states, 1917 states have (on average 5.805425143453313) internal successors, (11129), 1946 states have internal predecessors, (11129), 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,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1947 states, 1917 states have (on average 5.805425143453313) internal successors, (11129), 1946 states have internal predecessors, (11129), 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,324 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 288 [2024-02-10 00:25:51,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:51,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:51,325 INFO L748 eck$LassoCheckResult]: Stem: Black: 3470#[$Ultimate##0]don't care [85] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] Black: 3473#[L34]don't care [109] L34-->$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: 3488#[L34-1, $Ultimate##0]don't care [112] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_8, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] Black: 3508#[$Ultimate##0, $Ultimate##0, L35]don't care [94] $Ultimate##0-->L64: Formula: (= (+ v_thread2Thread1of1ForFork1_pos_1 1) 0) InVars {} OutVars{thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_pos] Black: 3570#[$Ultimate##0, L64, L35]don't care [95] L64-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 3709#[L65-1, $Ultimate##0, L35]don't care [2024-02-10 00:25:51,326 INFO L750 eck$LassoCheckResult]: Loop: 3709#[L65-1, $Ultimate##0, L35]don't care [97] L65-1-->L66: Formula: (< v_thread2Thread1of1ForFork1_j_5 v_N_4) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} AuxVars[] AssignedVars[] Black: 3852#[L66, $Ultimate##0, L35]don't care [99] L66-->L70-1: Formula: (and (let ((.cse0 (select v_A_9 v_thread2Thread1of1ForFork1_j_7))) (or (and (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_j_7) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_3)))) (let ((.cse1 (select v_B_7 v_thread2Thread1of1ForFork1_j_7))) (or (and (<= .cse1 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork1_pos_4 v_thread2Thread1of1ForFork1_j_7))))) InVars {A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_3, B=v_B_7} OutVars{A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_4, B=v_B_7} AuxVars[v_thread2_pos_16] AssignedVars[thread2Thread1of1ForFork1_pos] 4207#[L70-1, $Ultimate##0, L35]don't care [100] L70-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_10 (+ v_thread2Thread1of1ForFork1_j_9 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] Black: 3688#[L65-1, $Ultimate##0, L35]don't care [97] L65-1-->L66: Formula: (< v_thread2Thread1of1ForFork1_j_5 v_N_4) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} AuxVars[] AssignedVars[] 3885#[L66, $Ultimate##0, L35]don't care [99] L66-->L70-1: Formula: (and (let ((.cse0 (select v_A_9 v_thread2Thread1of1ForFork1_j_7))) (or (and (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_j_7) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_3)))) (let ((.cse1 (select v_B_7 v_thread2Thread1of1ForFork1_j_7))) (or (and (<= .cse1 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork1_pos_4 v_thread2Thread1of1ForFork1_j_7))))) InVars {A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_3, B=v_B_7} OutVars{A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_4, B=v_B_7} AuxVars[v_thread2_pos_16] AssignedVars[thread2Thread1of1ForFork1_pos] Black: 4192#[L70-1, $Ultimate##0, L35]don't care [100] L70-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_10 (+ v_thread2Thread1of1ForFork1_j_9 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 3709#[L65-1, $Ultimate##0, L35]don't care [2024-02-10 00:25:51,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash 110486296, now seen corresponding path program 1 times [2024-02-10 00:25:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766109703] [2024-02-10 00:25:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:51,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:51,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:51,346 INFO L85 PathProgramCache]: Analyzing trace with hash -535931903, now seen corresponding path program 1 times [2024-02-10 00:25:51,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:51,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558229139] [2024-02-10 00:25:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:51,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:51,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash -904050216, now seen corresponding path program 1 times [2024-02-10 00:25:51,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:51,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934403317] [2024-02-10 00:25:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:51,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:51,807 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:25:51,807 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:25:51,808 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:25:51,808 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:25:51,808 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:25:51,808 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:51,808 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:25:51,808 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:25:51,808 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_BEv2_Iteration3_Lasso [2024-02-10 00:25:51,808 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:25:51,808 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:25:51,820 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,822 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,002 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,004 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,007 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,076 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-02-10 00:25:52,279 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:25:52,280 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:25:52,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:52,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:52,283 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,325 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,327 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,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:52,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:52,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:52,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:52,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:52,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:52,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:52,400 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,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:52,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:52,411 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,434 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,437 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,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:52,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:52,445 INFO L204 nArgumentSynthesizer]: 5 loop disjuncts [2024-02-10 00:25:52,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:52,580 INFO L401 nArgumentSynthesizer]: We have 70 Motzkin's Theorem applications. [2024-02-10 00:25:52,580 INFO L402 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2024-02-10 00:25:52,904 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:25:53,145 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2024-02-10 00:25:53,145 INFO L444 ModelExtractionUtils]: 81 out of 100 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-02-10 00:25:53,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:53,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:53,159 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:53,187 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:25:53,194 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:53,219 INFO L438 nArgumentSynthesizer]: Removed 10 redundant supporting invariants from a total of 10. [2024-02-10 00:25:53,219 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:25:53,219 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2024-02-10 00:25:53,231 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:53,234 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:25:53,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:53,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:25:53,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:53,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 00:25:53,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:53,312 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:53,313 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:53,313 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:53,412 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:53,412 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:25:53,412 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:25:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 406 transitions. [2024-02-10 00:25:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 406 transitions. [2024-02-10 00:25:53,414 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:25:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 406 transitions. [2024-02-10 00:25:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 406 transitions. [2024-02-10 00:25:53,493 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:57,987 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:25:57,988 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:25:57,988 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:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-02-10 00:25:57,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 5 letters. Loop has 6 letters. [2024-02-10 00:25:57,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:57,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 11 letters. Loop has 6 letters. [2024-02-10 00:25:57,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:57,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 5 letters. Loop has 12 letters. [2024-02-10 00:25:57,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:57,999 INFO L428 stractBuchiCegarLoop]: Abstraction has has 70 places, 88988 transitions, 762463 flow [2024-02-10 00:25:57,999 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:25:57,999 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:57,999 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 70 places, 88988 transitions, 762463 flow [2024-02-10 00:27:45,659 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 6534 states, 6360 states have (on average 8.19559748427673) internal successors, (52124), 6533 states have internal predecessors, (52124), 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:45,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6534 states, 6360 states have (on average 8.19559748427673) internal successors, (52124), 6533 states have internal predecessors, (52124), 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:45,928 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 00:27:45,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 00:27:45,959 INFO L201 PluginConnector]: Adding new model map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:27:45 BoogieIcfgContainer [2024-02-10 00:27:45,959 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:27:45,960 INFO L158 Benchmark]: Toolchain (without parser) took 120163.43ms. Allocated memory was 173.0MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 141.7MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2024-02-10 00:27:45,960 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:27:45,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.21ms. Allocated memory is still 173.0MB. Free memory was 141.5MB in the beginning and 140.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 00:27:45,961 INFO L158 Benchmark]: Boogie Preprocessor took 49.87ms. Allocated memory is still 173.0MB. Free memory was 140.0MB in the beginning and 138.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:27:45,961 INFO L158 Benchmark]: RCFGBuilder took 465.58ms. Allocated memory is still 173.0MB. Free memory was 138.9MB in the beginning and 127.2MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-02-10 00:27:45,962 INFO L158 Benchmark]: BuchiAutomizer took 119589.06ms. Allocated memory was 173.0MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 127.0MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2024-02-10 00:27:45,963 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.21ms. Allocated memory is still 173.0MB. Free memory was 141.5MB in the beginning and 140.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.87ms. Allocated memory is still 173.0MB. Free memory was 140.0MB in the beginning and 138.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 465.58ms. Allocated memory is still 173.0MB. Free memory was 138.9MB in the beginning and 127.2MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 119589.06ms. Allocated memory was 173.0MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 127.0MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 3.5GB. 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 * k + N and consists of 5 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 119.3s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 4.1s. Construction of modules took 0.2s. Büchi inclusion checks took 5.5s. 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, 291 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 365 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 265 IncrementalHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 200 mSDtfsCounter, 265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital101 mio100 ax100 hnf100 lsp230 ukn39 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf95 smp100 dnf162 smp79 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 815ms VariablesStem: 4 VariablesLoop: 9 DisjunctsStem: 1 DisjunctsLoop: 5 SupportingInvariants: 10 MotzkinApplications: 70 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:45,992 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...