fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r496-tall-171640604100749
Last Updated
July 7, 2024

About the Execution of LTSMin+red for HealthRecord-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
429.991 21979.00 36251.00 127.80 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-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 ltsminxred
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 r496-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 1717201130180

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:18:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:18:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:18:51] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-06-01 00:18:51] [INFO ] Transformed 155 places.
[2024-06-01 00:18:51] [INFO ] Transformed 320 transitions.
[2024-06-01 00:18:51] [INFO ] Found NUPN structural information;
[2024-06-01 00:18:51] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 170 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-06-01 00:18:51] [INFO ] Flow matrix only has 283 transitions (discarded 12 similar events)
// Phase 1: matrix 283 rows 155 cols
[2024-06-01 00:18:51] [INFO ] Computed 18 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (511 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-07 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-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (389 resets) in 44 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-01 00:18:51] [INFO ] Flow matrix only has 283 transitions (discarded 12 similar events)
[2024-06-01 00:18:51] [INFO ] Invariant cache hit.
[2024-06-01 00:18:51] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-01 00:18:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2024-06-01 00:18:51] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-01 00:18:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:18:51] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:18:52] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 8 ms to minimize.
[2024-06-01 00:18:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:18:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:18:52] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:18:52] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 00:18:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:18:52] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 2 ms to minimize.
[2024-06-01 00:18:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-06-01 00:18:52] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 29 ms.
[2024-06-01 00:18:52] [INFO ] Added : 23 causal constraints over 6 iterations in 168 ms. Result :sat
Minimization took 122 ms.
[2024-06-01 00:18:52] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:18:52] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:18:52] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 00:18:52] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-06-01 00:18:52] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:18:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:18:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 00:18:52] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-06-01 00:18:52] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-01 00:18:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:18:53] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-06-01 00:18:53] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 19 ms.
[2024-06-01 00:18:53] [INFO ] Added : 13 causal constraints over 3 iterations in 70 ms. Result :sat
Minimization took 115 ms.
[2024-06-01 00:18:53] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:18:53] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:18:53] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-01 00:18:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:18:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:18:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:18:53] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:18:53] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-01 00:18:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:18:53] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 16 ms.
[2024-06-01 00:18:53] [INFO ] Added : 29 causal constraints over 7 iterations in 126 ms. Result :sat
Minimization took 103 ms.
[2024-06-01 00:18:53] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:18:53] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:18:53] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-01 00:18:53] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-06-01 00:18:53] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 21 ms.
[2024-06-01 00:18:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:18:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:18:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-06-01 00:18:54] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-01 00:18:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:18:54] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 21 ms.
[2024-06-01 00:18:54] [INFO ] Added : 35 causal constraints over 8 iterations in 133 ms. Result :sat
Minimization took 109 ms.
[2024-06-01 00:18:54] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:18:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:18:54] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-01 00:18:54] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:18:54] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:18:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:18:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:18:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:18:54] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-01 00:18:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:18:54] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:18:54] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2024-06-01 00:18:54] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 26 ms.
[2024-06-01 00:18:54] [INFO ] Added : 21 causal constraints over 5 iterations in 118 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 295/295 transitions.
Graph (trivial) has 229 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.2 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 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 188 place count 44 transition count 88
Iterating global reduction 3 with 10 rules applied. Total rules applied 198 place count 44 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 207 place count 44 transition count 79
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 209 place count 42 transition count 73
Iterating global reduction 4 with 2 rules applied. Total rules applied 211 place count 42 transition count 73
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 213 place count 40 transition count 69
Iterating global reduction 4 with 2 rules applied. Total rules applied 215 place count 40 transition count 69
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 221 place count 40 transition count 63
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 225 place count 38 transition count 61
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 235 place count 33 transition count 89
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 237 place count 33 transition count 87
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 247 place count 33 transition count 87
Applied a total of 247 rules in 68 ms. Remains 33 /155 variables (removed 122) and now considering 87/295 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 33/155 places, 87/295 transitions.
[2024-06-01 00:18:55] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 33 cols
[2024-06-01 00:18:55] [INFO ] Computed 6 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (314442 resets) in 1288 ms. (775 steps per ms)
FORMULA HealthRecord-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (166430 resets) in 1024 ms. (2926 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 00:18:57] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
[2024-06-01 00:18:57] [INFO ] Invariant cache hit.
[2024-06-01 00:18:57] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 00:18:57] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 00:18:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 00:18:57] [INFO ] [Real]Added 21 Read/Feed constraints in 5 ms returned sat
[2024-06-01 00:18:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:18:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 00:18:57] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 00:18:57] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:18:57] [INFO ] Computed and/alt/rep : 32/184/32 causal constraints (skipped 43 transitions) in 9 ms.
[2024-06-01 00:18:57] [INFO ] Added : 10 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 00:18:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 00:18:57] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 00:18:57] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:18:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:18:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 00:18:57] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 00:18:57] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:18:57] [INFO ] Computed and/alt/rep : 32/184/32 causal constraints (skipped 43 transitions) in 7 ms.
[2024-06-01 00:18:57] [INFO ] Added : 6 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 22 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 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 87/87 transitions.
Graph (complete) has 156 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
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 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 91
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 31 transition count 91
Applied a total of 5 rules in 8 ms. Remains 31 /33 variables (removed 2) and now considering 91/87 (removed -4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 31/33 places, 91/87 transitions.
[2024-06-01 00:18:57] [INFO ] Flow matrix only has 87 transitions (discarded 4 similar events)
// Phase 1: matrix 87 rows 31 cols
[2024-06-01 00:18:57] [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 (314282 resets) in 1123 ms. (889 steps per ms)
FORMULA HealthRecord-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (55296 resets) in 305 ms. (3267 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:18:59] [INFO ] Flow matrix only has 87 transitions (discarded 4 similar events)
[2024-06-01 00:18:59] [INFO ] Invariant cache hit.
[2024-06-01 00:18:59] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-01 00:18:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 00:18:59] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 00:18:59] [INFO ] [Real]Added 28 Read/Feed constraints in 5 ms returned sat
[2024-06-01 00:18:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:18:59] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-01 00:18:59] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 00:18:59] [INFO ] [Nat]Added 28 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:18:59] [INFO ] Computed and/alt/rep : 36/197/36 causal constraints (skipped 43 transitions) in 7 ms.
[2024-06-01 00:18:59] [INFO ] Added : 6 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 30 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 31 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p144) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 29 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 29 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 28 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 28 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 27 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 27 transition count 77
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 27 transition count 72
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 27 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 26 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 26 transition count 69
Applied a total of 16 rules in 13 ms. Remains 26 /31 variables (removed 5) and now considering 69/89 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 26/31 places, 69/89 transitions.
[2024-06-01 00:18:59] [INFO ] Flow matrix only has 64 transitions (discarded 5 similar events)
// Phase 1: matrix 64 rows 26 cols
[2024-06-01 00:18:59] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (315699 resets) in 997 ms. (1002 steps per ms)
BEST_FIRST walk for 1000001 steps (57233 resets) in 287 ms. (3472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:19:00] [INFO ] Flow matrix only has 64 transitions (discarded 5 similar events)
[2024-06-01 00:19:00] [INFO ] Invariant cache hit.
[2024-06-01 00:19:00] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-01 00:19:00] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 00:19:00] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 00:19:00] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:19:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:19:00] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-01 00:19:00] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 00:19:00] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:19:00] [INFO ] Computed and/alt/rep : 25/125/25 causal constraints (skipped 31 transitions) in 5 ms.
[2024-06-01 00:19:00] [INFO ] Added : 3 causal constraints over 1 iterations in 14 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 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 69/69 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 26/26 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 69/69 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-06-01 00:19:00] [INFO ] Flow matrix only has 64 transitions (discarded 5 similar events)
[2024-06-01 00:19:00] [INFO ] Invariant cache hit.
[2024-06-01 00:19:00] [INFO ] Implicit Places using invariants in 50 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/26 places, 69/69 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 59 ms. Remains : 25/26 places, 69/69 transitions.
[2024-06-01 00:19:00] [INFO ] Flow matrix only has 64 transitions (discarded 5 similar events)
// Phase 1: matrix 64 rows 25 cols
[2024-06-01 00:19:00] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (316625 resets) in 904 ms. (1104 steps per ms)
BEST_FIRST walk for 1000001 steps (57132 resets) in 266 ms. (3745 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:19:02] [INFO ] Flow matrix only has 64 transitions (discarded 5 similar events)
[2024-06-01 00:19:02] [INFO ] Invariant cache hit.
[2024-06-01 00:19:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-06-01 00:19:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 00:19:02] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 00:19:02] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:19:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:19:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 00:19:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 00:19:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2024-06-01 00:19:02] [INFO ] Computed and/alt/rep : 25/125/25 causal constraints (skipped 31 transitions) in 6 ms.
[2024-06-01 00:19:02] [INFO ] Added : 3 causal constraints over 1 iterations in 17 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 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 69/69 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 25/25 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 69/69 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-06-01 00:19:02] [INFO ] Flow matrix only has 64 transitions (discarded 5 similar events)
[2024-06-01 00:19:02] [INFO ] Invariant cache hit.
[2024-06-01 00:19:02] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 00:19:02] [INFO ] Flow matrix only has 64 transitions (discarded 5 similar events)
[2024-06-01 00:19:02] [INFO ] Invariant cache hit.
[2024-06-01 00:19:02] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 00:19:02] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-01 00:19:02] [INFO ] Redundant transitions in 13 ms returned []
Running 61 sub problems to find dead transitions.
[2024-06-01 00:19:02] [INFO ] Flow matrix only has 64 transitions (discarded 5 similar events)
[2024-06-01 00:19:02] [INFO ] Invariant cache hit.
[2024-06-01 00:19:02] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem TDEAD49 is UNSAT
At refinement iteration 3 (OVERLAPS) 64/89 variables, 25/29 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 26/55 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/89 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 55 constraints, problems are : Problem set: 1 solved, 60 unsolved in 690 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 64/89 variables, 25/29 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 26/55 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 60/115 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/89 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 115 constraints, problems are : Problem set: 1 solved, 60 unsolved in 853 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 60/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 1618ms problems are : Problem set: 1 solved, 60 unsolved
Search for dead transitions found 1 dead transitions in 1629ms
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 : 25/25 places, 68/69 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 67
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 11 place count 24 transition count 67
Applied a total of 11 rules in 6 ms. Remains 24 /25 variables (removed 1) and now considering 67/68 (removed 1) transitions.
[2024-06-01 00:19:04] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
// Phase 1: matrix 62 rows 24 cols
[2024-06-01 00:19:04] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 00:19:04] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 00:19:04] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
[2024-06-01 00:19:04] [INFO ] Invariant cache hit.
[2024-06-01 00:19:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:04] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 24/25 places, 67/69 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1845 ms. Remains : 24/25 places, 67/69 transitions.
[2024-06-01 00:19:04] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
[2024-06-01 00:19:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (326063 resets) in 910 ms. (1097 steps per ms)
BEST_FIRST walk for 1000001 steps (57604 resets) in 256 ms. (3891 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:19:05] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
[2024-06-01 00:19:05] [INFO ] Invariant cache hit.
[2024-06-01 00:19:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:19:05] [INFO ] [Real]Absence check using 1 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 00:19:05] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 00:19:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:05] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:19:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:19:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:19:05] [INFO ] [Nat]Absence check using 1 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 00:19:05] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 00:19:05] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:19:05] [INFO ] Computed and/alt/rep : 24/124/24 causal constraints (skipped 30 transitions) in 5 ms.
[2024-06-01 00:19:05] [INFO ] Added : 3 causal constraints over 2 iterations in 17 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 2 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 2 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 2 ms. Remains 24 /24 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2024-06-01 00:19:05] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
[2024-06-01 00:19:05] [INFO ] Invariant cache hit.
[2024-06-01 00:19:05] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 00:19:05] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
[2024-06-01 00:19:05] [INFO ] Invariant cache hit.
[2024-06-01 00:19:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:05] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-06-01 00:19:05] [INFO ] Redundant transitions in 18 ms returned []
Running 59 sub problems to find dead transitions.
[2024-06-01 00:19:05] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
[2024-06-01 00:19:05] [INFO ] Invariant cache hit.
[2024-06-01 00:19:05] [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 443 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 726 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 1218ms problems are : Problem set: 9 solved, 50 unsolved
Search for dead transitions found 9 dead transitions in 1219ms
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.1 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 8 ms. Remains 23 /24 variables (removed 1) and now considering 58/58 (removed 0) transitions.
[2024-06-01 00:19:06] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
// Phase 1: matrix 53 rows 23 cols
[2024-06-01 00:19:06] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 00:19:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 00:19:06] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-06-01 00:19:06] [INFO ] Invariant cache hit.
[2024-06-01 00:19:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:06] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 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 1421 ms. Remains : 23/24 places, 58/67 transitions.
[2024-06-01 00:19:06] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-06-01 00:19:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (298581 resets) in 880 ms. (1135 steps per ms)
BEST_FIRST walk for 1000001 steps (53984 resets) in 262 ms. (3802 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:19:07] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-06-01 00:19:07] [INFO ] Invariant cache hit.
[2024-06-01 00:19:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 00:19:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 00:19:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:08] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:19:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:19:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 00:19:08] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 00:19:08] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:19:08] [INFO ] Computed and/alt/rep : 24/124/24 causal constraints (skipped 21 transitions) in 4 ms.
[2024-06-01 00:19:08] [INFO ] Added : 2 causal constraints over 1 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 2 ms. Remains 23 /23 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-06-01 00:19:08] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-06-01 00:19:08] [INFO ] Invariant cache hit.
[2024-06-01 00:19:08] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 00:19:08] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-06-01 00:19:08] [INFO ] Invariant cache hit.
[2024-06-01 00:19:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-01 00:19:08] [INFO ] Redundant transitions in 12 ms returned []
Running 50 sub problems to find dead transitions.
[2024-06-01 00:19:08] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-06-01 00:19:08] [INFO ] Invariant cache hit.
[2024-06-01 00:19:08] [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 439 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 586 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 1065ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 1074ms
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 15 ms. Remains 23 /23 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-06-01 00:19:09] [INFO ] Redundant transitions in 14 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1202 ms. Remains : 23/23 places, 57/58 transitions.
[2024-06-01 00:19:09] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
// Phase 1: matrix 52 rows 23 cols
[2024-06-01 00:19:09] [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 (298608 resets) in 827 ms. (1207 steps per ms)
BEST_FIRST walk for 1000000 steps (54161 resets) in 262 ms. (3802 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:19:10] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
[2024-06-01 00:19:10] [INFO ] Invariant cache hit.
[2024-06-01 00:19:10] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 00:19:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 00:19:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:10] [INFO ] [Real]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:19:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:19:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 00:19:10] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 00:19:10] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:19:10] [INFO ] Computed and/alt/rep : 24/124/24 causal constraints (skipped 20 transitions) in 3 ms.
[2024-06-01 00:19:10] [INFO ] Added : 2 causal constraints over 1 iterations in 11 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 3 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 3 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 2 ms. Remains 23 /23 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-06-01 00:19:10] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
[2024-06-01 00:19:10] [INFO ] Invariant cache hit.
[2024-06-01 00:19:10] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 00:19:10] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
[2024-06-01 00:19:10] [INFO ] Invariant cache hit.
[2024-06-01 00:19:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:10] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-06-01 00:19:10] [INFO ] Redundant transitions in 16 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 00:19:10] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
[2024-06-01 00:19:10] [INFO ] Invariant cache hit.
[2024-06-01 00:19:10] [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 426 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 592 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 1046ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1047ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1156 ms. Remains : 23/23 places, 57/57 transitions.
RANDOM walk for 40000 steps (11919 resets) in 752 ms. (53 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2193 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2175 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
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
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 20758 ms.
ITS solved all properties within timeout

BK_STOP 1717201152159

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
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 r496-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 ;