About the Execution of LTSMin+red for HealthRecord-PT-17
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 610.584 | 52847.00 | 71398.00 | 567.70 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r201-smll-167840347700365.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is HealthRecord-PT-17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347700365
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 17:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 175K Mar 5 18:22 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 HealthRecord-PT-17-UpperBounds-00
FORMULA_NAME HealthRecord-PT-17-UpperBounds-01
FORMULA_NAME HealthRecord-PT-17-UpperBounds-02
FORMULA_NAME HealthRecord-PT-17-UpperBounds-03
FORMULA_NAME HealthRecord-PT-17-UpperBounds-04
FORMULA_NAME HealthRecord-PT-17-UpperBounds-05
FORMULA_NAME HealthRecord-PT-17-UpperBounds-06
FORMULA_NAME HealthRecord-PT-17-UpperBounds-07
FORMULA_NAME HealthRecord-PT-17-UpperBounds-08
FORMULA_NAME HealthRecord-PT-17-UpperBounds-09
FORMULA_NAME HealthRecord-PT-17-UpperBounds-10
FORMULA_NAME HealthRecord-PT-17-UpperBounds-11
FORMULA_NAME HealthRecord-PT-17-UpperBounds-12
FORMULA_NAME HealthRecord-PT-17-UpperBounds-13
FORMULA_NAME HealthRecord-PT-17-UpperBounds-14
FORMULA_NAME HealthRecord-PT-17-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678646240293
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:37:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 18:37:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:37:23] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-03-12 18:37:23] [INFO ] Transformed 624 places.
[2023-03-12 18:37:23] [INFO ] Transformed 828 transitions.
[2023-03-12 18:37:23] [INFO ] Found NUPN structural information;
[2023-03-12 18:37:23] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 828 rows 624 cols
[2023-03-12 18:37:23] [INFO ] Computed 18 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 86 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :5
FORMULA HealthRecord-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :0
[2023-03-12 18:37:23] [INFO ] Invariant cache hit.
[2023-03-12 18:37:23] [INFO ] [Real]Absence check using 10 positive place invariants in 28 ms returned sat
[2023-03-12 18:37:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-12 18:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:24] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2023-03-12 18:37:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:37:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 33 ms returned sat
[2023-03-12 18:37:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 23 ms returned sat
[2023-03-12 18:37:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:25] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2023-03-12 18:37:25] [INFO ] Deduced a trap composed of 108 places in 394 ms of which 5 ms to minimize.
[2023-03-12 18:37:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 513 ms
[2023-03-12 18:37:26] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 110 ms.
[2023-03-12 18:37:29] [INFO ] Added : 287 causal constraints over 58 iterations in 3416 ms. Result :sat
Minimization took 161 ms.
[2023-03-12 18:37:29] [INFO ] [Real]Absence check using 10 positive place invariants in 25 ms returned sat
[2023-03-12 18:37:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2023-03-12 18:37:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:30] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2023-03-12 18:37:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:37:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 25 ms returned sat
[2023-03-12 18:37:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-12 18:37:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:30] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-12 18:37:30] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 70 ms.
[2023-03-12 18:37:32] [INFO ] Added : 123 causal constraints over 25 iterations in 1362 ms. Result :sat
Minimization took 143 ms.
[2023-03-12 18:37:32] [INFO ] [Real]Absence check using 10 positive place invariants in 24 ms returned sat
[2023-03-12 18:37:32] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-12 18:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:32] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2023-03-12 18:37:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:37:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 32 ms returned sat
[2023-03-12 18:37:33] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-12 18:37:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:33] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2023-03-12 18:37:33] [INFO ] Deduced a trap composed of 132 places in 255 ms of which 2 ms to minimize.
[2023-03-12 18:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2023-03-12 18:37:33] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 74 ms.
[2023-03-12 18:37:35] [INFO ] Added : 108 causal constraints over 23 iterations in 1235 ms. Result :sat
Minimization took 114 ms.
[2023-03-12 18:37:35] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2023-03-12 18:37:35] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-12 18:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:35] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-12 18:37:35] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 74 ms.
[2023-03-12 18:37:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:37:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 25 ms returned sat
[2023-03-12 18:37:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-12 18:37:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:37] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-12 18:37:37] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 68 ms.
[2023-03-12 18:37:40] [INFO ] Added : 322 causal constraints over 65 iterations in 3418 ms. Result :sat
Minimization took 204 ms.
[2023-03-12 18:37:41] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2023-03-12 18:37:41] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-12 18:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:41] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2023-03-12 18:37:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:37:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-12 18:37:41] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-12 18:37:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:42] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2023-03-12 18:37:42] [INFO ] Deduced a trap composed of 116 places in 350 ms of which 2 ms to minimize.
[2023-03-12 18:37:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2023-03-12 18:37:42] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 48 ms.
[2023-03-12 18:37:45] [INFO ] Added : 270 causal constraints over 55 iterations in 2877 ms. Result :sat
Minimization took 164 ms.
[2023-03-12 18:37:45] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-12 18:37:45] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-12 18:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:46] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2023-03-12 18:37:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:37:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-12 18:37:46] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-12 18:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:46] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2023-03-12 18:37:46] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 60 ms.
[2023-03-12 18:37:48] [INFO ] Deduced a trap composed of 131 places in 187 ms of which 1 ms to minimize.
[2023-03-12 18:37:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-12 18:37:48] [INFO ] Added : 129 causal constraints over 27 iterations in 1760 ms. Result :sat
Minimization took 128 ms.
[2023-03-12 18:37:48] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2023-03-12 18:37:48] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-12 18:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:49] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2023-03-12 18:37:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:37:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-12 18:37:49] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-12 18:37:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:49] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2023-03-12 18:37:50] [INFO ] Deduced a trap composed of 120 places in 236 ms of which 1 ms to minimize.
[2023-03-12 18:37:50] [INFO ] Deduced a trap composed of 119 places in 280 ms of which 1 ms to minimize.
[2023-03-12 18:37:50] [INFO ] Deduced a trap composed of 180 places in 150 ms of which 0 ms to minimize.
[2023-03-12 18:37:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 794 ms
[2023-03-12 18:37:50] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 60 ms.
[2023-03-12 18:37:53] [INFO ] Added : 264 causal constraints over 54 iterations in 2792 ms. Result :sat
Minimization took 159 ms.
[2023-03-12 18:37:53] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-12 18:37:53] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-12 18:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:54] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-12 18:37:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:37:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 24 ms returned sat
[2023-03-12 18:37:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-12 18:37:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:54] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2023-03-12 18:37:54] [INFO ] Deduced a trap composed of 121 places in 284 ms of which 1 ms to minimize.
[2023-03-12 18:37:55] [INFO ] Deduced a trap composed of 133 places in 206 ms of which 1 ms to minimize.
[2023-03-12 18:37:55] [INFO ] Deduced a trap composed of 121 places in 242 ms of which 1 ms to minimize.
[2023-03-12 18:37:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 863 ms
[2023-03-12 18:37:55] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 56 ms.
[2023-03-12 18:37:56] [INFO ] Added : 121 causal constraints over 25 iterations in 1317 ms. Result :sat
Minimization took 138 ms.
[2023-03-12 18:37:57] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2023-03-12 18:37:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-12 18:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:57] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2023-03-12 18:37:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:37:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 24 ms returned sat
[2023-03-12 18:37:57] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-12 18:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:37:58] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2023-03-12 18:37:58] [INFO ] Deduced a trap composed of 132 places in 170 ms of which 1 ms to minimize.
[2023-03-12 18:37:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-12 18:37:58] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 55 ms.
[2023-03-12 18:37:59] [INFO ] Added : 124 causal constraints over 25 iterations in 1322 ms. Result :sat
Minimization took 127 ms.
[2023-03-12 18:37:59] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2023-03-12 18:37:59] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-12 18:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:00] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2023-03-12 18:38:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:38:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-12 18:38:00] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-12 18:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:00] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2023-03-12 18:38:01] [INFO ] Deduced a trap composed of 117 places in 320 ms of which 1 ms to minimize.
[2023-03-12 18:38:01] [INFO ] Deduced a trap composed of 93 places in 215 ms of which 1 ms to minimize.
[2023-03-12 18:38:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 633 ms
[2023-03-12 18:38:01] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 57 ms.
[2023-03-12 18:38:02] [INFO ] Added : 131 causal constraints over 27 iterations in 1384 ms. Result :sat
Minimization took 131 ms.
[2023-03-12 18:38:03] [INFO ] [Real]Absence check using 10 positive place invariants in 24 ms returned sat
[2023-03-12 18:38:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-12 18:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:03] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2023-03-12 18:38:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:38:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-12 18:38:03] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-12 18:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:04] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2023-03-12 18:38:04] [INFO ] Deduced a trap composed of 78 places in 294 ms of which 1 ms to minimize.
[2023-03-12 18:38:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2023-03-12 18:38:04] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 53 ms.
[2023-03-12 18:38:07] [INFO ] Added : 269 causal constraints over 54 iterations in 2758 ms. Result :sat
Minimization took 181 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 735 edges and 624 vertex of which 85 / 624 are part of one of the 20 SCC in 7 ms
Free SCC test removed 65 places
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Graph (complete) has 1202 edges and 559 vertex of which 543 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Discarding 16 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 293 transitions
Trivial Post-agglo rules discarded 293 transitions
Performed 293 trivial Post agglomeration. Transition count delta: 293
Iterating post reduction 0 with 293 rules applied. Total rules applied 295 place count 543 transition count 434
Reduce places removed 293 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 335 rules applied. Total rules applied 630 place count 250 transition count 392
Reduce places removed 14 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 18 rules applied. Total rules applied 648 place count 236 transition count 388
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 652 place count 232 transition count 388
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 652 place count 232 transition count 378
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 672 place count 222 transition count 378
Discarding 84 places :
Symmetric choice reduction at 4 with 84 rule applications. Total rules 756 place count 138 transition count 212
Iterating global reduction 4 with 84 rules applied. Total rules applied 840 place count 138 transition count 212
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 849 place count 129 transition count 195
Iterating global reduction 4 with 9 rules applied. Total rules applied 858 place count 129 transition count 195
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 870 place count 117 transition count 183
Iterating global reduction 4 with 12 rules applied. Total rules applied 882 place count 117 transition count 183
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 891 place count 117 transition count 174
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 961 place count 82 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 967 place count 82 transition count 133
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 968 place count 81 transition count 132
Iterating global reduction 6 with 1 rules applied. Total rules applied 969 place count 81 transition count 132
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 979 place count 76 transition count 166
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 984 place count 76 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 986 place count 75 transition count 172
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 987 place count 74 transition count 169
Iterating global reduction 6 with 1 rules applied. Total rules applied 988 place count 74 transition count 169
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 996 place count 74 transition count 161
Free-agglomeration rule applied 24 times.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1020 place count 74 transition count 137
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 1046 place count 50 transition count 135
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1050 place count 50 transition count 131
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 1061 place count 50 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1063 place count 50 transition count 129
Applied a total of 1063 rules in 193 ms. Remains 50 /624 variables (removed 574) and now considering 129/828 (removed 699) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 50/624 places, 129/828 transitions.
Normalized transition count is 116 out of 129 initially.
// Phase 1: matrix 116 rows 50 cols
[2023-03-12 18:38:08] [INFO ] Computed 9 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2689 resets, run finished after 535 ms. (steps per millisecond=1869 ) properties (out of 7) seen :1
FORMULA HealthRecord-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 404 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 6) seen :1
FORMULA HealthRecord-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 157 resets, run finished after 406 ms. (steps per millisecond=2463 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 719 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 210 resets, run finished after 410 ms. (steps per millisecond=2439 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 928 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 5) seen :0
[2023-03-12 18:38:10] [INFO ] Flow matrix only has 116 transitions (discarded 13 similar events)
// Phase 1: matrix 116 rows 50 cols
[2023-03-12 18:38:10] [INFO ] Computed 9 place invariants in 10 ms
[2023-03-12 18:38:10] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 18:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:10] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-12 18:38:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:38:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 18:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:10] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-12 18:38:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-12 18:38:10] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2023-03-12 18:38:11] [INFO ] Computed and/alt/rep : 29/112/29 causal constraints (skipped 79 transitions) in 11 ms.
[2023-03-12 18:38:11] [INFO ] Added : 8 causal constraints over 2 iterations in 41 ms. Result :sat
Minimization took 17 ms.
[2023-03-12 18:38:11] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 18:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:11] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-12 18:38:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:38:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 18:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:11] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-12 18:38:11] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2023-03-12 18:38:11] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2023-03-12 18:38:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-12 18:38:11] [INFO ] Computed and/alt/rep : 29/112/29 causal constraints (skipped 79 transitions) in 9 ms.
[2023-03-12 18:38:11] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
[2023-03-12 18:38:11] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2023-03-12 18:38:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2023-03-12 18:38:11] [INFO ] Added : 7 causal constraints over 2 iterations in 138 ms. Result :sat
Minimization took 17 ms.
[2023-03-12 18:38:11] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 18:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:11] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-12 18:38:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:38:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 18:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:11] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-12 18:38:11] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2023-03-12 18:38:11] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2023-03-12 18:38:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2023-03-12 18:38:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2023-03-12 18:38:11] [INFO ] Computed and/alt/rep : 29/112/29 causal constraints (skipped 79 transitions) in 8 ms.
[2023-03-12 18:38:11] [INFO ] Added : 10 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 20 ms.
[2023-03-12 18:38:11] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 18:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:11] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-12 18:38:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:38:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 18:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:11] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-12 18:38:11] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2023-03-12 18:38:11] [INFO ] Computed and/alt/rep : 29/112/29 causal constraints (skipped 79 transitions) in 9 ms.
[2023-03-12 18:38:11] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2023-03-12 18:38:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-12 18:38:11] [INFO ] Added : 10 causal constraints over 4 iterations in 102 ms. Result :sat
Minimization took 17 ms.
[2023-03-12 18:38:11] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 18:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:12] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-12 18:38:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:38:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 18:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:38:12] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-12 18:38:12] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2023-03-12 18:38:12] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2023-03-12 18:38:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-12 18:38:12] [INFO ] Computed and/alt/rep : 29/112/29 causal constraints (skipped 79 transitions) in 9 ms.
[2023-03-12 18:38:12] [INFO ] Added : 7 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 49434 ms.
ITS solved all properties within timeout
BK_STOP 1678646293140
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="HealthRecord-PT-17"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is HealthRecord-PT-17, 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 r201-smll-167840347700365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-17.tgz
mv HealthRecord-PT-17 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 ;