Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r197-smll-167840344100325.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is HealthRecord-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840344100325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 17:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 71K Mar 5 18:22 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-12-UpperBounds-00
FORMULA_NAME HealthRecord-PT-12-UpperBounds-01
FORMULA_NAME HealthRecord-PT-12-UpperBounds-02
FORMULA_NAME HealthRecord-PT-12-UpperBounds-03
FORMULA_NAME HealthRecord-PT-12-UpperBounds-04
FORMULA_NAME HealthRecord-PT-12-UpperBounds-05
FORMULA_NAME HealthRecord-PT-12-UpperBounds-06
FORMULA_NAME HealthRecord-PT-12-UpperBounds-07
FORMULA_NAME HealthRecord-PT-12-UpperBounds-08
FORMULA_NAME HealthRecord-PT-12-UpperBounds-09
FORMULA_NAME HealthRecord-PT-12-UpperBounds-10
FORMULA_NAME HealthRecord-PT-12-UpperBounds-11
FORMULA_NAME HealthRecord-PT-12-UpperBounds-12
FORMULA_NAME HealthRecord-PT-12-UpperBounds-13
FORMULA_NAME HealthRecord-PT-12-UpperBounds-14
FORMULA_NAME HealthRecord-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678513770307

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-12
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-11 05:49:33] [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]
[2023-03-11 05:49:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:49:33] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-11 05:49:33] [INFO ] Transformed 160 places.
[2023-03-11 05:49:33] [INFO ] Transformed 340 transitions.
[2023-03-11 05:49:33] [INFO ] Found NUPN structural information;
[2023-03-11 05:49:33] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 300 out of 312 initially.
// Phase 1: matrix 300 rows 160 cols
[2023-03-11 05:49:33] [INFO ] Computed 18 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 712 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 15) seen :10
FORMULA HealthRecord-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :1
FORMULA HealthRecord-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 05:49:33] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2023-03-11 05:49:33] [INFO ] Computed 18 place invariants in 22 ms
[2023-03-11 05:49:33] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-11 05:49:33] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 05:49:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:49:34] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-11 05:49:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:49:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 05:49:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 05:49:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:49:34] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2023-03-11 05:49:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:49:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-11 05:49:34] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 5 ms to minimize.
[2023-03-11 05:49:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-11 05:49:34] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 82 ms.
[2023-03-11 05:49:34] [INFO ] Added : 29 causal constraints over 6 iterations in 310 ms. Result :sat
Minimization took 36 ms.
[2023-03-11 05:49:35] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-11 05:49:35] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 05:49:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:49:35] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-11 05:49:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:49:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-11 05:49:35] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 05:49:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:49:35] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-11 05:49:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-11 05:49:35] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2023-03-11 05:49:35] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2023-03-11 05:49:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2023-03-11 05:49:35] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 37 ms.
[2023-03-11 05:49:35] [INFO ] Added : 21 causal constraints over 5 iterations in 152 ms. Result :sat
Minimization took 33 ms.
[2023-03-11 05:49:35] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-11 05:49:35] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 05:49:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:49:35] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-11 05:49:36] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 05:49:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:49:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 05:49:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 05:49:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:49:36] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-11 05:49:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 05:49:36] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 35 ms.
[2023-03-11 05:49:36] [INFO ] Added : 17 causal constraints over 5 iterations in 161 ms. Result :sat
Minimization took 50 ms.
[2023-03-11 05:49:36] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 05:49:36] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 05:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:49:36] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-11 05:49:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:49:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 05:49:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 05:49:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:49:36] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-11 05:49:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2023-03-11 05:49:36] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2023-03-11 05:49:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-11 05:49:36] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 27 ms.
[2023-03-11 05:49:37] [INFO ] Added : 12 causal constraints over 3 iterations in 100 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA HealthRecord-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 312/312 transitions.
Graph (trivial) has 240 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 678 edges and 156 vertex of which 146 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 146 transition count 287
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 142 transition count 281
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 140 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 139 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 21 place count 139 transition count 278
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 23 place count 138 transition count 278
Discarding 81 places :
Symmetric choice reduction at 4 with 81 rule applications. Total rules 104 place count 57 transition count 116
Iterating global reduction 4 with 81 rules applied. Total rules applied 185 place count 57 transition count 116
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 195 place count 47 transition count 96
Iterating global reduction 4 with 10 rules applied. Total rules applied 205 place count 47 transition count 96
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 214 place count 47 transition count 87
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 215 place count 46 transition count 84
Iterating global reduction 5 with 1 rules applied. Total rules applied 216 place count 46 transition count 84
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 217 place count 45 transition count 82
Iterating global reduction 5 with 1 rules applied. Total rules applied 218 place count 45 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 221 place count 45 transition count 79
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 231 place count 40 transition count 118
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 40 transition count 117
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 235 place count 40 transition count 114
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 238 place count 37 transition count 114
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 239 place count 37 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 240 place count 36 transition count 113
Applied a total of 240 rules in 85 ms. Remains 36 /160 variables (removed 124) and now considering 113/312 (removed 199) transitions.
[2023-03-11 05:49:37] [INFO ] Flow matrix only has 99 transitions (discarded 14 similar events)
// Phase 1: matrix 99 rows 36 cols
[2023-03-11 05:49:37] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-11 05:49:37] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 36/160 places, 113/312 transitions.
Successfully produced net in file /tmp/petri1000_1527834602822200375.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
Normalized transition count is 98 out of 112 initially.
// Phase 1: matrix 98 rows 36 cols
[2023-03-11 05:49:37] [INFO ] Computed 9 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 220790 resets, run finished after 1995 ms. (steps per millisecond=501 ) properties (out of 3) seen :1
FORMULA HealthRecord-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 30746 resets, run finished after 501 ms. (steps per millisecond=1996 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 30823 resets, run finished after 446 ms. (steps per millisecond=2242 ) properties (out of 2) seen :0
[2023-03-11 05:49:40] [INFO ] Flow matrix only has 98 transitions (discarded 14 similar events)
// Phase 1: matrix 98 rows 36 cols
[2023-03-11 05:49:40] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 05:49:40] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-11 05:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:49:40] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-11 05:49:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:49:40] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-11 05:49:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:49:40] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-11 05:49:40] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-11 05:49:40] [INFO ] [Nat]Added 28 Read/Feed constraints in 6 ms returned sat
[2023-03-11 05:49:40] [INFO ] Computed and/alt/rep : 27/104/27 causal constraints (skipped 55 transitions) in 11 ms.
[2023-03-11 05:49:40] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 16 ms.
[2023-03-11 05:49:40] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-11 05:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:49:40] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-11 05:49:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:49:40] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-11 05:49:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:49:40] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-11 05:49:40] [INFO ] [Nat]Added 28 Read/Feed constraints in 6 ms returned sat
[2023-03-11 05:49:40] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
[2023-03-11 05:49:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-11 05:49:40] [INFO ] Computed and/alt/rep : 27/104/27 causal constraints (skipped 55 transitions) in 10 ms.
[2023-03-11 05:49:40] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA HealthRecord-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 7597 ms.

BK_STOP 1678513781674

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-12"
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-5348"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-12, 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 r197-smll-167840344100325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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