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.r180-tall-171640604100757.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 itstools
Input is HealthRecord-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604100757
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 20:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 68K May 18 16:42 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-08-UpperBounds-00
FORMULA_NAME HealthRecord-PT-08-UpperBounds-01
FORMULA_NAME HealthRecord-PT-08-UpperBounds-02
FORMULA_NAME HealthRecord-PT-08-UpperBounds-03
FORMULA_NAME HealthRecord-PT-08-UpperBounds-04
FORMULA_NAME HealthRecord-PT-08-UpperBounds-05
FORMULA_NAME HealthRecord-PT-08-UpperBounds-06
FORMULA_NAME HealthRecord-PT-08-UpperBounds-07
FORMULA_NAME HealthRecord-PT-08-UpperBounds-08
FORMULA_NAME HealthRecord-PT-08-UpperBounds-09
FORMULA_NAME HealthRecord-PT-08-UpperBounds-10
FORMULA_NAME HealthRecord-PT-08-UpperBounds-11
FORMULA_NAME HealthRecord-PT-08-UpperBounds-12
FORMULA_NAME HealthRecord-PT-08-UpperBounds-13
FORMULA_NAME HealthRecord-PT-08-UpperBounds-14
FORMULA_NAME HealthRecord-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716519998197

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 03:06:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:06:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:06:39] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-24 03:06:39] [INFO ] Transformed 156 places.
[2024-05-24 03:06:39] [INFO ] Transformed 326 transitions.
[2024-05-24 03:06:39] [INFO ] Found NUPN structural information;
[2024-05-24 03:06:39] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-24 03:06:39] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2024-05-24 03:06:39] [INFO ] Computed 18 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (553 resets) in 37 ms. (263 steps per ms)
FORMULA HealthRecord-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (516 resets) in 63 ms. (1093 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-24 03:06:39] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
[2024-05-24 03:06:39] [INFO ] Invariant cache hit.
[2024-05-24 03:06:39] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-24 03:06:39] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-24 03:06:39] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-24 03:06:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:06:40] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-24 03:06:40] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 8 ms to minimize.
[2024-05-24 03:06:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:06:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-24 03:06:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 03:06:40] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-24 03:06:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:06:40] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:06:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-24 03:06:40] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 26 ms.
[2024-05-24 03:06:40] [INFO ] Added : 17 causal constraints over 5 iterations in 139 ms. Result :sat
Minimization took 104 ms.
[2024-05-24 03:06:40] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:06:40] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:06:40] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-24 03:06:40] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:06:40] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:06:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:06:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 03:06:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 03:06:40] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-24 03:06:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:06:40] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:06:41] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 3 ms to minimize.
[2024-05-24 03:06:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2024-05-24 03:06:41] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 23 ms.
[2024-05-24 03:06:41] [INFO ] Added : 17 causal constraints over 4 iterations in 101 ms. Result :sat
Minimization took 93 ms.
[2024-05-24 03:06:41] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:06:41] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:06:41] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-24 03:06:41] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-24 03:06:41] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 18 ms.
[2024-05-24 03:06:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:06:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-24 03:06:41] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 03:06:41] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-24 03:06:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-24 03:06:41] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 20 ms.
[2024-05-24 03:06:41] [INFO ] Added : 29 causal constraints over 7 iterations in 111 ms. Result :sat
Minimization took 97 ms.
[2024-05-24 03:06:41] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:06:41] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 03:06:41] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-24 03:06:41] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:06:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:06:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:06:41] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:06:42] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 19 ms.
[2024-05-24 03:06:42] [INFO ] Added : 13 causal constraints over 3 iterations in 82 ms. Result :sat
Minimization took 91 ms.
[2024-05-24 03:06:42] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 03:06:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:06:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:06:42] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 20 ms.
[2024-05-24 03:06:42] [INFO ] Added : 22 causal constraints over 5 iterations in 96 ms. Result :sat
Minimization took 96 ms.
[2024-05-24 03:06:42] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:06:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:06:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-24 03:06:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:06:42] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 16 ms.
[2024-05-24 03:06:42] [INFO ] Added : 16 causal constraints over 4 iterations in 81 ms. Result :sat
Minimization took 95 ms.
[2024-05-24 03:06:43] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:06:43] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 03:06:43] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-24 03:06:43] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:06:43] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:06:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:06:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:06:43] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:06:43] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-24 03:06:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:06:43] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:06:43] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:06:43] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 2 ms to minimize.
[2024-05-24 03:06:43] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:06:43] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:06:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 272 ms
[2024-05-24 03:06:43] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 17 ms.
[2024-05-24 03:06:43] [INFO ] Added : 27 causal constraints over 6 iterations in 112 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 300/300 transitions.
Graph (trivial) has 227 edges and 156 vertex of which 10 / 156 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 652 edges and 151 vertex of which 141 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 141 transition count 272
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 19 place count 136 transition count 265
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 134 transition count 264
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 22 place count 134 transition count 261
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 129 transition count 261
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 103 place count 56 transition count 115
Iterating global reduction 3 with 73 rules applied. Total rules applied 176 place count 56 transition count 115
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 186 place count 46 transition count 95
Iterating global reduction 3 with 10 rules applied. Total rules applied 196 place count 46 transition count 95
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 203 place count 46 transition count 88
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 204 place count 45 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 205 place count 45 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 206 place count 44 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 44 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 210 place count 44 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 212 place count 43 transition count 79
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 222 place count 38 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 225 place count 38 transition count 116
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 237 place count 38 transition count 116
Applied a total of 237 rules in 109 ms. Remains 38 /156 variables (removed 118) and now considering 116/300 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 38/156 places, 116/300 transitions.
[2024-05-24 03:06:44] [INFO ] Flow matrix only has 109 transitions (discarded 7 similar events)
// Phase 1: matrix 109 rows 38 cols
[2024-05-24 03:06:44] [INFO ] Computed 6 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (161339 resets) in 1592 ms. (627 steps per ms)
FORMULA HealthRecord-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (23712 resets) in 365 ms. (2732 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:06:46] [INFO ] Flow matrix only has 109 transitions (discarded 7 similar events)
[2024-05-24 03:06:46] [INFO ] Invariant cache hit.
[2024-05-24 03:06:46] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 03:06:46] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 03:06:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 03:06:46] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-24 03:06:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:06:46] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-24 03:06:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-24 03:06:46] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:06:46] [INFO ] Computed and/alt/rep : 25/101/25 causal constraints (skipped 68 transitions) in 15 ms.
[2024-05-24 03:06:46] [INFO ] Added : 2 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 38 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p145) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 114/114 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 35 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 34 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 34 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 33 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 33 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 33 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 32 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 31 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 31 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 30 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 30 transition count 87
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 27 place count 30 transition count 82
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 30 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 31 place count 28 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 28 transition count 78
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 36 place count 28 transition count 125
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 40 place count 25 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 43 place count 25 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 44 place count 24 transition count 94
Iterating global reduction 5 with 1 rules applied. Total rules applied 45 place count 24 transition count 94
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 46 place count 23 transition count 91
Iterating global reduction 5 with 1 rules applied. Total rules applied 47 place count 23 transition count 91
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 57 place count 23 transition count 81
Applied a total of 57 rules in 39 ms. Remains 23 /38 variables (removed 15) and now considering 81/114 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 23/38 places, 81/114 transitions.
[2024-05-24 03:06:46] [INFO ] Flow matrix only has 69 transitions (discarded 12 similar events)
// Phase 1: matrix 69 rows 23 cols
[2024-05-24 03:06:46] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA HealthRecord-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (233981 resets) in 1346 ms. (742 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after 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 )
[2024-05-24 03:06:47] [INFO ] Flatten gal took : 40 ms
[2024-05-24 03:06:47] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:06:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9014476935539803281.gal : 7 ms
[2024-05-24 03:06:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14660251210204369162.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9014476935539803281.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14660251210204369162.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 8622 ms.

BK_STOP 1716520008031

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is HealthRecord-PT-08, 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 r180-tall-171640604100757"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-08.tgz
mv HealthRecord-PT-08 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;