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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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 25K 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 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 20:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:15 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 67K 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-07-UpperBounds-00
FORMULA_NAME HealthRecord-PT-07-UpperBounds-01
FORMULA_NAME HealthRecord-PT-07-UpperBounds-02
FORMULA_NAME HealthRecord-PT-07-UpperBounds-03
FORMULA_NAME HealthRecord-PT-07-UpperBounds-04
FORMULA_NAME HealthRecord-PT-07-UpperBounds-05
FORMULA_NAME HealthRecord-PT-07-UpperBounds-06
FORMULA_NAME HealthRecord-PT-07-UpperBounds-07
FORMULA_NAME HealthRecord-PT-07-UpperBounds-08
FORMULA_NAME HealthRecord-PT-07-UpperBounds-09
FORMULA_NAME HealthRecord-PT-07-UpperBounds-10
FORMULA_NAME HealthRecord-PT-07-UpperBounds-11
FORMULA_NAME HealthRecord-PT-07-UpperBounds-12
FORMULA_NAME HealthRecord-PT-07-UpperBounds-13
FORMULA_NAME HealthRecord-PT-07-UpperBounds-14
FORMULA_NAME HealthRecord-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716519809184

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 03:03:30] [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:03:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:03:30] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-24 03:03:30] [INFO ] Transformed 155 places.
[2024-05-24 03:03:30] [INFO ] Transformed 320 transitions.
[2024-05-24 03:03:30] [INFO ] Found NUPN structural information;
[2024-05-24 03:03:30] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 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:03:30] [INFO ] Flow matrix only has 283 transitions (discarded 12 similar events)
// Phase 1: matrix 283 rows 155 cols
[2024-05-24 03:03:30] [INFO ] Computed 18 invariants in 26 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 (532 resets) in 38 ms. (256 steps per ms)
FORMULA HealthRecord-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (474 resets) in 53 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-05-24 03:03:30] [INFO ] Flow matrix only has 283 transitions (discarded 12 similar events)
[2024-05-24 03:03:30] [INFO ] Invariant cache hit.
[2024-05-24 03:03:30] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-24 03:03:30] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2024-05-24 03:03:30] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-24 03:03:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:03:30] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:03:31] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 7 ms to minimize.
[2024-05-24 03:03:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 03:03:31] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:03:31] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-24 03:03:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:03:31] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 2 ms to minimize.
[2024-05-24 03:03:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-24 03:03:31] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 37 ms.
[2024-05-24 03:03:31] [INFO ] Added : 23 causal constraints over 6 iterations in 176 ms. Result :sat
Minimization took 121 ms.
[2024-05-24 03:03:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:03:31] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:03:31] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-24 03:03:31] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:03:31] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:03:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:03:31] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 03:03:31] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-24 03:03:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:03:31] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:03:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-24 03:03:31] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 18 ms.
[2024-05-24 03:03:32] [INFO ] Added : 13 causal constraints over 3 iterations in 70 ms. Result :sat
Minimization took 114 ms.
[2024-05-24 03:03:32] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:03:32] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:03:32] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-24 03:03:32] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:03:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:03:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:03:32] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-24 03:03:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:03:32] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 24 ms.
[2024-05-24 03:03:32] [INFO ] Added : 29 causal constraints over 7 iterations in 131 ms. Result :sat
Minimization took 103 ms.
[2024-05-24 03:03:32] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:03:32] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:03:32] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-24 03:03:32] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-24 03:03:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:03:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 03:03:32] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-24 03:03:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:03:32] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 23 ms.
[2024-05-24 03:03:32] [INFO ] Added : 17 causal constraints over 4 iterations in 94 ms. Result :sat
Minimization took 118 ms.
[2024-05-24 03:03:33] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:03:33] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 03:03:33] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-24 03:03:33] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:03:33] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 16 ms.
[2024-05-24 03:03:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:03:33] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-24 03:03:33] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-24 03:03:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:03:33] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 20 ms.
[2024-05-24 03:03:33] [INFO ] Added : 35 causal constraints over 8 iterations in 144 ms. Result :sat
Minimization took 112 ms.
[2024-05-24 03:03:33] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:03:33] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 03:03:33] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-24 03:03:33] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:03:33] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:03:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:03:33] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:03:33] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-24 03:03:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:03:34] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:03:34] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:03:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2024-05-24 03:03:34] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 15 ms.
[2024-05-24 03:03:34] [INFO ] Added : 21 causal constraints over 5 iterations in 91 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 295/295 transitions.
Graph (trivial) has 228 edges and 155 vertex of which 12 / 155 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 641 edges and 149 vertex of which 140 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 140 transition count 264
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 134 transition count 258
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 20 place count 134 transition count 254
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 31 place count 127 transition count 254
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 104 place count 54 transition count 109
Iterating global reduction 2 with 73 rules applied. Total rules applied 177 place count 54 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 54 transition count 108
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 187 place count 45 transition count 90
Iterating global reduction 3 with 9 rules applied. Total rules applied 196 place count 45 transition count 90
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 205 place count 45 transition count 81
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 207 place count 43 transition count 75
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 43 transition count 75
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 211 place count 41 transition count 71
Iterating global reduction 4 with 2 rules applied. Total rules applied 213 place count 41 transition count 71
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 219 place count 41 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 223 place count 39 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
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 233 place count 34 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 34 transition count 92
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 245 place count 34 transition count 92
Applied a total of 245 rules in 59 ms. Remains 34 /155 variables (removed 121) and now considering 92/295 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 34/155 places, 92/295 transitions.
[2024-05-24 03:03:34] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
// Phase 1: matrix 88 rows 34 cols
[2024-05-24 03:03:34] [INFO ] Computed 6 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (315126 resets) in 1235 ms. (809 steps per ms)
FORMULA HealthRecord-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (110968 resets) in 663 ms. (3012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-24 03:03:36] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2024-05-24 03:03:36] [INFO ] Invariant cache hit.
[2024-05-24 03:03:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 03:03:36] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 03:03:36] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-24 03:03:36] [INFO ] [Real]Added 23 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:03:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 03:03:36] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-24 03:03:36] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:03:36] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:03:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-24 03:03:36] [INFO ] Computed and/alt/rep : 36/212/36 causal constraints (skipped 44 transitions) in 7 ms.
[2024-05-24 03:03:36] [INFO ] Added : 8 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 25 ms.
[2024-05-24 03:03:36] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 03:03:36] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-24 03:03:36] [INFO ] [Real]Added 23 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:03:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 03:03:36] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-24 03:03:36] [INFO ] [Nat]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-05-24 03:03:36] [INFO ] Computed and/alt/rep : 36/212/36 causal constraints (skipped 44 transitions) in 8 ms.
[2024-05-24 03:03:36] [INFO ] Added : 12 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 92/92 transitions.
Graph (complete) has 163 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 32 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 32 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 31 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 31 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 30 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 30 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 30 transition count 76
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 30 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 28 transition count 74
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 28 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 27 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 27 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 27 transition count 67
Applied a total of 24 rules in 17 ms. Remains 27 /34 variables (removed 7) and now considering 67/92 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 27/34 places, 67/92 transitions.
[2024-05-24 03:03:36] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
// Phase 1: matrix 62 rows 27 cols
[2024-05-24 03:03:36] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (327015 resets) in 950 ms. (1051 steps per ms)
FORMULA HealthRecord-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (57647 resets) in 289 ms. (3448 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:03:38] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
[2024-05-24 03:03:38] [INFO ] Invariant cache hit.
[2024-05-24 03:03:38] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-24 03:03:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 03:03:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 03:03:38] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:03:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:38] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-24 03:03:38] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-24 03:03:38] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:03:38] [INFO ] Computed and/alt/rep : 23/119/23 causal constraints (skipped 31 transitions) in 4 ms.
[2024-05-24 03:03:38] [INFO ] Added : 5 causal constraints over 2 iterations in 24 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:[0] Max Struct:[1]
Support contains 1 out of 27 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p144) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 25 transition count 68
Applied a total of 3 rules in 6 ms. Remains 25 /27 variables (removed 2) and now considering 68/65 (removed -3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 25/27 places, 68/65 transitions.
[2024-05-24 03:03:38] [INFO ] Flow matrix only has 63 transitions (discarded 5 similar events)
// Phase 1: matrix 63 rows 25 cols
[2024-05-24 03:03:38] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (326818 resets) in 937 ms. (1066 steps per ms)
BEST_FIRST walk for 1000001 steps (57754 resets) in 286 ms. (3484 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:03:39] [INFO ] Flow matrix only has 63 transitions (discarded 5 similar events)
[2024-05-24 03:03:39] [INFO ] Invariant cache hit.
[2024-05-24 03:03:39] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-24 03:03:39] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 03:03:39] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-24 03:03:39] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2024-05-24 03:03:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:39] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-24 03:03:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 03:03:39] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:03:39] [INFO ] Computed and/alt/rep : 24/124/24 causal constraints (skipped 31 transitions) in 5 ms.
[2024-05-24 03:03:39] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 15 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:[0] Max Struct:[1]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 68/68 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 25/25 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 68/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-24 03:03:39] [INFO ] Flow matrix only has 63 transitions (discarded 5 similar events)
[2024-05-24 03:03:39] [INFO ] Invariant cache hit.
[2024-05-24 03:03:39] [INFO ] Implicit Places using invariants in 54 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/25 places, 68/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62 ms. Remains : 24/25 places, 68/68 transitions.
[2024-05-24 03:03:39] [INFO ] Flow matrix only has 63 transitions (discarded 5 similar events)
// Phase 1: matrix 63 rows 24 cols
[2024-05-24 03:03:39] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (326481 resets) in 851 ms. (1173 steps per ms)
BEST_FIRST walk for 1000001 steps (57700 resets) in 262 ms. (3802 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:03:40] [INFO ] Flow matrix only has 63 transitions (discarded 5 similar events)
[2024-05-24 03:03:40] [INFO ] Invariant cache hit.
[2024-05-24 03:03:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 03:03:40] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 03:03:40] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-24 03:03:40] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2024-05-24 03:03:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:40] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 03:03:40] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 03:03:40] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:03:40] [INFO ] Computed and/alt/rep : 24/124/24 causal constraints (skipped 31 transitions) in 5 ms.
[2024-05-24 03:03:40] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 17 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:[0] Max Struct:[1]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 24/24 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 68/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-24 03:03:40] [INFO ] Flow matrix only has 63 transitions (discarded 5 similar events)
[2024-05-24 03:03:40] [INFO ] Invariant cache hit.
[2024-05-24 03:03:40] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:03:40] [INFO ] Flow matrix only has 63 transitions (discarded 5 similar events)
[2024-05-24 03:03:40] [INFO ] Invariant cache hit.
[2024-05-24 03:03:40] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-24 03:03:40] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-24 03:03:40] [INFO ] Redundant transitions in 11 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-24 03:03:40] [INFO ] Flow matrix only has 63 transitions (discarded 5 similar events)
[2024-05-24 03:03:40] [INFO ] Invariant cache hit.
[2024-05-24 03:03:40] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Problem TDEAD55 is UNSAT
At refinement iteration 3 (OVERLAPS) 63/87 variables, 24/28 constraints. Problems are: Problem set: 1 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 26/54 constraints. Problems are: Problem set: 1 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 54 constraints, problems are : Problem set: 1 solved, 59 unsolved in 651 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 63/87 variables, 24/28 constraints. Problems are: Problem set: 1 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 26/54 constraints. Problems are: Problem set: 1 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 59/113 constraints. Problems are: Problem set: 1 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 113 constraints, problems are : Problem set: 1 solved, 59 unsolved in 871 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 59/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 1597ms problems are : Problem set: 1 solved, 59 unsolved
Search for dead transitions found 1 dead transitions in 1605ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/24 places, 67/68 transitions.
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 24 transition count 67
Applied a total of 9 rules in 11 ms. Remains 24 /24 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2024-05-24 03:03:42] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
// Phase 1: matrix 62 rows 24 cols
[2024-05-24 03:03:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-24 03:03:42] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:03:42] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
[2024-05-24 03:03:42] [INFO ] Invariant cache hit.
[2024-05-24 03:03:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 03:03:42] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 24/24 places, 67/68 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1821 ms. Remains : 24/24 places, 67/68 transitions.
[2024-05-24 03:03:42] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
[2024-05-24 03:03:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (326475 resets) in 877 ms. (1138 steps per ms)
BEST_FIRST walk for 1000000 steps (57654 resets) in 256 ms. (3891 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:03:43] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
[2024-05-24 03:03:43] [INFO ] Invariant cache hit.
[2024-05-24 03:03:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 03:03:43] [INFO ] [Real]Absence check using 1 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 03:03:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 03:03:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 03:03:43] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:03:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 03:03:43] [INFO ] [Nat]Absence check using 1 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 03:03:43] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 03:03:43] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:03:43] [INFO ] Computed and/alt/rep : 24/124/24 causal constraints (skipped 30 transitions) in 5 ms.
[2024-05-24 03:03:43] [INFO ] Added : 3 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 16 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:[0] Max Struct:[1]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 24/24 places, 67/67 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 67/67 transitions.
Applied a total of 0 rules in 5 ms. Remains 24 /24 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2024-05-24 03:03:43] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
[2024-05-24 03:03:43] [INFO ] Invariant cache hit.
[2024-05-24 03:03:43] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:03:43] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
[2024-05-24 03:03:43] [INFO ] Invariant cache hit.
[2024-05-24 03:03:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 03:03:44] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-24 03:03:44] [INFO ] Redundant transitions in 12 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-24 03:03:44] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
[2024-05-24 03:03:44] [INFO ] Invariant cache hit.
[2024-05-24 03:03:44] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
At refinement iteration 4 (OVERLAPS) 62/86 variables, 24/29 constraints. Problems are: Problem set: 9 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 25/54 constraints. Problems are: Problem set: 9 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/54 constraints. Problems are: Problem set: 9 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/54 constraints. Problems are: Problem set: 9 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 54 constraints, problems are : Problem set: 9 solved, 50 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 4/5 constraints. Problems are: Problem set: 9 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 9 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 62/86 variables, 24/29 constraints. Problems are: Problem set: 9 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 25/54 constraints. Problems are: Problem set: 9 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 50/104 constraints. Problems are: Problem set: 9 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/104 constraints. Problems are: Problem set: 9 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/86 variables, 0/104 constraints. Problems are: Problem set: 9 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 104 constraints, problems are : Problem set: 9 solved, 50 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 50/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 1275ms problems are : Problem set: 9 solved, 50 unsolved
Search for dead transitions found 9 dead transitions in 1277ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/24 places, 58/67 transitions.
Graph (complete) has 85 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 23 transition count 58
Applied a total of 2 rules in 13 ms. Remains 23 /24 variables (removed 1) and now considering 58/58 (removed 0) transitions.
[2024-05-24 03:03:45] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
// Phase 1: matrix 53 rows 23 cols
[2024-05-24 03:03:45] [INFO ] Computed 5 invariants in 1 ms
[2024-05-24 03:03:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:03:45] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-05-24 03:03:45] [INFO ] Invariant cache hit.
[2024-05-24 03:03:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 03:03:45] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 23/24 places, 58/67 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1478 ms. Remains : 23/24 places, 58/67 transitions.
[2024-05-24 03:03:45] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-05-24 03:03:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (298852 resets) in 996 ms. (1003 steps per ms)
BEST_FIRST walk for 1000001 steps (54051 resets) in 255 ms. (3906 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:03:46] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-05-24 03:03:46] [INFO ] Invariant cache hit.
[2024-05-24 03:03:46] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-24 03:03:46] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 03:03:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 03:03:46] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-05-24 03:03:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 03:03:46] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-24 03:03:46] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:03:46] [INFO ] Computed and/alt/rep : 24/124/24 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-24 03:03:46] [INFO ] Added : 3 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 10 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:[0] Max Struct:[1]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 23/23 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-24 03:03:46] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-05-24 03:03:46] [INFO ] Invariant cache hit.
[2024-05-24 03:03:46] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:03:46] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-05-24 03:03:46] [INFO ] Invariant cache hit.
[2024-05-24 03:03:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 03:03:46] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-24 03:03:46] [INFO ] Redundant transitions in 15 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-24 03:03:46] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-05-24 03:03:46] [INFO ] Invariant cache hit.
[2024-05-24 03:03:46] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem TDEAD57 is UNSAT
At refinement iteration 3 (OVERLAPS) 53/76 variables, 23/28 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 25/53 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/76 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 53 constraints, problems are : Problem set: 1 solved, 49 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 53/76 variables, 23/28 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 25/53 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 49/102 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 102 constraints, problems are : Problem set: 1 solved, 49 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 49/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 1020ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 1021ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 23/23 places, 57/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-05-24 03:03:47] [INFO ] Redundant transitions in 12 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1150 ms. Remains : 23/23 places, 57/58 transitions.
[2024-05-24 03:03:47] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
// Phase 1: matrix 52 rows 23 cols
[2024-05-24 03:03:47] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (298753 resets) in 802 ms. (1245 steps per ms)
BEST_FIRST walk for 1000001 steps (54186 resets) in 251 ms. (3968 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:03:48] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
[2024-05-24 03:03:48] [INFO ] Invariant cache hit.
[2024-05-24 03:03:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 03:03:49] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 03:03:49] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 03:03:49] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:03:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:03:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 03:03:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-24 03:03:49] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:03:49] [INFO ] Computed and/alt/rep : 24/124/24 causal constraints (skipped 20 transitions) in 2 ms.
[2024-05-24 03:03:49] [INFO ] Added : 3 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 11 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:[0] Max Struct:[1]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 57/57 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 57/57 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 23/23 places, 57/57 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 57/57 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-05-24 03:03:49] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
[2024-05-24 03:03:49] [INFO ] Invariant cache hit.
[2024-05-24 03:03:49] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:03:49] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
[2024-05-24 03:03:49] [INFO ] Invariant cache hit.
[2024-05-24 03:03:49] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 03:03:49] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-24 03:03:49] [INFO ] Redundant transitions in 10 ms returned []
Running 49 sub problems to find dead transitions.
[2024-05-24 03:03:49] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
[2024-05-24 03:03:49] [INFO ] Invariant cache hit.
[2024-05-24 03:03:49] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 52/75 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 25/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 53 constraints, problems are : Problem set: 0 solved, 49 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 52/75 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 25/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 102 constraints, problems are : Problem set: 0 solved, 49 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 1042ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1043ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1131 ms. Remains : 23/23 places, 57/57 transitions.
RANDOM walk for 40000 steps (11943 resets) in 682 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2168 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
[2024-05-24 03:03:50] [INFO ] Flatten gal took : 51 ms
BEST_FIRST walk for 40003 steps (2224 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
[2024-05-24 03:03:50] [INFO ] Flatten gal took : 22 ms
Finished probabilistic random walk after 987 steps, run visited all 2 properties in 13 ms. (steps per millisecond=75 )
Probabilistic random walk after 987 steps, saw 399 distinct states, run finished after 16 ms. (steps per millisecond=61 ) properties seen :2
[2024-05-24 03:03:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality418289565148012084.gal : 14 ms
[2024-05-24 03:03:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10584209905322345846.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/ReachabilityCardinality418289565148012084.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10584209905322345846.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA HealthRecord-PT-07-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 20358 ms.

BK_STOP 1716519830677

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-07"
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-07, 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-171640604100749"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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