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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 8.2K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:22 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 125K 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-16-UpperBounds-00
FORMULA_NAME HealthRecord-PT-16-UpperBounds-01
FORMULA_NAME HealthRecord-PT-16-UpperBounds-02
FORMULA_NAME HealthRecord-PT-16-UpperBounds-03
FORMULA_NAME HealthRecord-PT-16-UpperBounds-04
FORMULA_NAME HealthRecord-PT-16-UpperBounds-05
FORMULA_NAME HealthRecord-PT-16-UpperBounds-06
FORMULA_NAME HealthRecord-PT-16-UpperBounds-07
FORMULA_NAME HealthRecord-PT-16-UpperBounds-08
FORMULA_NAME HealthRecord-PT-16-UpperBounds-09
FORMULA_NAME HealthRecord-PT-16-UpperBounds-10
FORMULA_NAME HealthRecord-PT-16-UpperBounds-11
FORMULA_NAME HealthRecord-PT-16-UpperBounds-12
FORMULA_NAME HealthRecord-PT-16-UpperBounds-13
FORMULA_NAME HealthRecord-PT-16-UpperBounds-14
FORMULA_NAME HealthRecord-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716521204153

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 03:26:45] [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:26:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:26:45] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-24 03:26:45] [INFO ] Transformed 453 places.
[2024-05-24 03:26:45] [INFO ] Transformed 594 transitions.
[2024-05-24 03:26:45] [INFO ] Found NUPN structural information;
[2024-05-24 03:26:45] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
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]
// Phase 1: matrix 594 rows 453 cols
[2024-05-24 03:26:45] [INFO ] Computed 14 invariants in 28 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 (95 resets) in 34 ms. (285 steps per ms)
FORMULA HealthRecord-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (153 resets) in 75 ms. (1184 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-24 03:26:45] [INFO ] Invariant cache hit.
[2024-05-24 03:26:45] [INFO ] [Real]Absence check using 8 positive place invariants in 22 ms returned sat
[2024-05-24 03:26:45] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2024-05-24 03:26:46] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-24 03:26:46] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 45 ms.
[2024-05-24 03:26:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:26:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-05-24 03:26:46] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 03:26:46] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-24 03:26:47] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 33 ms.
[2024-05-24 03:26:47] [INFO ] Added : 56 causal constraints over 12 iterations in 463 ms. Result :sat
Minimization took 502 ms.
[2024-05-24 03:26:48] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-05-24 03:26:48] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 12 ms returned sat
[2024-05-24 03:26:48] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-24 03:26:48] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 37 ms.
[2024-05-24 03:26:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:26:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-05-24 03:26:48] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 11 ms returned sat
[2024-05-24 03:26:48] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-24 03:26:48] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 30 ms.
[2024-05-24 03:26:49] [INFO ] Added : 51 causal constraints over 11 iterations in 405 ms. Result :sat
Minimization took 440 ms.
[2024-05-24 03:26:49] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-05-24 03:26:49] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2024-05-24 03:26:50] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-24 03:26:50] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 21 ms to minimize.
[2024-05-24 03:26:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:26:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-05-24 03:26:50] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 03:26:50] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-24 03:26:50] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:26:50] [INFO ] Deduced a trap composed of 137 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:26:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2024-05-24 03:26:50] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 39 ms.
[2024-05-24 03:26:51] [INFO ] Added : 94 causal constraints over 19 iterations in 649 ms. Result :sat
Minimization took 458 ms.
[2024-05-24 03:26:52] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-05-24 03:26:52] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2024-05-24 03:26:52] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-24 03:26:52] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 3 ms to minimize.
[2024-05-24 03:26:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:26:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2024-05-24 03:26:52] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 03:26:52] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-24 03:26:52] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 2 ms to minimize.
[2024-05-24 03:26:52] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 3 ms to minimize.
[2024-05-24 03:26:53] [INFO ] Deduced a trap composed of 97 places in 187 ms of which 2 ms to minimize.
[2024-05-24 03:26:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 501 ms
[2024-05-24 03:26:53] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 61 ms.
[2024-05-24 03:26:53] [INFO ] Added : 89 causal constraints over 18 iterations in 601 ms. Result :sat
Minimization took 451 ms.
[2024-05-24 03:26:54] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-05-24 03:26:54] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2024-05-24 03:26:54] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-24 03:26:54] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 31 ms.
[2024-05-24 03:26:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:26:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-05-24 03:26:54] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2024-05-24 03:26:55] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-24 03:26:55] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 36 ms.
[2024-05-24 03:26:56] [INFO ] Added : 238 causal constraints over 48 iterations in 1563 ms. Result :sat
Minimization took 468 ms.
[2024-05-24 03:26:57] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-24 03:26:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 03:26:57] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-24 03:26:57] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 32 ms.
[2024-05-24 03:26:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:26:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-05-24 03:26:57] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 03:26:57] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-24 03:26:57] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 37 ms.
[2024-05-24 03:26:59] [INFO ] Added : 233 causal constraints over 47 iterations in 1576 ms. Result :sat
Minimization took 461 ms.
[2024-05-24 03:27:00] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-05-24 03:27:00] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 13 ms returned sat
[2024-05-24 03:27:00] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-24 03:27:00] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 36 ms.
[2024-05-24 03:27:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:27:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-05-24 03:27:00] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 03:27:00] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-05-24 03:27:00] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 32 ms.
[2024-05-24 03:27:02] [INFO ] Added : 199 causal constraints over 40 iterations in 1311 ms. Result :sat
Minimization took 470 ms.
[2024-05-24 03:27:02] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-05-24 03:27:02] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2024-05-24 03:27:02] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-24 03:27:02] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 3 ms to minimize.
[2024-05-24 03:27:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:27:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-05-24 03:27:03] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 03:27:03] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-24 03:27:03] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-24 03:27:03] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 2 ms to minimize.
[2024-05-24 03:27:03] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:27:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 431 ms
[2024-05-24 03:27:03] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 28 ms.
[2024-05-24 03:27:04] [INFO ] Added : 91 causal constraints over 19 iterations in 595 ms. Result :sat
Minimization took 450 ms.
[2024-05-24 03:27:04] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-05-24 03:27:04] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2024-05-24 03:27:04] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-24 03:27:04] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 30 ms.
[2024-05-24 03:27:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:27:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-24 03:27:05] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 03:27:05] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-24 03:27:05] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 38 ms.
[2024-05-24 03:27:06] [INFO ] Added : 233 causal constraints over 47 iterations in 1533 ms. Result :sat
Minimization took 459 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 528 edges and 453 vertex of which 49 / 453 are part of one of the 17 SCC in 5 ms
Free SCC test removed 32 places
Drop transitions (Empty/Sink Transition effects.) removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 820 edges and 421 vertex of which 380 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Discarding 41 places :
Also discarding 28 output transitions
Drop transitions (Output transitions of discarded places.) removed 28 transitions
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 314 rules applied. Total rules applied 316 place count 380 transition count 200
Reduce places removed 219 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 246 rules applied. Total rules applied 562 place count 161 transition count 173
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 575 place count 149 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 576 place count 148 transition count 172
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 576 place count 148 transition count 159
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 602 place count 135 transition count 159
Discarding 57 places :
Symmetric choice reduction at 4 with 57 rule applications. Total rules 659 place count 78 transition count 102
Iterating global reduction 4 with 57 rules applied. Total rules applied 716 place count 78 transition count 102
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 716 place count 78 transition count 96
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 728 place count 72 transition count 96
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 738 place count 62 transition count 86
Iterating global reduction 4 with 10 rules applied. Total rules applied 748 place count 62 transition count 86
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 754 place count 56 transition count 80
Iterating global reduction 4 with 6 rules applied. Total rules applied 760 place count 56 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 763 place count 56 transition count 77
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 769 place count 50 transition count 70
Iterating global reduction 5 with 6 rules applied. Total rules applied 775 place count 50 transition count 70
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 780 place count 50 transition count 65
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 781 place count 49 transition count 64
Iterating global reduction 6 with 1 rules applied. Total rules applied 782 place count 49 transition count 64
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 804 place count 38 transition count 53
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 812 place count 34 transition count 68
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 817 place count 34 transition count 63
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 822 place count 29 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 823 place count 29 transition count 62
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 824 place count 29 transition count 62
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 825 place count 29 transition count 62
Applied a total of 825 rules in 85 ms. Remains 29 /453 variables (removed 424) and now considering 62/594 (removed 532) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 29/453 places, 62/594 transitions.
[2024-05-24 03:27:07] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 29 cols
[2024-05-24 03:27:07] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (92928 resets) in 1153 ms. (866 steps per ms)
FORMULA HealthRecord-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (20923 resets) in 376 ms. (2652 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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:27:09] [INFO ] Flatten gal took : 27 ms
[2024-05-24 03:27:09] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:27:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3039420590705811151.gal : 6 ms
[2024-05-24 03:27:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8078408035786242786.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/ReachabilityCardinality3039420590705811151.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8078408035786242786.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 24283 ms.

BK_STOP 1716521229610

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

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