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-171640604200813.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-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604200813
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:30 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 73K 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-15-UpperBounds-00
FORMULA_NAME HealthRecord-PT-15-UpperBounds-01
FORMULA_NAME HealthRecord-PT-15-UpperBounds-02
FORMULA_NAME HealthRecord-PT-15-UpperBounds-03
FORMULA_NAME HealthRecord-PT-15-UpperBounds-04
FORMULA_NAME HealthRecord-PT-15-UpperBounds-05
FORMULA_NAME HealthRecord-PT-15-UpperBounds-06
FORMULA_NAME HealthRecord-PT-15-UpperBounds-07
FORMULA_NAME HealthRecord-PT-15-UpperBounds-08
FORMULA_NAME HealthRecord-PT-15-UpperBounds-09
FORMULA_NAME HealthRecord-PT-15-UpperBounds-10
FORMULA_NAME HealthRecord-PT-15-UpperBounds-11
FORMULA_NAME HealthRecord-PT-15-UpperBounds-12
FORMULA_NAME HealthRecord-PT-15-UpperBounds-13
FORMULA_NAME HealthRecord-PT-15-UpperBounds-14
FORMULA_NAME HealthRecord-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716521065102

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 03:24:26] [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:24:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:24:26] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-24 03:24:26] [INFO ] Transformed 163 places.
[2024-05-24 03:24:26] [INFO ] Transformed 348 transitions.
[2024-05-24 03:24:26] [INFO ] Found NUPN structural information;
[2024-05-24 03:24:26] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 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:24:26] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
// Phase 1: matrix 307 rows 163 cols
[2024-05-24 03:24:26] [INFO ] Computed 18 invariants in 23 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 (919 resets) in 40 ms. (243 steps per ms)
FORMULA HealthRecord-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (600 resets) in 42 ms. (1162 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-05-24 03:24:26] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
[2024-05-24 03:24:26] [INFO ] Invariant cache hit.
[2024-05-24 03:24:26] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-24 03:24:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 03:24:27] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-24 03:24:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:27] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-24 03:24:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:24:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 03:24:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 03:24:27] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-24 03:24:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:24:27] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 35 ms.
[2024-05-24 03:24:27] [INFO ] Added : 23 causal constraints over 6 iterations in 203 ms. Result :sat
Minimization took 151 ms.
[2024-05-24 03:24:27] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-24 03:24:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 03:24:27] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-24 03:24:27] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:24:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:24:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-24 03:24:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 03:24:27] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-24 03:24:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:24:27] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 33 ms.
[2024-05-24 03:24:27] [INFO ] Added : 13 causal constraints over 3 iterations in 101 ms. Result :sat
Minimization took 143 ms.
[2024-05-24 03:24:28] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:24:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2024-05-24 03:24:28] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-24 03:24:28] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:24:28] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 12 ms to minimize.
[2024-05-24 03:24:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:24:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 03:24:28] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:24:28] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-24 03:24:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:24:28] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-24 03:24:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-24 03:24:28] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 27 ms.
[2024-05-24 03:24:28] [INFO ] Added : 16 causal constraints over 4 iterations in 111 ms. Result :sat
Minimization took 153 ms.
[2024-05-24 03:24:28] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 03:24:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:24:29] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-24 03:24:29] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:24:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:24:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:24:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:24:29] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-24 03:24:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:24:29] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 19 ms.
[2024-05-24 03:24:29] [INFO ] Added : 25 causal constraints over 6 iterations in 124 ms. Result :sat
Minimization took 172 ms.
[2024-05-24 03:24:29] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:24:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:24:29] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-24 03:24:29] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:24:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:24:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:24:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:24:29] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-24 03:24:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:24:29] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 22 ms.
[2024-05-24 03:24:29] [INFO ] Added : 12 causal constraints over 3 iterations in 96 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 1] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 319/319 transitions.
Graph (trivial) has 242 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 697 edges and 161 vertex of which 152 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output 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 0 with 2 rules applied. Total rules applied 4 place count 152 transition count 300
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 150 transition count 298
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 93 place count 65 transition count 128
Iterating global reduction 2 with 85 rules applied. Total rules applied 178 place count 65 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 186 place count 57 transition count 112
Iterating global reduction 2 with 8 rules applied. Total rules applied 194 place count 57 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 200 place count 57 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 202 place count 55 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 204 place count 55 transition count 100
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 206 place count 53 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 53 transition count 96
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 214 place count 53 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 220 place count 50 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 221 place count 50 transition count 86
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 233 place count 44 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 234 place count 44 transition count 125
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 239 place count 44 transition count 120
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 244 place count 39 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 246 place count 39 transition count 118
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 247 place count 39 transition count 118
Applied a total of 247 rules in 77 ms. Remains 39 /163 variables (removed 124) and now considering 118/319 (removed 201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 39/163 places, 118/319 transitions.
[2024-05-24 03:24:30] [INFO ] Flow matrix only has 97 transitions (discarded 21 similar events)
// Phase 1: matrix 97 rows 39 cols
[2024-05-24 03:24:30] [INFO ] Computed 9 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 1] Max Struct:[1, 1, 1, 1]
FORMULA HealthRecord-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (223654 resets) in 1442 ms. (693 steps per ms)
FORMULA HealthRecord-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (31110 resets) in 397 ms. (2512 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:24:32] [INFO ] Flow matrix only has 97 transitions (discarded 21 similar events)
[2024-05-24 03:24:32] [INFO ] Invariant cache hit.
[2024-05-24 03:24:32] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 03:24:32] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-24 03:24:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 03:24:32] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-24 03:24:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:24:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 03:24:32] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-24 03:24:32] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-24 03:24:32] [INFO ] Computed and/alt/rep : 44/163/44 causal constraints (skipped 37 transitions) in 8 ms.
[2024-05-24 03:24:32] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 18 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 39 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p142) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 116/116 transitions.
Graph (trivial) has 21 edges and 39 vertex of which 2 / 39 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 168 edges and 38 vertex of which 28 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 28 transition count 96
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 23 transition count 76
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 23 transition count 76
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 40 place count 23 transition count 65
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 21 transition count 60
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 21 transition count 60
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 49 place count 21 transition count 55
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 20 transition count 54
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 20 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 20 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 19 transition count 50
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 66 place count 19 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 72 place count 19 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 18 transition count 43
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 76 place count 15 transition count 43
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 82 place count 15 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 88 place count 12 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 92 place count 12 transition count 30
Graph (complete) has 25 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 93 place count 11 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 94 place count 11 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 95 place count 11 transition count 28
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 97 place count 10 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 99 place count 10 transition count 25
Applied a total of 99 rules in 18 ms. Remains 10 /39 variables (removed 29) and now considering 25/116 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 10/39 places, 25/116 transitions.
[2024-05-24 03:24:32] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 10 cols
[2024-05-24 03:24:32] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA HealthRecord-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 471 ms. (2118 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:24:32] [INFO ] Flatten gal took : 22 ms
[2024-05-24 03:24:32] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:24:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7620974923381651397.gal : 4 ms
[2024-05-24 03:24:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17183170917794307768.prop : 0 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/ReachabilityCardinality7620974923381651397.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17183170917794307768.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 6698 ms.

BK_STOP 1716521073029

--------------------
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-15"
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-15, 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-171640604200813"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-15.tgz
mv HealthRecord-PT-15 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 ;