/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_AUTOMATON -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:24:13,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:24:13,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-09 23:24:13,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:24:13,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:24:13,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:24:13,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:24:13,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:24:13,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:24:13,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:24:13,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:24:13,699 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:24:13,700 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:24:13,700 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:24:13,700 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:24:13,700 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:24:13,701 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:24:13,701 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:24:13,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:24:13,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:24:13,702 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:24:13,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:24:13,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:24:13,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:24:13,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:24:13,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:24:13,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:24:13,704 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:24:13,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:24:13,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:24:13,704 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:24:13,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:24:13,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:24:13,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:24:13,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:24:13,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:24:13,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:24:13,706 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:24:13,706 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_AUTOMATON [2024-02-09 23:24:13,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:24:14,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:24:14,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:24:14,014 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:24:14,028 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:24:14,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl [2024-02-09 23:24:14,029 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl' [2024-02-09 23:24:14,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:24:14,053 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:24:14,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:24:14,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:24:14,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:24:14,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:14" (1/1) ... [2024-02-09 23:24:14,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:14" (1/1) ... [2024-02-09 23:24:14,088 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-09 23:24:14,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:24:14,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:24:14,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:24:14,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:24:14,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:14" (1/1) ... [2024-02-09 23:24:14,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:14" (1/1) ... [2024-02-09 23:24:14,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:14" (1/1) ... [2024-02-09 23:24:14,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:14" (1/1) ... [2024-02-09 23:24:14,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:14" (1/1) ... [2024-02-09 23:24:14,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:14" (1/1) ... [2024-02-09 23:24:14,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:14" (1/1) ... [2024-02-09 23:24:14,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:14" (1/1) ... [2024-02-09 23:24:14,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:24:14,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:24:14,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:24:14,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:24:14,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:14" (1/1) ... [2024-02-09 23:24:14,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:14,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:14,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:14,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-09 23:24:14,224 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-09 23:24:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-09 23:24:14,224 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-09 23:24:14,225 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-09 23:24:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-09 23:24:14,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-09 23:24:14,226 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-02-09 23:24:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-09 23:24:14,226 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-09 23:24:14,226 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:24:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:24:14,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:24:14,227 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:24:14,267 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:24:14,269 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:24:14,376 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:24:14,383 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:24:14,384 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-09 23:24:14,388 INFO L201 PluginConnector]: Adding new model map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:24:14 BoogieIcfgContainer [2024-02-09 23:24:14,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:24:14,389 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:24:14,390 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:24:14,392 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:24:14,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:24:14,393 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:14" (1/2) ... [2024-02-09 23:24:14,394 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@154b8e32 and model type map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:24:14, skipping insertion in model container [2024-02-09 23:24:14,394 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:24:14,394 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:24:14" (2/2) ... [2024-02-09 23:24:14,395 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-aggr-update1.bpl [2024-02-09 23:24:14,447 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-09 23:24:14,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 101 flow [2024-02-09 23:24:14,487 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2024-02-09 23:24:14,487 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-09 23:24:14,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2024-02-09 23:24:14,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 40 transitions, 101 flow [2024-02-09 23:24:14,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 86 flow [2024-02-09 23:24:14,505 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:24:14,505 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:24:14,505 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:24:14,505 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:24:14,505 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:24:14,506 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:24:14,506 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:24:14,506 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-02-09 23:24:14,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2024-02-09 23:24:14,626 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 426 [2024-02-09 23:24:14,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:14,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:14,630 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-02-09 23:24:14,630 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-02-09 23:24:14,630 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:24:14,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 497 states, but on-demand construction may add more states [2024-02-09 23:24:14,655 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 426 [2024-02-09 23:24:14,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:14,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:14,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-02-09 23:24:14,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-02-09 23:24:14,662 INFO L748 eck$LassoCheckResult]: Stem: 45#[$Ultimate##0]don't care [83] $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[] 48#[L34]don't care [114] 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] 50#[$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] 54#[L34-1, L51-1]don't care [2024-02-09 23:24:14,662 INFO L750 eck$LassoCheckResult]: Loop: 54#[L34-1, L51-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[] 64#[L34-1, L52]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] 82#[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] 54#[L34-1, L51-1]don't care [2024-02-09 23:24:14,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash 113176, now seen corresponding path program 1 times [2024-02-09 23:24:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:14,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22037270] [2024-02-09 23:24:14,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:14,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:14,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:14,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:14,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash 119226, now seen corresponding path program 1 times [2024-02-09 23:24:14,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:14,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861981697] [2024-02-09 23:24:14,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:14,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:14,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:14,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:14,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash -923251645, now seen corresponding path program 1 times [2024-02-09 23:24:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607164460] [2024-02-09 23:24:14,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:14,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:14,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:14,913 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:24:14,913 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:24:14,913 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:24:14,913 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:24:14,913 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:24:14,914 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:14,914 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:24:14,914 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:24:14,914 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:24:14,914 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:24:14,914 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:24:14,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:14,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:15,016 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:24:15,019 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:24:15,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:15,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:15,022 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:15,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-09 23:24:15,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:15,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:15,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:24:15,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:15,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:15,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:15,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:24:15,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:24:15,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:15,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:15,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:15,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:15,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:15,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-09 23:24:15,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:15,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:15,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:15,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:15,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:15,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:15,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:15,131 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:24:15,152 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-09 23:24:15,153 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-09 23:24:15,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:15,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:15,156 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:15,161 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:24:15,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-09 23:24:15,173 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:24:15,173 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:24:15,174 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2024-02-09 23:24:15,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:15,179 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:24:15,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:15,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:24:15,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:15,219 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:24:15,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:24:15,260 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-09 23:24:15,262 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 497 states, but on-demand construction may add more states Second 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-09 23:24:15,393 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 497 states, but on-demand construction may add more states. Second 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 1272 states and 4753 transitions. Complement of second has 6 states. [2024-02-09 23:24:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:24:15,398 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-09 23:24:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-02-09 23:24:15,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 3 letters. Loop has 3 letters. [2024-02-09 23:24:15,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:15,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-09 23:24:15,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:15,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 3 letters. Loop has 6 letters. [2024-02-09 23:24:15,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:15,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1272 states and 4753 transitions. [2024-02-09 23:24:15,417 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 375 [2024-02-09 23:24:15,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1272 states to 994 states and 3732 transitions. [2024-02-09 23:24:15,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 527 [2024-02-09 23:24:15,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 727 [2024-02-09 23:24:15,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 994 states and 3732 transitions. [2024-02-09 23:24:15,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:24:15,436 INFO L218 hiAutomatonCegarLoop]: Abstraction has 994 states and 3732 transitions. [2024-02-09 23:24:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states and 3732 transitions. [2024-02-09 23:24:15,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 797. [2024-02-09 23:24:15,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 797 states have (on average 3.806775407779172) internal successors, (3034), 796 states have internal predecessors, (3034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3034 transitions. [2024-02-09 23:24:15,487 INFO L240 hiAutomatonCegarLoop]: Abstraction has 797 states and 3034 transitions. [2024-02-09 23:24:15,487 INFO L428 stractBuchiCegarLoop]: Abstraction has 797 states and 3034 transitions. [2024-02-09 23:24:15,487 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:24:15,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 797 states and 3034 transitions. [2024-02-09 23:24:15,492 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 375 [2024-02-09 23:24:15,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:15,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:15,493 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-02-09 23:24:15,493 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-02-09 23:24:15,493 INFO L748 eck$LassoCheckResult]: Stem: 3412#[$Ultimate##0]don't care [83] $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[] 3390#[L34]don't care [114] 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] 3392#[$Ultimate##0, L34-1]don't care [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 2438#[$Ultimate##0, L35, $Ultimate##0]don't care [120] 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] 2440#[L36, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [106] $Ultimate##0-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 3270#[L36, L83-1, $Ultimate##0, $Ultimate##0]don't care [2024-02-09 23:24:15,493 INFO L750 eck$LassoCheckResult]: Loop: 3270#[L36, L83-1, $Ultimate##0, $Ultimate##0]don't care [108] L83-1-->L84: 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[] 3228#[L36, $Ultimate##0, $Ultimate##0, L84]don't care [110] L84-->L85: 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] 3234#[L36, $Ultimate##0, $Ultimate##0, L85]don't care [111] L85-->L83-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] 3270#[L36, L83-1, $Ultimate##0, $Ultimate##0]don't care [2024-02-09 23:24:15,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:15,494 INFO L85 PathProgramCache]: Analyzing trace with hash 108793831, now seen corresponding path program 1 times [2024-02-09 23:24:15,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:15,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408790392] [2024-02-09 23:24:15,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:15,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:15,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:15,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:15,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash 137100, now seen corresponding path program 1 times [2024-02-09 23:24:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:15,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231875951] [2024-02-09 23:24:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:15,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:15,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:15,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:15,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1623181850, now seen corresponding path program 1 times [2024-02-09 23:24:15,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:15,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913830735] [2024-02-09 23:24:15,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:15,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:15,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:15,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:15,573 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:24:15,574 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:24:15,574 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:24:15,574 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:24:15,574 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:24:15,574 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:15,574 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:24:15,574 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:24:15,574 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:24:15,574 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:24:15,574 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:24:15,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:15,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:15,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-09 23:24:15,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:15,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:15,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:15,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:15,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:15,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:15,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:15,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-02-09 23:24:15,713 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:24:15,714 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:24:15,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:15,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:15,729 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:15,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-09 23:24:15,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:15,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:15,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:15,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:15,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:15,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:15,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:15,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:15,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-02-09 23:24:15,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:15,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:15,789 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:15,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-09 23:24:15,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:15,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:24:15,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:15,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:15,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:15,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:24:15,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:24:15,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-09 23:24:15,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:15,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:15,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:15,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:15,822 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:15,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:15,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:15,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:15,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:15,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:15,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:15,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:15,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-09 23:24:15,875 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:24:15,884 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-02-09 23:24:15,884 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-09 23:24:15,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:15,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:15,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:15,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-09 23:24:15,906 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:24:15,931 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:24:15,931 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:24:15,931 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_k, N) = -1*thread3Thread1of1ForFork2_k + 1*N Supporting invariants [] [2024-02-09 23:24:15,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:15,936 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:24:15,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:15,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:24:15,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:15,961 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:24:15,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:24:15,976 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-09 23:24:15,976 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 797 states and 3034 transitions. cyclomatic complexity: 2322 Second 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-09 23:24:16,031 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 797 states and 3034 transitions. cyclomatic complexity: 2322. Second 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 2163 states and 8930 transitions. Complement of second has 6 states. [2024-02-09 23:24:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:24:16,032 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-09 23:24:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-02-09 23:24:16,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 5 letters. Loop has 3 letters. [2024-02-09 23:24:16,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:16,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 8 letters. Loop has 3 letters. [2024-02-09 23:24:16,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:16,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 5 letters. Loop has 6 letters. [2024-02-09 23:24:16,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:16,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2163 states and 8930 transitions. [2024-02-09 23:24:16,054 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 288 [2024-02-09 23:24:16,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2163 states to 1532 states and 6372 transitions. [2024-02-09 23:24:16,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 569 [2024-02-09 23:24:16,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 735 [2024-02-09 23:24:16,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1532 states and 6372 transitions. [2024-02-09 23:24:16,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:24:16,070 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1532 states and 6372 transitions. [2024-02-09 23:24:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states and 6372 transitions. [2024-02-09 23:24:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1258. [2024-02-09 23:24:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1258 states have (on average 4.155007949125596) internal successors, (5227), 1257 states have internal predecessors, (5227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 5227 transitions. [2024-02-09 23:24:16,103 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1258 states and 5227 transitions. [2024-02-09 23:24:16,103 INFO L428 stractBuchiCegarLoop]: Abstraction has 1258 states and 5227 transitions. [2024-02-09 23:24:16,103 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:24:16,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1258 states and 5227 transitions. [2024-02-09 23:24:16,110 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 288 [2024-02-09 23:24:16,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:16,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:16,110 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-02-09 23:24:16,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-02-09 23:24:16,112 INFO L748 eck$LassoCheckResult]: Stem: 7267#[$Ultimate##0]don't care [83] $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[] 7241#[L34]don't care [114] 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] 7243#[$Ultimate##0, L34-1]don't care [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 6249#[$Ultimate##0, L35, $Ultimate##0]don't care [94] $Ultimate##0-->L64: Formula: (= v_thread2Thread1of1ForFork1_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_cnt] 6255#[L35, $Ultimate##0, L64]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] 7481#[L35, L65-1, $Ultimate##0]don't care [2024-02-09 23:24:16,112 INFO L750 eck$LassoCheckResult]: Loop: 7481#[L35, L65-1, $Ultimate##0]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[] 7685#[L35, L66, $Ultimate##0]don't care [100] L66-->L66-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork1_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} AuxVars[] AssignedVars[] 7555#[L66-2, L35, $Ultimate##0]don't care [103] L66-2-->L69-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork1_j_13) 0) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} AuxVars[] AssignedVars[] 7477#[L35, L69-1, $Ultimate##0]don't care [105] L69-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_16 (+ v_thread2Thread1of1ForFork1_j_15 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_15} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 7481#[L35, L65-1, $Ultimate##0]don't care [2024-02-09 23:24:16,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:16,112 INFO L85 PathProgramCache]: Analyzing trace with hash 108793014, now seen corresponding path program 1 times [2024-02-09 23:24:16,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:16,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475772100] [2024-02-09 23:24:16,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:16,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:16,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:16,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:16,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:16,130 INFO L85 PathProgramCache]: Analyzing trace with hash 3912646, now seen corresponding path program 1 times [2024-02-09 23:24:16,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:16,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866837496] [2024-02-09 23:24:16,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:16,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:16,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:16,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:16,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash 466116091, now seen corresponding path program 1 times [2024-02-09 23:24:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:16,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517440445] [2024-02-09 23:24:16,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:16,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:16,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:16,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:16,204 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:24:16,204 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:24:16,204 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:24:16,204 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:24:16,204 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:24:16,204 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:16,205 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:24:16,205 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:24:16,205 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration3_Lasso [2024-02-09 23:24:16,205 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:24:16,205 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:24:16,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:16,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:16,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:16,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:16,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:16,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:16,308 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:24:16,308 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:24:16,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:16,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:16,316 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:16,337 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-09 23:24:16,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:16,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:16,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:16,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:16,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:16,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:16,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:16,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:16,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-09 23:24:16,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:16,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:16,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:16,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:24:16,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:16,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:16,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:24:16,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:16,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:16,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:16,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:24:16,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:24:16,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-09 23:24:16,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:16,404 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-09 23:24:16,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:16,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:16,405 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-09 23:24:16,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:16,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:16,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:24:16,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:16,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:16,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:16,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:24:16,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:24:16,423 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-09 23:24:16,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:16,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:16,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:16,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:16,438 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-09 23:24:16,455 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-09 23:24:16,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:16,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:16,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:16,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:16,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:16,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:16,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:16,492 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:24:16,502 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-09 23:24:16,503 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-09 23:24:16,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:16,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:16,508 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-09 23:24:16,523 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:24:16,532 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-09 23:24:16,541 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:24:16,541 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:24:16,541 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2024-02-09 23:24:16,544 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-09 23:24:16,545 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:24:16,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:16,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:24:16,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:16,582 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:24:16,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:24:16,605 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-09 23:24:16,605 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1258 states and 5227 transitions. cyclomatic complexity: 4066 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:16,678 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1258 states and 5227 transitions. cyclomatic complexity: 4066. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3406 states and 14400 transitions. Complement of second has 6 states. [2024-02-09 23:24:16,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:24:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2024-02-09 23:24:16,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-09 23:24:16,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:16,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 9 letters. Loop has 4 letters. [2024-02-09 23:24:16,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:16,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 5 letters. Loop has 8 letters. [2024-02-09 23:24:16,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:16,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3406 states and 14400 transitions. [2024-02-09 23:24:16,719 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-09 23:24:16,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3406 states to 0 states and 0 transitions. [2024-02-09 23:24:16,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-02-09 23:24:16,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-02-09 23:24:16,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-02-09 23:24:16,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-02-09 23:24:16,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:24:16,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:24:16,720 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:24:16,720 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-09 23:24:16,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-02-09 23:24:16,720 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-09 23:24:16,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-09 23:24:16,727 INFO L201 PluginConnector]: Adding new model map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:24:16 BoogieIcfgContainer [2024-02-09 23:24:16,727 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:24:16,727 INFO L158 Benchmark]: Toolchain (without parser) took 2674.25ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 151.1MB in the beginning and 152.4MB in the end (delta: -1.3MB). Peak memory consumption was 61.2MB. Max. memory is 8.0GB. [2024-02-09 23:24:16,727 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 176.2MB. Free memory was 152.3MB in the beginning and 152.2MB in the end (delta: 60.5kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:24:16,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.69ms. Allocated memory is still 176.2MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-09 23:24:16,728 INFO L158 Benchmark]: Boogie Preprocessor took 27.78ms. Allocated memory is still 176.2MB. Free memory was 149.5MB in the beginning and 156.1MB in the end (delta: -6.6MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2024-02-09 23:24:16,728 INFO L158 Benchmark]: RCFGBuilder took 270.08ms. Allocated memory is still 176.2MB. Free memory was 156.0MB in the beginning and 145.8MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-09 23:24:16,729 INFO L158 Benchmark]: BuchiAutomizer took 2337.26ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 145.7MB in the beginning and 152.4MB in the end (delta: -6.7MB). Peak memory consumption was 57.6MB. Max. memory is 8.0GB. [2024-02-09 23:24:16,730 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13ms. Allocated memory is still 176.2MB. Free memory was 152.3MB in the beginning and 152.2MB in the end (delta: 60.5kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.69ms. Allocated memory is still 176.2MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.78ms. Allocated memory is still 176.2MB. Free memory was 149.5MB in the beginning and 156.1MB in the end (delta: -6.6MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. * RCFGBuilder took 270.08ms. Allocated memory is still 176.2MB. Free memory was 156.0MB in the beginning and 145.8MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2337.26ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 145.7MB in the beginning and 152.4MB in the end (delta: -6.7MB). Peak memory consumption was 57.6MB. 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 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 471 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s 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: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 138 IncrementalHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 134 mSDtfsCounter, 138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital49 mio100 ax100 hnf100 lsp92 ukn65 mio100 lsp93 div100 bol100 ite100 ukn100 eq143 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 99ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-09 23:24:16,742 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-09 23:24:16,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...