/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/mts.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:40:35,849 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:40:35,918 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:40:35,952 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:40:35,952 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:40:35,953 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:40:35,954 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:40:35,955 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:40:35,955 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:40:35,959 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:40:35,959 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:40:35,959 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:40:35,959 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:40:35,961 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:40:35,961 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:40:35,961 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:40:35,961 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:40:35,962 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:40:35,962 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:40:35,962 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:40:35,962 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:40:35,964 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:40:35,964 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:40:35,964 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:40:35,964 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:40:35,964 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:40:35,965 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:40:35,965 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:40:35,965 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:40:35,965 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:40:35,966 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:40:35,967 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:40:35,967 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:40:35,968 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:40:35,968 INFO L137 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 -> RABIN_PETRI_NET [2023-10-12 17:40:36,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:40:36,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:40:36,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:40:36,232 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:40:36,233 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:40:36,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/mts.wvr.bpl [2023-10-12 17:40:36,234 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/mts.wvr.bpl' [2023-10-12 17:40:36,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:40:36,269 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:40:36,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:36,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:40:36,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:40:36,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mts.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:36" (1/1) ... [2023-10-12 17:40:36,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mts.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:36" (1/1) ... [2023-10-12 17:40:36,293 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:40:36,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:36,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:40:36,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:40:36,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:40:36,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mts.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:36" (1/1) ... [2023-10-12 17:40:36,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mts.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:36" (1/1) ... [2023-10-12 17:40:36,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mts.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:36" (1/1) ... [2023-10-12 17:40:36,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mts.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:36" (1/1) ... [2023-10-12 17:40:36,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mts.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:36" (1/1) ... [2023-10-12 17:40:36,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mts.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:36" (1/1) ... [2023-10-12 17:40:36,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "mts.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:36" (1/1) ... [2023-10-12 17:40:36,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mts.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:36" (1/1) ... [2023-10-12 17:40:36,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:40:36,325 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:40:36,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:40:36,325 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:40:36,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mts.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:36" (1/1) ... [2023-10-12 17:40:36,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:36,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:36,354 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) [2023-10-12 17:40:36,365 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 [2023-10-12 17:40:36,394 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:40:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:40:36,395 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:40:36,395 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:40:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:40:36,395 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:40:36,395 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:40:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:40:36,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:40:36,396 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:40:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:40:36,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:40:36,397 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:40:36,450 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:40:36,452 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:40:36,562 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:40:36,580 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:40:36,581 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:40:36,583 INFO L201 PluginConnector]: Adding new model mts.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:36 BoogieIcfgContainer [2023-10-12 17:40:36,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:40:36,584 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:40:36,584 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:40:36,587 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:40:36,588 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:36,588 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mts.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:36" (1/2) ... [2023-10-12 17:40:36,589 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16a236ff and model type mts.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:40:36, skipping insertion in model container [2023-10-12 17:40:36,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:36,590 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mts.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:36" (2/2) ... [2023-10-12 17:40:36,591 INFO L332 chiAutomizerObserver]: Analyzing ICFG mts.wvr.bpl [2023-10-12 17:40:36,664 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:40:36,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:40:36,708 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:40:36,709 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:36,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:40:36,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:40:36,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:36,720 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:40:36,733 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:36,736 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:36,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:36,742 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:40:36,743 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:36,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:40:36,744 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:40:37,043 INFO L134 LiptonReduction]: Checked pairs total: 96 [2023-10-12 17:40:37,043 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:40:37,055 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:40:37,055 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:40:37,055 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:40:37,056 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:40:37,056 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:40:37,056 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:40:37,056 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:40:37,056 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:40:37,057 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:40:37,060 ERROR L47 etriNetUnfolderRabin]: [1:1A:[103] $Ultimate##0-->L61: Formula: (and (= v_i_19 v_sum_23) (= v_i_19 v_mts1_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_mts2_19) (= v_i_19 v_j_19) (= v_M_14 v_k_24) (= v_i_19 v_mts3_19)) InVars {sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} OutVars{sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} AuxVars[] AssignedVars[][13], 2:2A:[83] L61-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0]][3:3A:[101] L24-1-->L24-1: Formula: (and (= (let ((.cse0 (+ (select v_A_17 v_i_16) v_mts1_16))) (ite (< .cse0 0) 0 .cse0)) v_mts1_15) (= v_i_15 (+ v_i_16 1)) (< v_i_16 v_N_12)) InVars {A=v_A_17, N=v_N_12, i=v_i_16, mts1=v_mts1_16} OutVars{A=v_A_17, N=v_N_12, i=v_i_15, mts1=v_mts1_15} AuxVars[] AssignedVars[i, mts1][12]] [2023-10-12 17:40:37,061 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:37,062 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:37,062 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:37,062 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:37,064 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:40:37,065 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:40:37,066 ERROR L47 etriNetUnfolderRabin]: [1:1A:[103] $Ultimate##0-->L61: Formula: (and (= v_i_19 v_sum_23) (= v_i_19 v_mts1_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_mts2_19) (= v_i_19 v_j_19) (= v_M_14 v_k_24) (= v_i_19 v_mts3_19)) InVars {sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} OutVars{sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} AuxVars[] AssignedVars[][13], 2:2A:[83] L61-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0]][3:3A:[101] L24-1-->L24-1: Formula: (and (= (let ((.cse0 (+ (select v_A_17 v_i_16) v_mts1_16))) (ite (< .cse0 0) 0 .cse0)) v_mts1_15) (= v_i_15 (+ v_i_16 1)) (< v_i_16 v_N_12)) InVars {A=v_A_17, N=v_N_12, i=v_i_16, mts1=v_mts1_16} OutVars{A=v_A_17, N=v_N_12, i=v_i_15, mts1=v_mts1_15} AuxVars[] AssignedVars[i, mts1][12]] [2023-10-12 17:40:37,066 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:37,066 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:37,067 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:37,067 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:37,071 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [103] $Ultimate##0-->L61: Formula: (and (= v_i_19 v_sum_23) (= v_i_19 v_mts1_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_mts2_19) (= v_i_19 v_j_19) (= v_M_14 v_k_24) (= v_i_19 v_mts3_19)) InVars {sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} OutVars{sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} AuxVars[] AssignedVars[] 42#[L61]true [83] L61-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L61-1, L24-1]true [2023-10-12 17:40:37,071 INFO L750 eck$LassoCheckResult]: Loop: 44#[L61-1, L24-1]true [101] L24-1-->L24-1: Formula: (and (= (let ((.cse0 (+ (select v_A_17 v_i_16) v_mts1_16))) (ite (< .cse0 0) 0 .cse0)) v_mts1_15) (= v_i_15 (+ v_i_16 1)) (< v_i_16 v_N_12)) InVars {A=v_A_17, N=v_N_12, i=v_i_16, mts1=v_mts1_16} OutVars{A=v_A_17, N=v_N_12, i=v_i_15, mts1=v_mts1_15} AuxVars[] AssignedVars[i, mts1] 44#[L61-1, L24-1]true [2023-10-12 17:40:37,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash 4237, now seen corresponding path program 1 times [2023-10-12 17:40:37,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:37,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616761642] [2023-10-12 17:40:37,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:37,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:37,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:37,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:37,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:37,259 INFO L85 PathProgramCache]: Analyzing trace with hash 132, now seen corresponding path program 1 times [2023-10-12 17:40:37,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:37,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113340009] [2023-10-12 17:40:37,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:37,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:37,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:37,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:37,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:37,307 INFO L85 PathProgramCache]: Analyzing trace with hash 131448, now seen corresponding path program 1 times [2023-10-12 17:40:37,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:37,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342594967] [2023-10-12 17:40:37,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:37,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:37,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:37,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:37,527 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:37,528 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:37,528 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:37,528 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:37,528 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:37,528 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:37,528 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:37,528 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:37,529 INFO L133 ssoRankerPreferences]: Filename of dumped script: mts.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:40:37,529 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:37,529 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:37,545 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:37,555 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:37,559 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:37,563 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:37,567 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:37,570 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:37,749 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:37,752 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:37,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:37,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:37,761 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) [2023-10-12 17:40:37,768 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 [2023-10-12 17:40:37,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 [2023-10-12 17:40:37,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:37,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:37,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:37,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:37,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:37,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:37,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:37,803 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 [2023-10-12 17:40:37,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:37,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:37,804 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) [2023-10-12 17:40:37,806 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 [2023-10-12 17:40:37,808 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 [2023-10-12 17:40:37,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:37,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:37,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:37,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:37,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:37,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:37,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:37,834 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 [2023-10-12 17:40:37,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:37,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:37,836 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) [2023-10-12 17:40:37,845 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 [2023-10-12 17:40:37,849 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 [2023-10-12 17:40:37,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:37,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:37,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:37,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:37,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:37,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:37,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:37,878 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 [2023-10-12 17:40:37,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:37,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:37,879 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) [2023-10-12 17:40:37,885 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 [2023-10-12 17:40:37,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:37,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:37,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:37,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:37,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:37,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:37,900 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 [2023-10-12 17:40:37,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:37,918 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 [2023-10-12 17:40:37,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:37,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:37,920 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) [2023-10-12 17:40:37,923 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 [2023-10-12 17:40:37,925 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 [2023-10-12 17:40:37,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:37,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:37,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:37,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:37,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:37,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:37,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:37,957 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 [2023-10-12 17:40:37,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:37,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:37,959 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) [2023-10-12 17:40:37,968 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 [2023-10-12 17:40:37,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:37,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:37,977 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:40:37,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:37,985 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:40:37,985 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:40:37,987 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 [2023-10-12 17:40:38,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:38,019 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 [2023-10-12 17:40:38,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:38,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:38,021 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) [2023-10-12 17:40:38,024 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 [2023-10-12 17:40:38,026 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 [2023-10-12 17:40:38,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:38,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:38,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:38,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:38,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:38,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:38,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:38,065 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:40:38,066 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:40:38,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:38,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:38,070 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) [2023-10-12 17:40:38,071 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 [2023-10-12 17:40:38,073 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:38,099 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:38,099 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:38,100 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:40:38,105 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 [2023-10-12 17:40:38,108 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:38,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:38,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:38,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:38,150 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:38,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:38,190 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:40:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2023-10-12 17:40:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:40:38,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:40:38,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:38,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:38,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:38,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:40:38,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:38,286 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 60 transitions, 312 flow [2023-10-12 17:40:38,286 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:40:38,286 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 60 transitions, 312 flow [2023-10-12 17:40:38,288 ERROR L47 etriNetUnfolderRabin]: [1:1A:[103] $Ultimate##0-->L61: Formula: (and (= v_i_19 v_sum_23) (= v_i_19 v_mts1_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_mts2_19) (= v_i_19 v_j_19) (= v_M_14 v_k_24) (= v_i_19 v_mts3_19)) InVars {sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} OutVars{sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} AuxVars[] AssignedVars[][52], 2:2A:[83] L61-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0], 4:3A:[86] L61-1-->L35-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][14]][5:4A:[99] L35-1-->L35-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (+ (select v_A_15 v_j_16) v_mts2_16))) (ite (< .cse0 0) 0 .cse0)) v_mts2_15) (< v_j_16 v_M_10)) InVars {A=v_A_15, M=v_M_10, j=v_j_16, mts2=v_mts2_16} OutVars{A=v_A_15, M=v_M_10, j=v_j_15, mts2=v_mts2_15} AuxVars[] AssignedVars[j, mts2][47]] [2023-10-12 17:40:38,288 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:38,288 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:40:38,288 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:38,289 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:38,289 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [103] $Ultimate##0-->L61: Formula: (and (= v_i_19 v_sum_23) (= v_i_19 v_mts1_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_mts2_19) (= v_i_19 v_j_19) (= v_M_14 v_k_24) (= v_i_19 v_mts3_19)) InVars {sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} OutVars{sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} AuxVars[] AssignedVars[] 42#[L61]true [83] L61-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L61-1, L24-1]true [86] L61-1-->L35-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 79#[L62, L24-1, L35-1]true [2023-10-12 17:40:38,289 INFO L750 eck$LassoCheckResult]: Loop: 79#[L62, L24-1, L35-1]true [99] L35-1-->L35-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (+ (select v_A_15 v_j_16) v_mts2_16))) (ite (< .cse0 0) 0 .cse0)) v_mts2_15) (< v_j_16 v_M_10)) InVars {A=v_A_15, M=v_M_10, j=v_j_16, mts2=v_mts2_16} OutVars{A=v_A_15, M=v_M_10, j=v_j_15, mts2=v_mts2_15} AuxVars[] AssignedVars[j, mts2] 79#[L62, L24-1, L35-1]true [2023-10-12 17:40:38,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash 131433, now seen corresponding path program 1 times [2023-10-12 17:40:38,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:38,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220088902] [2023-10-12 17:40:38,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:38,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:38,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:38,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:38,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2023-10-12 17:40:38,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:38,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403363092] [2023-10-12 17:40:38,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:38,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:38,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:38,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:38,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:38,311 INFO L85 PathProgramCache]: Analyzing trace with hash 4074522, now seen corresponding path program 1 times [2023-10-12 17:40:38,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:38,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067418034] [2023-10-12 17:40:38,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:38,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:38,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:38,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:38,441 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 [2023-10-12 17:40:38,468 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:38,469 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:38,469 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:38,469 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:38,469 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:38,469 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:38,469 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:38,469 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:38,469 INFO L133 ssoRankerPreferences]: Filename of dumped script: mts.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:40:38,469 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:38,470 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:38,472 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:38,476 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:38,512 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:38,516 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:38,518 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:38,521 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:38,524 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:38,530 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:38,660 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:38,660 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:38,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:38,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:38,661 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) [2023-10-12 17:40:38,668 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 [2023-10-12 17:40:38,693 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 [2023-10-12 17:40:38,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:38,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:38,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:38,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:38,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:38,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:38,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:38,726 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 [2023-10-12 17:40:38,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:38,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:38,731 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) [2023-10-12 17:40:38,740 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 [2023-10-12 17:40:38,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:38,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:38,748 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:40:38,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:38,752 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 [2023-10-12 17:40:38,757 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:40:38,758 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:40:38,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:38,788 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 [2023-10-12 17:40:38,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:38,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:38,790 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) [2023-10-12 17:40:38,793 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 [2023-10-12 17:40:38,794 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 [2023-10-12 17:40:38,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:38,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:38,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:38,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:38,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:38,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:38,825 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:38,844 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-10-12 17:40:38,844 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:40:38,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:38,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:38,846 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:38,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:40:38,986 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:38,995 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:38,995 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:38,995 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:40:39,001 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 [2023-10-12 17:40:39,002 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:39,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:39,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:39,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:39,031 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:39,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:39,032 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:40:39,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2023-10-12 17:40:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:40:39,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:39,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:39,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:39,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:39,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:40:39,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:39,119 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 240 transitions, 1728 flow [2023-10-12 17:40:39,121 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:40:39,122 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 30 places, 240 transitions, 1728 flow [2023-10-12 17:40:39,125 ERROR L47 etriNetUnfolderRabin]: [1:1A:[103] $Ultimate##0-->L61: Formula: (and (= v_i_19 v_sum_23) (= v_i_19 v_mts1_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_mts2_19) (= v_i_19 v_j_19) (= v_M_14 v_k_24) (= v_i_19 v_mts3_19)) InVars {sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} OutVars{sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} AuxVars[] AssignedVars[][209], 2:2A:[83] L61-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[86] L61-1-->L35-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][57], 7:4A:[89] L62-->L46-1: 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} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][95]][8:5A:[94] L46-1-->L46-1: Formula: (let ((.cse0 (select v_A_13 v_k_19))) (and (= v_sum_13 (+ v_sum_14 .cse0)) (= v_k_18 (+ v_k_19 1)) (< v_k_19 v_N_8) (= (let ((.cse1 (+ v_mts3_10 .cse0))) (ite (< .cse1 0) 0 .cse1)) v_mts3_9))) InVars {sum=v_sum_14, A=v_A_13, N=v_N_8, k=v_k_19, mts3=v_mts3_10} OutVars{sum=v_sum_13, A=v_A_13, N=v_N_8, k=v_k_18, mts3=v_mts3_9} AuxVars[] AssignedVars[sum, k, mts3][126]] [2023-10-12 17:40:39,126 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:39,126 INFO L124 PetriNetUnfolderBase]: 2/7 cut-off events. [2023-10-12 17:40:39,126 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:40:39,126 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:39,126 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [103] $Ultimate##0-->L61: Formula: (and (= v_i_19 v_sum_23) (= v_i_19 v_mts1_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_mts2_19) (= v_i_19 v_j_19) (= v_M_14 v_k_24) (= v_i_19 v_mts3_19)) InVars {sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} OutVars{sum=v_sum_23, N=v_N_16, M=v_M_14, k=v_k_24, j=v_j_19, i=v_i_19, mts1=v_mts1_19, mts3=v_mts3_19, mts2=v_mts2_19} AuxVars[] AssignedVars[] 42#[L61]true [83] L61-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L61-1, L24-1]true [86] L61-1-->L35-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 79#[L62, L24-1, L35-1]true [89] L62-->L46-1: 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} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 113#[L46-1, L63, L24-1, L35-1]true [2023-10-12 17:40:39,127 INFO L750 eck$LassoCheckResult]: Loop: 113#[L46-1, L63, L24-1, L35-1]true [94] L46-1-->L46-1: Formula: (let ((.cse0 (select v_A_13 v_k_19))) (and (= v_sum_13 (+ v_sum_14 .cse0)) (= v_k_18 (+ v_k_19 1)) (< v_k_19 v_N_8) (= (let ((.cse1 (+ v_mts3_10 .cse0))) (ite (< .cse1 0) 0 .cse1)) v_mts3_9))) InVars {sum=v_sum_14, A=v_A_13, N=v_N_8, k=v_k_19, mts3=v_mts3_10} OutVars{sum=v_sum_13, A=v_A_13, N=v_N_8, k=v_k_18, mts3=v_mts3_9} AuxVars[] AssignedVars[sum, k, mts3] 113#[L46-1, L63, L24-1, L35-1]true [2023-10-12 17:40:39,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash 4074512, now seen corresponding path program 1 times [2023-10-12 17:40:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:39,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845341209] [2023-10-12 17:40:39,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:39,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:39,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:39,141 INFO L85 PathProgramCache]: Analyzing trace with hash 125, now seen corresponding path program 1 times [2023-10-12 17:40:39,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:39,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523627389] [2023-10-12 17:40:39,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:39,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:39,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash 126309966, now seen corresponding path program 1 times [2023-10-12 17:40:39,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:39,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075338195] [2023-10-12 17:40:39,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:39,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:39,287 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:39,288 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:39,288 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:39,288 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:39,288 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:39,288 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:39,288 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:39,288 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:39,288 INFO L133 ssoRankerPreferences]: Filename of dumped script: mts.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:40:39,288 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:39,288 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:39,290 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:39,293 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:39,328 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:39,331 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:39,333 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:39,335 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:39,338 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:39,340 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:39,342 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:39,344 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:39,347 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:39,505 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:39,506 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:39,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:39,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:39,507 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:39,518 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 [2023-10-12 17:40:39,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:39,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:39,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:39,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:39,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:40:39,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:39,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:39,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:39,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:39,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:39,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:39,554 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:39,561 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 [2023-10-12 17:40:39,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:40:39,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:39,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:39,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:39,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:39,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:39,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:39,588 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:39,597 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:40:39,597 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:40:39,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:39,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:39,602 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2023-10-12 17:40:39,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:40:39,606 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:39,624 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:39,624 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:39,624 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:40:39,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:40:39,632 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:39,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:39,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:39,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:39,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:39,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:39,665 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:40:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-10-12 17:40:39,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:40:39,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:39,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:39,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:40:39,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:39,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:40:39,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:39,732 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 960 transitions, 8832 flow [2023-10-12 17:40:39,732 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:40:39,732 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 960 transitions, 8832 flow [2023-10-12 17:40:39,764 INFO L124 PetriNetUnfolderBase]: 90/133 cut-off events. [2023-10-12 17:40:39,765 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:40:39,765 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:40:39,770 INFO L201 PluginConnector]: Adding new model mts.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:40:39 BoogieIcfgContainer [2023-10-12 17:40:39,770 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:40:39,771 INFO L158 Benchmark]: Toolchain (without parser) took 3501.36ms. Allocated memory was 182.5MB in the beginning and 268.4MB in the end (delta: 86.0MB). Free memory was 137.4MB in the beginning and 145.3MB in the end (delta: -7.8MB). Peak memory consumption was 79.3MB. Max. memory is 8.0GB. [2023-10-12 17:40:39,771 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.28ms. Allocated memory is still 182.5MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:40:39,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.87ms. Allocated memory is still 182.5MB. Free memory was 137.3MB in the beginning and 135.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:40:39,772 INFO L158 Benchmark]: Boogie Preprocessor took 27.57ms. Allocated memory is still 182.5MB. Free memory was 135.8MB in the beginning and 134.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:39,772 INFO L158 Benchmark]: RCFGBuilder took 258.51ms. Allocated memory is still 182.5MB. Free memory was 134.7MB in the beginning and 124.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:40:39,773 INFO L158 Benchmark]: BuchiAutomizer took 3186.22ms. Allocated memory was 182.5MB in the beginning and 268.4MB in the end (delta: 86.0MB). Free memory was 124.0MB in the beginning and 145.3MB in the end (delta: -21.3MB). Peak memory consumption was 65.6MB. Max. memory is 8.0GB. [2023-10-12 17:40:39,774 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.28ms. Allocated memory is still 182.5MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.87ms. Allocated memory is still 182.5MB. Free memory was 137.3MB in the beginning and 135.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.57ms. Allocated memory is still 182.5MB. Free memory was 135.8MB in the beginning and 134.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 258.51ms. Allocated memory is still 182.5MB. Free memory was 134.7MB in the beginning and 124.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 3186.22ms. Allocated memory was 182.5MB in the beginning and 268.4MB in the end (delta: 86.0MB). Free memory was 124.0MB in the beginning and 145.3MB in the end (delta: -21.3MB). Peak memory consumption was 65.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. 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: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 114 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital76 mio100 ax100 hnf100 lsp104 ukn58 mio100 lsp57 div100 bol100 ite100 ukn100 eq163 hnf98 smp100 dnf180 smp56 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 33 PlacesBefore, 22 PlacesAfterwards, 26 TransitionsBefore, 15 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 96 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 78, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 78, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 78, unknown conditional: 0, unknown unconditional: 78] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:40:39,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-10-12 17:40:39,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:40,191 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...