/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-comp.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:24:27,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:24:27,437 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:27,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:24:27,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:24:27,443 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:27,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:24:27,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:24:27,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:24:27,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:24:27,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:24:27,484 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:24:27,484 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:24:27,485 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:24:27,485 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:24:27,486 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:24:27,486 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:24:27,486 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:24:27,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:24:27,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:24:27,487 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:24:27,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:24:27,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:24:27,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:24:27,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:24:27,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:24:27,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:24:27,489 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:24:27,489 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:24:27,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:24:27,490 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:24:27,490 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:24:27,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:24:27,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:24:27,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:24:27,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:24:27,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:24:27,491 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:24:27,492 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:27,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:24:27,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:24:27,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:24:27,824 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:24:27,825 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:24:27,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl [2024-02-09 23:24:27,826 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl' [2024-02-09 23:24:27,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:24:27,848 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:24:27,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:24:27,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:24:27,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:24:27,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:27" (1/1) ... [2024-02-09 23:24:27,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:27" (1/1) ... [2024-02-09 23:24:27,872 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-09 23:24:27,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:24:27,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:24:27,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:24:27,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:24:27,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:27" (1/1) ... [2024-02-09 23:24:27,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:27" (1/1) ... [2024-02-09 23:24:27,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:27" (1/1) ... [2024-02-09 23:24:27,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:27" (1/1) ... [2024-02-09 23:24:27,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:27" (1/1) ... [2024-02-09 23:24:27,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:27" (1/1) ... [2024-02-09 23:24:27,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:27" (1/1) ... [2024-02-09 23:24:27,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:27" (1/1) ... [2024-02-09 23:24:27,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:24:27,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:24:27,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:24:27,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:24:27,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:27" (1/1) ... [2024-02-09 23:24:27,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:27,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:27,977 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:27,986 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:28,020 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-09 23:24:28,020 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-09 23:24:28,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-09 23:24:28,021 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-09 23:24:28,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-09 23:24:28,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-09 23:24:28,022 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-02-09 23:24:28,022 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-09 23:24:28,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-09 23:24:28,023 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:24:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:24:28,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:24:28,024 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:28,065 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:24:28,067 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:24:28,168 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:24:28,174 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:24:28,175 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-09 23:24:28,176 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:24:28 BoogieIcfgContainer [2024-02-09 23:24:28,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:24:28,177 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:24:28,178 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:24:28,181 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:24:28,182 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:24:28,182 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:27" (1/2) ... [2024-02-09 23:24:28,184 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@618fcb94 and model type map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:24:28, skipping insertion in model container [2024-02-09 23:24:28,184 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:24:28,184 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:24:28" (2/2) ... [2024-02-09 23:24:28,185 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-comp.bpl [2024-02-09 23:24:28,258 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-09 23:24:28,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2024-02-09 23:24:28,301 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2024-02-09 23:24:28,301 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-09 23:24:28,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-02-09 23:24:28,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2024-02-09 23:24:28,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2024-02-09 23:24:28,321 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:24:28,321 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:24:28,321 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:24:28,321 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:24:28,321 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:24:28,321 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:24:28,321 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:24:28,321 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-02-09 23:24:28,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2024-02-09 23:24:28,449 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 249 [2024-02-09 23:24:28,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:28,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:28,454 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-02-09 23:24:28,454 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-02-09 23:24:28,455 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:24:28,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 306 states, but on-demand construction may add more states [2024-02-09 23:24:28,468 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 249 [2024-02-09 23:24:28,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:28,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:28,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-02-09 23:24:28,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-02-09 23:24:28,474 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]don't care [65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[] 45#[L16]don't care [41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B] 47#[L18]don't care [90] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 49#[L18-1, $Ultimate##0]don't care [70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 51#[L34-1, L18-1]don't care [2024-02-09 23:24:28,475 INFO L750 eck$LassoCheckResult]: Loop: 51#[L34-1, L18-1]don't care [72] L34-1-->L35: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[] 57#[L18-1, L35]don't care [74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 1))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A] 69#[L18-1, L36]don't care [75] L36-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 51#[L34-1, L18-1]don't care [2024-02-09 23:24:28,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:28,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2902197, now seen corresponding path program 1 times [2024-02-09 23:24:28,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:28,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538636089] [2024-02-09 23:24:28,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:28,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:28,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:28,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:28,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:28,618 INFO L85 PathProgramCache]: Analyzing trace with hash 101352, now seen corresponding path program 1 times [2024-02-09 23:24:28,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:28,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947265216] [2024-02-09 23:24:28,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:28,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:28,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:28,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:28,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash 560076468, now seen corresponding path program 1 times [2024-02-09 23:24:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:28,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713950352] [2024-02-09 23:24:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:28,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:28,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:28,782 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:24:28,783 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:24:28,783 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:24:28,783 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:24:28,783 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:24:28,783 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:28,784 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:24:28,784 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:24:28,784 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:24:28,784 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:24:28,784 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:24:28,798 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:28,850 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:28,916 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:24:28,920 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:24:28,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:28,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:28,928 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:28,934 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:28,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:28,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:24:28,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:28,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:28,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:28,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:24:28,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:24:28,948 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:28,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:28,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-09 23:24:28,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:28,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:28,957 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:28,960 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:28,964 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:28,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:28,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:24:28,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:28,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:28,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:28,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:24:28,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:24:28,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:28,999 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:28,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:29,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:29,001 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:29,007 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:29,008 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:29,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:29,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:29,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:29,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:29,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:29,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:29,036 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:24:29,048 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-09 23:24:29,049 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-09 23:24:29,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:29,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:29,054 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:29,056 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:29,057 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:24:29,070 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:24:29,070 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:24:29,071 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:29,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:29,080 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:24:29,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:29,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:24:29,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:29,135 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:24:29,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:29,158 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:29,188 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:29,190 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 306 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:29,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:29,341 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 306 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 777 states and 2710 transitions. Complement of second has 6 states. [2024-02-09 23:24:29,343 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:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2024-02-09 23:24:29,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 4 letters. Loop has 3 letters. [2024-02-09 23:24:29,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:29,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 7 letters. Loop has 3 letters. [2024-02-09 23:24:29,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:29,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 4 letters. Loop has 6 letters. [2024-02-09 23:24:29,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:29,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 777 states and 2710 transitions. [2024-02-09 23:24:29,377 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 210 [2024-02-09 23:24:29,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 777 states to 579 states and 2025 transitions. [2024-02-09 23:24:29,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2024-02-09 23:24:29,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 424 [2024-02-09 23:24:29,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 579 states and 2025 transitions. [2024-02-09 23:24:29,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:24:29,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 579 states and 2025 transitions. [2024-02-09 23:24:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states and 2025 transitions. [2024-02-09 23:24:29,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 466. [2024-02-09 23:24:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 466 states have (on average 3.53862660944206) internal successors, (1649), 465 states have internal predecessors, (1649), 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:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1649 transitions. [2024-02-09 23:24:29,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 466 states and 1649 transitions. [2024-02-09 23:24:29,479 INFO L428 stractBuchiCegarLoop]: Abstraction has 466 states and 1649 transitions. [2024-02-09 23:24:29,479 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:24:29,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 466 states and 1649 transitions. [2024-02-09 23:24:29,483 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 210 [2024-02-09 23:24:29,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:29,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:29,483 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-02-09 23:24:29,483 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-02-09 23:24:29,484 INFO L748 eck$LassoCheckResult]: Stem: 2313#[$Ultimate##0]don't care [65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[] 2199#[L16]don't care [41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B] 2201#[L18]don't care [90] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 2385#[L18-1, $Ultimate##0]don't care [93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1801#[$Ultimate##0, L19, $Ultimate##0]don't care [76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 1807#[L19, L46-1, $Ultimate##0]don't care [2024-02-09 23:24:29,484 INFO L750 eck$LassoCheckResult]: Loop: 1807#[L19, L46-1, $Ultimate##0]don't care [78] L46-1-->L47: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[] 2351#[L19, L47, $Ultimate##0]don't care [80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A] 2355#[L48, L19, $Ultimate##0]don't care [81] L48-->L46-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 1807#[L19, L46-1, $Ultimate##0]don't care [2024-02-09 23:24:29,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash 89968896, now seen corresponding path program 1 times [2024-02-09 23:24:29,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:29,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047994982] [2024-02-09 23:24:29,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:29,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:29,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:29,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:29,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:29,513 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 1 times [2024-02-09 23:24:29,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:29,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732912822] [2024-02-09 23:24:29,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:29,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:29,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:29,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:29,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:29,531 INFO L85 PathProgramCache]: Analyzing trace with hash 203865551, now seen corresponding path program 1 times [2024-02-09 23:24:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:29,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302610172] [2024-02-09 23:24:29,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:29,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:29,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:29,635 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:24:29,635 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:24:29,635 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:24:29,635 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:24:29,635 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:24:29,635 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:29,635 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:24:29,635 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:24:29,636 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:24:29,636 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:24:29,636 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:24:29,638 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:29,641 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:29,643 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:29,658 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:29,662 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:29,718 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:24:29,718 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:24:29,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:29,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:29,721 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:29,732 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:29,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:29,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:24:29,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:29,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:29,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:29,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:24:29,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:24:29,745 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:29,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:29,759 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:29,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:29,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:29,763 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:29,764 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:29,769 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:29,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:29,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:29,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:29,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:29,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:29,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:29,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:29,808 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:29,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:29,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:29,810 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:29,816 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:29,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:29,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:29,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:29,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:29,825 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:29,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:29,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:29,844 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:24:29,850 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-09 23:24:29,850 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-02-09 23:24:29,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:29,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:29,852 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:29,858 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:24:29,866 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:29,889 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:24:29,889 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:24:29,890 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 1*N Supporting invariants [] [2024-02-09 23:24:29,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:29,897 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:24:29,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:29,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:24:29,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:29,933 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:24:29,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:29,962 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:29,965 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:29,966 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 466 states and 1649 transitions. cyclomatic complexity: 1256 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:30,059 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 466 states and 1649 transitions. cyclomatic complexity: 1256. 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 1378 states and 5322 transitions. Complement of second has 6 states. [2024-02-09 23:24:30,060 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:30,061 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:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2024-02-09 23:24:30,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 5 letters. Loop has 3 letters. [2024-02-09 23:24:30,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:30,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 8 letters. Loop has 3 letters. [2024-02-09 23:24:30,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:30,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 5 letters. Loop has 6 letters. [2024-02-09 23:24:30,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:30,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1378 states and 5322 transitions. [2024-02-09 23:24:30,079 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 129 [2024-02-09 23:24:30,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1378 states to 892 states and 3431 transitions. [2024-02-09 23:24:30,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 319 [2024-02-09 23:24:30,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 419 [2024-02-09 23:24:30,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 3431 transitions. [2024-02-09 23:24:30,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:24:30,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 892 states and 3431 transitions. [2024-02-09 23:24:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 3431 transitions. [2024-02-09 23:24:30,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 726. [2024-02-09 23:24:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 726 states have (on average 3.834710743801653) internal successors, (2784), 725 states have internal predecessors, (2784), 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:30,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2784 transitions. [2024-02-09 23:24:30,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 726 states and 2784 transitions. [2024-02-09 23:24:30,132 INFO L428 stractBuchiCegarLoop]: Abstraction has 726 states and 2784 transitions. [2024-02-09 23:24:30,132 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:24:30,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 726 states and 2784 transitions. [2024-02-09 23:24:30,137 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 129 [2024-02-09 23:24:30,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:30,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:30,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-02-09 23:24:30,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-02-09 23:24:30,139 INFO L748 eck$LassoCheckResult]: Stem: 4749#[$Ultimate##0]don't care [65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[] 4573#[L16]don't care [41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B] 4575#[L18]don't care [90] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 4901#[L18-1, $Ultimate##0]don't care [93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 4159#[$Ultimate##0, L19, $Ultimate##0]don't care [96] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_14, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_i, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 4161#[$Ultimate##0, L20, $Ultimate##0, $Ultimate##0]don't care [82] $Ultimate##0-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i] 4709#[$Ultimate##0, L20, L58-1, $Ultimate##0]don't care [2024-02-09 23:24:30,139 INFO L750 eck$LassoCheckResult]: Loop: 4709#[$Ultimate##0, L20, L58-1, $Ultimate##0]don't care [84] L58-1-->L59: Formula: (< v_thread3Thread1of1ForFork2_i_5 v_N_5) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} AuxVars[] AssignedVars[] 4181#[$Ultimate##0, L20, L59, $Ultimate##0]don't care [86] L59-->L60: Formula: (= v_B_1 (store v_B_2 v_thread3Thread1of1ForFork2_i_7 (+ 3 (select v_B_2 v_thread3Thread1of1ForFork2_i_7)))) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_2} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_1} AuxVars[] AssignedVars[B] 4185#[$Ultimate##0, L20, L60, $Ultimate##0]don't care [87] L60-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_10 (+ v_thread3Thread1of1ForFork2_i_9 1)) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_9} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i] 4709#[$Ultimate##0, L20, L58-1, $Ultimate##0]don't care [2024-02-09 23:24:30,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:30,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1505930818, now seen corresponding path program 1 times [2024-02-09 23:24:30,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:30,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444193530] [2024-02-09 23:24:30,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:30,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:30,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:30,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:30,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash 113268, now seen corresponding path program 1 times [2024-02-09 23:24:30,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:30,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795630788] [2024-02-09 23:24:30,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:30,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:30,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:30,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:30,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:30,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2043458455, now seen corresponding path program 1 times [2024-02-09 23:24:30,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:30,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570240179] [2024-02-09 23:24:30,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:30,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:30,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:30,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:30,268 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:24:30,268 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:24:30,268 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:24:30,268 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:24:30,268 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:24:30,268 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:30,268 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:24:30,268 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:24:30,269 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration3_Lasso [2024-02-09 23:24:30,269 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:24:30,269 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:24:30,270 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:30,272 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:30,284 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:30,286 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:30,288 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:30,291 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:30,295 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:30,297 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:30,300 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:30,385 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:24:30,386 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:24:30,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:30,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:30,388 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:30,391 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:30,432 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:30,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:30,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:24:30,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:30,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:30,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:30,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:24:30,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:24:30,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:30,457 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:30,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:30,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:30,458 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:30,461 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:30,462 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:30,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:30,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:30,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:30,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:30,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:30,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:30,496 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:24:30,504 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-09 23:24:30,504 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-09 23:24:30,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:30,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:30,507 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:30,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:24:30,523 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:30,536 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:24:30,536 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:24:30,536 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_i, N) = -1*thread3Thread1of1ForFork2_i + 1*N Supporting invariants [] [2024-02-09 23:24:30,543 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:30,544 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:24:30,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:30,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:24:30,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:30,578 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:24:30,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:30,599 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:30,599 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:30,600 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 726 states and 2784 transitions. cyclomatic complexity: 2146 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:30,668 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 726 states and 2784 transitions. cyclomatic complexity: 2146. 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 1931 states and 7508 transitions. Complement of second has 6 states. [2024-02-09 23:24:30,668 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:30,670 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:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2024-02-09 23:24:30,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-09 23:24:30,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:30,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 9 letters. Loop has 3 letters. [2024-02-09 23:24:30,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:30,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 6 letters. Loop has 6 letters. [2024-02-09 23:24:30,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:30,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1931 states and 7508 transitions. [2024-02-09 23:24:30,692 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-09 23:24:30,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1931 states to 0 states and 0 transitions. [2024-02-09 23:24:30,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-02-09 23:24:30,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-02-09 23:24:30,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-02-09 23:24:30,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-02-09 23:24:30,693 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:24:30,693 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:24:30,693 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:24:30,693 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-09 23:24:30,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-02-09 23:24:30,693 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-09 23:24:30,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-09 23:24:30,704 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:24:30 BoogieIcfgContainer [2024-02-09 23:24:30,704 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:24:30,705 INFO L158 Benchmark]: Toolchain (without parser) took 2856.60ms. Allocated memory was 179.3MB in the beginning and 281.0MB in the end (delta: 101.7MB). Free memory was 146.4MB in the beginning and 121.5MB in the end (delta: 24.9MB). Peak memory consumption was 126.1MB. Max. memory is 8.0GB. [2024-02-09 23:24:30,706 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:24:30,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.71ms. Allocated memory is still 179.3MB. Free memory was 146.2MB in the beginning and 144.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:24:30,707 INFO L158 Benchmark]: Boogie Preprocessor took 50.71ms. Allocated memory was 179.3MB in the beginning and 281.0MB in the end (delta: 101.7MB). Free memory was 144.6MB in the beginning and 255.9MB in the end (delta: -111.3MB). Peak memory consumption was 3.0MB. Max. memory is 8.0GB. [2024-02-09 23:24:30,709 INFO L158 Benchmark]: RCFGBuilder took 244.81ms. Allocated memory is still 281.0MB. Free memory was 255.6MB in the beginning and 245.9MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-09 23:24:30,711 INFO L158 Benchmark]: BuchiAutomizer took 2526.85ms. Allocated memory is still 281.0MB. Free memory was 245.7MB in the beginning and 121.5MB in the end (delta: 124.2MB). Peak memory consumption was 125.2MB. Max. memory is 8.0GB. [2024-02-09 23:24:30,713 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.09ms. Allocated memory is still 179.3MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.71ms. Allocated memory is still 179.3MB. Free memory was 146.2MB in the beginning and 144.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.71ms. Allocated memory was 179.3MB in the beginning and 281.0MB in the end (delta: 101.7MB). Free memory was 144.6MB in the beginning and 255.9MB in the end (delta: -111.3MB). Peak memory consumption was 3.0MB. Max. memory is 8.0GB. * RCFGBuilder took 244.81ms. Allocated memory is still 281.0MB. Free memory was 255.6MB in the beginning and 245.9MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2526.85ms. Allocated memory is still 281.0MB. Free memory was 245.7MB in the beginning and 121.5MB in the end (delta: 124.2MB). Peak memory consumption was 125.2MB. 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 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 279 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 180 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 135 IncrementalHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 98 mSDtfsCounter, 135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital46 mio100 ax100 hnf100 lsp79 ukn63 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 70ms 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:30,735 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:30,934 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:31,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...