/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:34:05,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:34:06,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:34:06,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:34:06,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:34:06,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:34:06,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:34:06,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:34:06,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:34:06,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:34:06,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:34:06,050 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:34:06,050 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:34:06,051 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:34:06,051 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:34:06,051 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:34:06,051 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:34:06,052 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:34:06,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:34:06,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:34:06,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:34:06,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:34:06,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:34:06,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:34:06,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:34:06,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:34:06,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:34:06,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:34:06,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:34:06,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:34:06,055 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:34:06,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:34:06,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:34:06,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:34:06,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:34:06,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:34:06,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:34:06,057 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:34:06,057 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:34:06,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:34:06,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:34:06,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:34:06,435 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:34:06,436 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:34:06,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl [2024-02-10 01:34:06,437 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl' [2024-02-10 01:34:06,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:34:06,479 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:34:06,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:34:06,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:34:06,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:34:06,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:06" (1/1) ... [2024-02-10 01:34:06,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:06" (1/1) ... [2024-02-10 01:34:06,579 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:34:06,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:34:06,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:34:06,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:34:06,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:34:06,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:06" (1/1) ... [2024-02-10 01:34:06,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:06" (1/1) ... [2024-02-10 01:34:06,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:06" (1/1) ... [2024-02-10 01:34:06,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:06" (1/1) ... [2024-02-10 01:34:06,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:06" (1/1) ... [2024-02-10 01:34:06,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:06" (1/1) ... [2024-02-10 01:34:06,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:06" (1/1) ... [2024-02-10 01:34:06,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:06" (1/1) ... [2024-02-10 01:34:06,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:34:06,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:34:06,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:34:06,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:34:06,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:06" (1/1) ... [2024-02-10 01:34:06,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:06,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:06,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:34:06,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 01:34:06,717 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 01:34:06,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 01:34:06,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 01:34:06,718 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 01:34:06,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 01:34:06,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 01:34:06,719 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-02-10 01:34:06,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 01:34:06,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 01:34:06,719 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:34:06,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:34:06,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:34:06,721 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:34:06,766 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:34:06,767 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:34:06,859 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:34:06,878 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:34:06,878 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:34:06,880 INFO L201 PluginConnector]: Adding new model map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:34:06 BoogieIcfgContainer [2024-02-10 01:34:06,880 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:34:06,881 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:34:06,881 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:34:06,884 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:34:06,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:34:06,884 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:06" (1/2) ... [2024-02-10 01:34:06,885 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ed197f4 and model type map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:34:06, skipping insertion in model container [2024-02-10 01:34:06,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:34:06,885 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:34:06" (2/2) ... [2024-02-10 01:34:06,886 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-aggr-update2.bpl [2024-02-10 01:34:06,935 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-10 01:34:06,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2024-02-10 01:34:06,972 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2024-02-10 01:34:06,972 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 01:34:06,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-02-10 01:34:06,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2024-02-10 01:34:06,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2024-02-10 01:34:06,984 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:34:06,984 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:34:06,984 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:34:06,984 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:34:06,984 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:34:06,984 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:34:06,984 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:34:06,984 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:34:06,984 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:34:06,985 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 76 flow [2024-02-10 01:34:07,025 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 354 states, 352 states have (on average 2.9488636363636362) internal successors, (1038), 353 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:07,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 354 states, 352 states have (on average 2.9488636363636362) internal successors, (1038), 353 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:07,063 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 282 [2024-02-10 01:34:07,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:34:07,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:34:07,066 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:34:07,066 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:34:07,067 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 76 flow [2024-02-10 01:34:07,077 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 354 states, 352 states have (on average 2.9488636363636362) internal successors, (1038), 353 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:07,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 354 states, 352 states have (on average 2.9488636363636362) internal successors, (1038), 353 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:07,091 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 282 [2024-02-10 01:34:07,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:34:07,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:34:07,095 INFO L748 eck$LassoCheckResult]: Stem: Black: 752#[$Ultimate##0]don't care [85] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 755#[L34]don't care [109] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 757#[L34-1, $Ultimate##0]don't care [88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 759#[L51-1, L34-1]don't care [2024-02-10 01:34:07,095 INFO L750 eck$LassoCheckResult]: Loop: 759#[L51-1, L34-1]don't care [90] L51-1-->L52: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[] 765#[L52, L34-1]don't care [92] L52-->L53: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork0_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A] 777#[L53, L34-1]don't care [93] L53-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 759#[L51-1, L34-1]don't care [2024-02-10 01:34:07,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:07,102 INFO L85 PathProgramCache]: Analyzing trace with hash 114943, now seen corresponding path program 1 times [2024-02-10 01:34:07,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:07,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385820656] [2024-02-10 01:34:07,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:07,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:07,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:07,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:07,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:07,201 INFO L85 PathProgramCache]: Analyzing trace with hash 119226, now seen corresponding path program 1 times [2024-02-10 01:34:07,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:07,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969561701] [2024-02-10 01:34:07,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:07,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:07,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:07,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:07,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:07,222 INFO L85 PathProgramCache]: Analyzing trace with hash -870610948, now seen corresponding path program 1 times [2024-02-10 01:34:07,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:07,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674753669] [2024-02-10 01:34:07,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:07,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:07,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:07,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:07,401 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:34:07,402 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:34:07,402 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:34:07,402 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:34:07,402 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:34:07,402 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:07,403 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:34:07,403 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:34:07,403 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:34:07,403 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:34:07,403 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:34:07,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:07,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:07,583 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:34:07,587 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:34:07,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:07,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:07,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:34:07,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:34:07,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:07,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:34:07,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:07,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:07,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:07,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:34:07,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:34:07,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:07,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 01:34:07,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 01:34:07,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:07,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:07,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:34:07,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:34:07,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:07,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:07,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:07,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:07,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:07,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:07,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 01:34:07,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:34:07,741 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 01:34:07,741 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 01:34:07,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:07,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:07,745 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:34:07,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 01:34:07,748 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:34:07,756 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:34:07,756 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:34:07,757 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2024-02-10 01:34:07,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-02-10 01:34:07,763 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:34:07,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:07,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:34:07,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:07,849 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:34:07,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:34:07,939 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-10 01:34:07,941 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:08,184 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 439 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:34:08,185 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:34:08,186 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:34:08,198 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:34:08,198 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:34:08,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:34:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-02-10 01:34:08,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 3 letters. Loop has 3 letters. [2024-02-10 01:34:08,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:08,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-10 01:34:08,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:08,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 3 letters. Loop has 6 letters. [2024-02-10 01:34:08,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:08,209 INFO L428 stractBuchiCegarLoop]: Abstraction has has 54 places, 722 transitions, 3326 flow [2024-02-10 01:34:08,210 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:34:08,210 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:34:08,210 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 54 places, 722 transitions, 3326 flow [2024-02-10 01:34:08,406 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1103 states, 1093 states have (on average 3.867337602927722) internal successors, (4227), 1102 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:08,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1103 states, 1093 states have (on average 3.867337602927722) internal successors, (4227), 1102 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:08,457 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 462 [2024-02-10 01:34:08,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:34:08,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:34:08,459 INFO L748 eck$LassoCheckResult]: Stem: Black: 1513#[$Ultimate##0]don't care [85] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 1519#[L34]don't care [109] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] Black: 1526#[L34-1, $Ultimate##0]don't care [112] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_8, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1535#[L35, $Ultimate##0, $Ultimate##0]don't care [115] L35-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k] Black: 1568#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L36]don't care [101] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 1625#[$Ultimate##0, L85-1, $Ultimate##0, L36]don't care [2024-02-10 01:34:08,460 INFO L750 eck$LassoCheckResult]: Loop: 1625#[$Ultimate##0, L85-1, $Ultimate##0, L36]don't care [103] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[] Black: 1745#[$Ultimate##0, L86, $Ultimate##0, L36]don't care [105] L86-->L87: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork2_k_7 v_thread3Thread1of1ForFork2_k_7)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_3} AuxVars[] AssignedVars[B] 1931#[$Ultimate##0, L87, $Ultimate##0, L36]don't care [106] L87-->L85-1: Formula: (= v_thread3Thread1of1ForFork2_k_10 (+ v_thread3Thread1of1ForFork2_k_9 1)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] Black: 1635#[$Ultimate##0, L85-1, $Ultimate##0, L36]don't care [103] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[] 1732#[$Ultimate##0, L86, $Ultimate##0, L36]don't care [105] L86-->L87: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork2_k_7 v_thread3Thread1of1ForFork2_k_7)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_3} AuxVars[] AssignedVars[B] Black: 1941#[$Ultimate##0, L87, $Ultimate##0, L36]don't care [106] L87-->L85-1: Formula: (= v_thread3Thread1of1ForFork2_k_10 (+ v_thread3Thread1of1ForFork2_k_9 1)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 1625#[$Ultimate##0, L85-1, $Ultimate##0, L36]don't care [2024-02-10 01:34:08,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:08,460 INFO L85 PathProgramCache]: Analyzing trace with hash 110486953, now seen corresponding path program 1 times [2024-02-10 01:34:08,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:08,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359011805] [2024-02-10 01:34:08,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:08,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:08,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:08,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:08,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash -358431167, now seen corresponding path program 1 times [2024-02-10 01:34:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:08,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480481262] [2024-02-10 01:34:08,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:08,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:08,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:08,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:08,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1752183319, now seen corresponding path program 1 times [2024-02-10 01:34:08,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:08,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349724744] [2024-02-10 01:34:08,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:08,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:08,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:08,577 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:34:08,577 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:34:08,577 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:34:08,577 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:34:08,577 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:34:08,577 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:08,578 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:34:08,578 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:34:08,578 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:34:08,578 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:34:08,578 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:34:08,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:08,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:08,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-10 01:34:08,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-10 01:34:08,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:08,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:08,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:08,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:08,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:08,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:08,685 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:34:08,685 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:34:08,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:08,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:08,686 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:34:08,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 01:34:08,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:34:08,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:08,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:08,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:08,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:08,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:08,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:08,750 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-10 01:34:08,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:08,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 01:34:08,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:08,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:08,759 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:34:08,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 01:34:08,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:34:08,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:08,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:08,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:08,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:08,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:08,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:08,812 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:34:08,821 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 01:34:08,821 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-10 01:34:08,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:08,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:08,826 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:34:08,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 01:34:08,848 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:34:08,855 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:34:08,856 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:34:08,856 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_k, N) = -1*thread3Thread1of1ForFork2_k + 1*N Supporting invariants [] [2024-02-10 01:34:08,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-02-10 01:34:08,881 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:34:08,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:08,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:34:08,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:08,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:34:08,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:34:08,969 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 01:34:08,970 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:09,080 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 406 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:34:09,081 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:34:09,081 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:34:09,174 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:34:09,174 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:34:09,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:34:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-02-10 01:34:09,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 5 letters. Loop has 6 letters. [2024-02-10 01:34:09,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:09,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 11 letters. Loop has 6 letters. [2024-02-10 01:34:09,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:09,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 5 letters. Loop has 12 letters. [2024-02-10 01:34:09,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:09,178 INFO L428 stractBuchiCegarLoop]: Abstraction has has 70 places, 16600 transitions, 109332 flow [2024-02-10 01:34:09,178 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:34:09,178 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:34:09,179 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 70 places, 16600 transitions, 109332 flow [2024-02-10 01:34:09,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-10 01:34:14,993 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 4436 states, 4367 states have (on average 5.0968628348981) internal successors, (22258), 4435 states have internal predecessors, (22258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:15,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4436 states, 4367 states have (on average 5.0968628348981) internal successors, (22258), 4435 states have internal predecessors, (22258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:15,090 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 414 [2024-02-10 01:34:15,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:34:15,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:34:15,093 INFO L748 eck$LassoCheckResult]: Stem: Black: 4540#[$Ultimate##0]don't care [85] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] Black: 4543#[L34]don't care [109] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] Black: 4554#[L34-1, $Ultimate##0]don't care [112] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_8, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] Black: 4579#[L35, $Ultimate##0, $Ultimate##0]don't care [94] $Ultimate##0-->L64: Formula: (= (+ v_thread2Thread1of1ForFork1_pos_1 1) 0) InVars {} OutVars{thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_pos] Black: 4651#[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] 4847#[L35, L65-1, $Ultimate##0]don't care [2024-02-10 01:34:15,093 INFO L750 eck$LassoCheckResult]: Loop: 4847#[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[] Black: 5180#[L35, L66, $Ultimate##0]don't care [99] L66-->L70-1: Formula: (and (let ((.cse0 (select v_A_9 v_thread2Thread1of1ForFork1_j_7))) (or (and (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_j_7) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_3)))) (let ((.cse1 (select v_B_7 v_thread2Thread1of1ForFork1_j_7))) (or (and (<= .cse1 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork1_pos_4 v_thread2Thread1of1ForFork1_j_7))))) InVars {A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_3, B=v_B_7} OutVars{A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_4, B=v_B_7} AuxVars[v_thread2_pos_16] AssignedVars[thread2Thread1of1ForFork1_pos] 5765#[L35, L70-1, $Ultimate##0]don't care [100] L70-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_10 (+ v_thread2Thread1of1ForFork1_j_9 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] Black: 4854#[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[] 5165#[L35, L66, $Ultimate##0]don't care [99] L66-->L70-1: Formula: (and (let ((.cse0 (select v_A_9 v_thread2Thread1of1ForFork1_j_7))) (or (and (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_j_7) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_3)))) (let ((.cse1 (select v_B_7 v_thread2Thread1of1ForFork1_j_7))) (or (and (<= .cse1 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork1_pos_4 v_thread2Thread1of1ForFork1_j_7))))) InVars {A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_3, B=v_B_7} OutVars{A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_4, B=v_B_7} AuxVars[v_thread2_pos_16] AssignedVars[thread2Thread1of1ForFork1_pos] Black: 5772#[L35, L70-1, $Ultimate##0]don't care [100] L70-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_10 (+ v_thread2Thread1of1ForFork1_j_9 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 4847#[L35, L65-1, $Ultimate##0]don't care [2024-02-10 01:34:15,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash 110486296, now seen corresponding path program 1 times [2024-02-10 01:34:15,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:15,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470657337] [2024-02-10 01:34:15,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:15,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:15,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:15,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:15,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:15,122 INFO L85 PathProgramCache]: Analyzing trace with hash -535931903, now seen corresponding path program 1 times [2024-02-10 01:34:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:15,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627181363] [2024-02-10 01:34:15,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:15,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:15,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:15,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:15,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash -904050216, now seen corresponding path program 1 times [2024-02-10 01:34:15,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:15,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916196871] [2024-02-10 01:34:15,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:15,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:15,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:15,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:15,671 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:34:15,671 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:34:15,671 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:34:15,671 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:34:15,671 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:34:15,671 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:15,671 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:34:15,672 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:34:15,672 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_BEv2_Iteration3_Lasso [2024-02-10 01:34:15,672 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:34:15,672 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:34:15,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:15,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:15,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:15,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:15,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:34:15,952 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-02-10 01:34:16,148 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:34:16,149 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:34:16,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:16,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:16,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:34:16,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 01:34:16,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:34:16,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:16,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:16,174 INFO L204 nArgumentSynthesizer]: 5 loop disjuncts [2024-02-10 01:34:16,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:16,245 INFO L401 nArgumentSynthesizer]: We have 70 Motzkin's Theorem applications. [2024-02-10 01:34:16,245 INFO L402 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2024-02-10 01:34:16,394 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:34:16,604 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2024-02-10 01:34:16,604 INFO L444 ModelExtractionUtils]: 62 out of 100 variables were initially zero. Simplification set additionally 35 variables to zero. [2024-02-10 01:34:16,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:16,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:16,605 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:34:16,608 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:34:16,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 01:34:16,632 INFO L438 nArgumentSynthesizer]: Removed 10 redundant supporting invariants from a total of 10. [2024-02-10 01:34:16,632 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:34:16,633 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2024-02-10 01:34:16,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 01:34:16,659 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:34:16,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:16,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:34:16,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:16,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:34:16,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:34:16,706 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 01:34:16,707 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:16,764 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 406 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:34:16,764 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:34:16,764 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:34:17,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-02-10 01:34:19,927 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:34:19,927 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:34:19,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:34:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:34:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-02-10 01:34:19,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 5 letters. Loop has 6 letters. [2024-02-10 01:34:19,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:19,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 11 letters. Loop has 6 letters. [2024-02-10 01:34:19,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:19,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 5 letters. Loop has 12 letters. [2024-02-10 01:34:19,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:19,951 INFO L428 stractBuchiCegarLoop]: Abstraction has has 86 places, 380928 transitions, 3262272 flow [2024-02-10 01:34:19,951 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 01:34:19,951 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:34:19,951 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 86 places, 380928 transitions, 3262272 flow Received shutdown request... [2024-02-10 01:38:25,100 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 01:38:25,124 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 01:38:25,133 INFO L201 PluginConnector]: Adding new model map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:38:25 BoogieIcfgContainer [2024-02-10 01:38:25,134 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:38:25,135 INFO L158 Benchmark]: Toolchain (without parser) took 258654.93ms. Allocated memory was 151.0MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 86.3MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 6.0GB. Max. memory is 8.0GB. [2024-02-10 01:38:25,136 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 151.0MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:38:25,137 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.32ms. Allocated memory is still 151.0MB. Free memory was 86.1MB in the beginning and 120.5MB in the end (delta: -34.5MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2024-02-10 01:38:25,137 INFO L158 Benchmark]: Boogie Preprocessor took 38.90ms. Allocated memory is still 151.0MB. Free memory was 120.5MB in the beginning and 119.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:38:25,137 INFO L158 Benchmark]: RCFGBuilder took 256.92ms. Allocated memory is still 151.0MB. Free memory was 119.4MB in the beginning and 108.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 01:38:25,141 INFO L158 Benchmark]: BuchiAutomizer took 258252.73ms. Allocated memory was 151.0MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 108.3MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 6.0GB. Max. memory is 8.0GB. [2024-02-10 01:38:25,146 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10ms. Allocated memory is still 151.0MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 100.32ms. Allocated memory is still 151.0MB. Free memory was 86.1MB in the beginning and 120.5MB in the end (delta: -34.5MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.90ms. Allocated memory is still 151.0MB. Free memory was 120.5MB in the beginning and 119.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 256.92ms. Allocated memory is still 151.0MB. Free memory was 119.4MB in the beginning and 108.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 258252.73ms. Allocated memory was 151.0MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 108.3MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 6.0GB. 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) and one module whose termination is unknown.One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. The remainder module has 3262272 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 258.1s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6/6 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 290 mSDsluCounter, 365 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 200 mSDtfsCounter, 267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital103 mio100 ax100 hnf100 lsp231 ukn38 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp100 dnf162 smp79 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 483ms VariablesStem: 4 VariablesLoop: 9 DisjunctsStem: 1 DisjunctsLoop: 5 SupportingInvariants: 10 MotzkinApplications: 70 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing BuchiPetriNet2FiniteAutomaton. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2024-02-10 01:38:25,177 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 !SESSION 2024-02-10 01:34:03.253 ----------------------------------------------- eclipse.buildId=unknown java.version=11.0.12 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl Command-line arguments: -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl !ENTRY org.eclipse.osgi 4 0 2024-02-10 01:38:25.406 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede4746d9/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:190) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede4746d9/.metadata/.log.