About the Execution of LTSMin+red for PermAdmissibility-COL-50
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407000149.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PermAdmissibility-COL-50, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407000149
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.2K Apr 12 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 12 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-00
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-01
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-02
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-03
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-04
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-05
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-06
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-07
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-08
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-09
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-10
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-11
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-12
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-13
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-14
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717252256393
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:30:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 14:30:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:30:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 14:30:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:30:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 922 ms
[2024-06-01 14:30:59] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
[2024-06-01 14:30:59] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2024-06-01 14:30:59] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 16 rows 40 cols
[2024-06-01 14:30:59] [INFO ] Computed 24 invariants in 10 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 14:30:59] [INFO ] Invariant cache hit.
[2024-06-01 14:30:59] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 21 ms returned sat
[2024-06-01 14:30:59] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 14:30:59] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 14:30:59] [INFO ] Added : 10 causal constraints over 2 iterations in 46 ms. Result :sat
Minimization took 22 ms.
[2024-06-01 14:30:59] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2024-06-01 14:30:59] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 14:30:59] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 14:30:59] [INFO ] Added : 11 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 14:30:59] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 16 ms returned sat
[2024-06-01 14:31:00] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 14:31:00] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 14:31:00] [INFO ] Added : 10 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 14:31:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:31:00] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2024-06-01 14:31:00] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 14:31:00] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 14:31:00] [INFO ] Added : 10 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 14:31:00] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 14:31:00] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 14:31:00] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 14:31:00] [INFO ] Added : 10 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 13 ms.
[2024-06-01 14:31:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:31:00] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2024-06-01 14:31:00] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 14:31:00] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 14:31:00] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 14:31:00] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned unsat
[2024-06-01 14:31:00] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2024-06-01 14:31:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 14:31:00] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:31:00] [INFO ] Added : 15 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 14:31:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:31:00] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2024-06-01 14:31:00] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 14:31:00] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:31:00] [INFO ] Added : 15 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 14:31:00] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned sat
[2024-06-01 14:31:00] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 14:31:00] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 14:31:00] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 13 ms.
[2024-06-01 14:31:00] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2024-06-01 14:31:00] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 14:31:00] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:31:00] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 14:31:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:31:00] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2024-06-01 14:31:00] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 14:31:00] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:31:00] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 14:31:00] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2024-06-01 14:31:00] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 14:31:00] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 14:31:00] [INFO ] Added : 10 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 13 ms.
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 14:31:01] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 14:31:01] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 14:31:01] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 14:31:01] [INFO ] Added : 10 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 14:31:01] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:31:01] [INFO ] Added : 12 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned sat
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 14:31:01] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 14:31:01] [INFO ] Added : 10 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 14:31:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:31:01] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2024-06-01 14:31:01] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 14:31:01] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 14:31:01] [INFO ] Added : 10 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 14:31:01] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 14:31:01] [INFO ] Added : 15 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 14:31:01] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 14:31:01] [INFO ] Added : 12 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned sat
[2024-06-01 14:31:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 14:31:01] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 14:31:01] [INFO ] Added : 13 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 100, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
FORMULA PermAdmissibility-COL-50-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2024-06-01 14:31:01] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 14 ms.
[2024-06-01 14:31:01] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 14:31:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10008 steps (12 resets) in 14 ms. (667 steps per ms)
BEST_FIRST walk for 150015 steps (33 resets) in 202 ms. (738 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[50, 50, 100, 100, 50, 50, 100, 50, 50, 50, 50, 100, 50, 50, 50] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 14:31:01] [INFO ] Invariant cache hit.
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 3 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 3 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned unsat
[2024-06-01 14:31:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[50, 50, 100, 100, 50, 50, 100, 50, 50, 50, 50, 100, 50, 50, 50] Max Struct:[50, 50, 100, 100, 50, 50, 100, 50, 50, 50, 50, 100, 50, 50, 50]
FORMULA PermAdmissibility-COL-50-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-12 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 4368 ms.
ITS solved all properties within timeout
BK_STOP 1717252262529
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-COL-50"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PermAdmissibility-COL-50, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407000149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-50.tgz
mv PermAdmissibility-COL-50 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;