About the Execution of ITS-Tools for FireWire-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 547.892 | 46255.00 | 64757.00 | 170.70 | 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.r550-tall-171734898700181.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FireWire-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898700181
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 86K Jun 2 16:33 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 FireWire-PT-02-UpperBounds-00
FORMULA_NAME FireWire-PT-02-UpperBounds-01
FORMULA_NAME FireWire-PT-02-UpperBounds-02
FORMULA_NAME FireWire-PT-02-UpperBounds-03
FORMULA_NAME FireWire-PT-02-UpperBounds-04
FORMULA_NAME FireWire-PT-02-UpperBounds-05
FORMULA_NAME FireWire-PT-02-UpperBounds-06
FORMULA_NAME FireWire-PT-02-UpperBounds-07
FORMULA_NAME FireWire-PT-02-UpperBounds-08
FORMULA_NAME FireWire-PT-02-UpperBounds-09
FORMULA_NAME FireWire-PT-02-UpperBounds-10
FORMULA_NAME FireWire-PT-02-UpperBounds-11
FORMULA_NAME FireWire-PT-02-UpperBounds-12
FORMULA_NAME FireWire-PT-02-UpperBounds-13
FORMULA_NAME FireWire-PT-02-UpperBounds-14
FORMULA_NAME FireWire-PT-02-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717359215083
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 20:13:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:13:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:13:36] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 20:13:36] [INFO ] Transformed 108 places.
[2024-06-02 20:13:36] [INFO ] Transformed 355 transitions.
[2024-06-02 20:13:36] [INFO ] Found NUPN structural information;
[2024-06-02 20:13:36] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 54 transitions
Reduce redundant transitions removed 54 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-02 20:13:36] [INFO ] Flow matrix only has 269 transitions (discarded 32 similar events)
// Phase 1: matrix 269 rows 108 cols
[2024-06-02 20:13:36] [INFO ] Computed 8 invariants in 25 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 (531 resets) in 43 ms. (227 steps per ms)
FORMULA FireWire-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60003 steps (888 resets) in 70 ms. (845 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-02 20:13:36] [INFO ] Flow matrix only has 269 transitions (discarded 32 similar events)
[2024-06-02 20:13:36] [INFO ] Invariant cache hit.
[2024-06-02 20:13:36] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 20:13:37] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-06-02 20:13:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:13:37] [INFO ] [Real]Added 40 Read/Feed constraints in 23 ms returned sat
[2024-06-02 20:13:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 20:13:37] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-02 20:13:37] [INFO ] [Nat]Added 40 Read/Feed constraints in 40 ms returned sat
[2024-06-02 20:13:37] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 46 ms.
[2024-06-02 20:13:37] [INFO ] Added : 2 causal constraints over 2 iterations in 162 ms. Result :sat
Minimization took 63 ms.
[2024-06-02 20:13:37] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:37] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-02 20:13:37] [INFO ] [Real]Added 40 Read/Feed constraints in 20 ms returned sat
[2024-06-02 20:13:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:13:37] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-06-02 20:13:37] [INFO ] [Nat]Added 40 Read/Feed constraints in 15 ms returned sat
[2024-06-02 20:13:37] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 32 ms.
[2024-06-02 20:13:38] [INFO ] Added : 25 causal constraints over 6 iterations in 180 ms. Result :sat
Minimization took 51 ms.
[2024-06-02 20:13:38] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:13:38] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-02 20:13:38] [INFO ] [Real]Added 40 Read/Feed constraints in 7 ms returned sat
[2024-06-02 20:13:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:13:38] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 20:13:38] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-02 20:13:38] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 35 ms.
[2024-06-02 20:13:38] [INFO ] Added : 13 causal constraints over 5 iterations in 124 ms. Result :sat
Minimization took 52 ms.
[2024-06-02 20:13:38] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:13:38] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-02 20:13:38] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-06-02 20:13:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:13:38] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-02 20:13:38] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2024-06-02 20:13:38] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 31 ms.
[2024-06-02 20:13:39] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 10 ms to minimize.
[2024-06-02 20:13:39] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:13:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2024-06-02 20:13:39] [INFO ] Added : 40 causal constraints over 9 iterations in 398 ms. Result :sat
Minimization took 64 ms.
[2024-06-02 20:13:39] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:13:39] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-02 20:13:39] [INFO ] [Real]Added 40 Read/Feed constraints in 11 ms returned sat
[2024-06-02 20:13:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:13:39] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-02 20:13:39] [INFO ] [Nat]Added 40 Read/Feed constraints in 14 ms returned sat
[2024-06-02 20:13:39] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 22 ms.
[2024-06-02 20:13:39] [INFO ] Added : 19 causal constraints over 4 iterations in 105 ms. Result :sat
Minimization took 53 ms.
[2024-06-02 20:13:39] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:39] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 20:13:39] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-06-02 20:13:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:13:39] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 20:13:39] [INFO ] [Nat]Added 40 Read/Feed constraints in 9 ms returned sat
[2024-06-02 20:13:39] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:13:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-06-02 20:13:39] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 25 ms.
[2024-06-02 20:13:40] [INFO ] Added : 9 causal constraints over 3 iterations in 101 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-02-UpperBounds-08 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 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 301/301 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 107 transition count 297
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 107 transition count 296
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 106 transition count 296
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 12 place count 101 transition count 284
Iterating global reduction 2 with 5 rules applied. Total rules applied 17 place count 101 transition count 284
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 20 place count 101 transition count 281
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 99 transition count 277
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 99 transition count 277
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 96 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 36 place count 96 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 45 place count 96 transition count 268
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 96 transition count 270
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 49 place count 95 transition count 268
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 51 place count 95 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 52 place count 94 transition count 265
Applied a total of 52 rules in 94 ms. Remains 94 /108 variables (removed 14) and now considering 265/301 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 94/108 places, 265/301 transitions.
[2024-06-02 20:13:40] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
// Phase 1: matrix 236 rows 94 cols
[2024-06-02 20:13:40] [INFO ] Computed 8 invariants in 7 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 (63575 resets) in 1187 ms. (841 steps per ms)
FORMULA FireWire-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (48685 resets) in 1205 ms. (2487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 20:13:42] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 20:13:42] [INFO ] Invariant cache hit.
[2024-06-02 20:13:42] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:42] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-06-02 20:13:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:13:42] [INFO ] [Real]Added 38 Read/Feed constraints in 6 ms returned sat
[2024-06-02 20:13:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:42] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 20:13:43] [INFO ] [Nat]Added 38 Read/Feed constraints in 12 ms returned sat
[2024-06-02 20:13:43] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 17 ms.
[2024-06-02 20:13:43] [INFO ] Added : 40 causal constraints over 9 iterations in 140 ms. Result :sat
Minimization took 86 ms.
[2024-06-02 20:13:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:43] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 20:13:43] [INFO ] [Real]Added 38 Read/Feed constraints in 3 ms returned sat
[2024-06-02 20:13:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:43] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 20:13:43] [INFO ] [Nat]Added 38 Read/Feed constraints in 5 ms returned sat
[2024-06-02 20:13:43] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 19 ms.
[2024-06-02 20:13:43] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:13:43] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:13:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2024-06-02 20:13:43] [INFO ] Added : 59 causal constraints over 17 iterations in 430 ms. Result :sat
Minimization took 80 ms.
[2024-06-02 20:13:43] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 20:13:44] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 20:13:44] [INFO ] [Real]Added 38 Read/Feed constraints in 9 ms returned sat
[2024-06-02 20:13:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:44] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-02 20:13:44] [INFO ] [Nat]Added 38 Read/Feed constraints in 6 ms returned sat
[2024-06-02 20:13:44] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 22 ms.
[2024-06-02 20:13:44] [INFO ] Added : 36 causal constraints over 9 iterations in 135 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 265/265 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 94/94 places, 265/265 transitions.
[2024-06-02 20:13:44] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 20:13:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (63827 resets) in 1135 ms. (880 steps per ms)
BEST_FIRST walk for 3000001 steps (48144 resets) in 1287 ms. (2329 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 20:13:46] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 20:13:46] [INFO ] Invariant cache hit.
[2024-06-02 20:13:46] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:46] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 20:13:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:13:46] [INFO ] [Real]Added 38 Read/Feed constraints in 8 ms returned sat
[2024-06-02 20:13:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:13:47] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-02 20:13:47] [INFO ] [Nat]Added 38 Read/Feed constraints in 11 ms returned sat
[2024-06-02 20:13:47] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 15 ms.
[2024-06-02 20:13:47] [INFO ] Added : 40 causal constraints over 9 iterations in 143 ms. Result :sat
Minimization took 77 ms.
[2024-06-02 20:13:47] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 20:13:47] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-06-02 20:13:47] [INFO ] [Real]Added 38 Read/Feed constraints in 4 ms returned sat
[2024-06-02 20:13:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:47] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-02 20:13:47] [INFO ] [Nat]Added 38 Read/Feed constraints in 5 ms returned sat
[2024-06-02 20:13:47] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 16 ms.
[2024-06-02 20:13:47] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:13:47] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:13:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2024-06-02 20:13:47] [INFO ] Added : 59 causal constraints over 17 iterations in 400 ms. Result :sat
Minimization took 83 ms.
[2024-06-02 20:13:47] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:47] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 20:13:48] [INFO ] [Real]Added 38 Read/Feed constraints in 9 ms returned sat
[2024-06-02 20:13:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:48] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-02 20:13:48] [INFO ] [Nat]Added 38 Read/Feed constraints in 7 ms returned sat
[2024-06-02 20:13:48] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 13 ms.
[2024-06-02 20:13:48] [INFO ] Added : 36 causal constraints over 9 iterations in 130 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 265/265 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 94/94 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 265/265 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-06-02 20:13:48] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 20:13:48] [INFO ] Invariant cache hit.
[2024-06-02 20:13:48] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:13:48] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 20:13:48] [INFO ] Invariant cache hit.
[2024-06-02 20:13:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:13:48] [INFO ] Implicit Places using invariants and state equation in 228 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 296 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 93/94 places, 265/265 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 309 ms. Remains : 93/94 places, 265/265 transitions.
[2024-06-02 20:13:48] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
// Phase 1: matrix 236 rows 93 cols
[2024-06-02 20:13:48] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (63665 resets) in 1151 ms. (868 steps per ms)
BEST_FIRST walk for 3000002 steps (48654 resets) in 1234 ms. (2429 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 20:13:51] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 20:13:51] [INFO ] Invariant cache hit.
[2024-06-02 20:13:51] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:51] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 20:13:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:13:51] [INFO ] [Real]Added 38 Read/Feed constraints in 8 ms returned sat
[2024-06-02 20:13:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:51] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 20:13:51] [INFO ] [Nat]Added 38 Read/Feed constraints in 12 ms returned sat
[2024-06-02 20:13:51] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 13 ms.
[2024-06-02 20:13:51] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 2 ms to minimize.
[2024-06-02 20:13:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-06-02 20:13:51] [INFO ] Added : 28 causal constraints over 7 iterations in 188 ms. Result :sat
Minimization took 75 ms.
[2024-06-02 20:13:51] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:51] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 20:13:51] [INFO ] [Real]Added 38 Read/Feed constraints in 7 ms returned sat
[2024-06-02 20:13:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:51] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 20:13:51] [INFO ] [Nat]Added 38 Read/Feed constraints in 16 ms returned sat
[2024-06-02 20:13:51] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 16 ms.
[2024-06-02 20:13:51] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:13:51] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:13:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2024-06-02 20:13:51] [INFO ] Added : 34 causal constraints over 7 iterations in 262 ms. Result :sat
Minimization took 83 ms.
[2024-06-02 20:13:52] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:52] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-02 20:13:52] [INFO ] [Real]Added 38 Read/Feed constraints in 8 ms returned sat
[2024-06-02 20:13:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:13:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 20:13:52] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 20:13:52] [INFO ] [Nat]Added 38 Read/Feed constraints in 11 ms returned sat
[2024-06-02 20:13:52] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 15 ms.
[2024-06-02 20:13:52] [INFO ] Added : 44 causal constraints over 9 iterations in 135 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 265/265 transitions.
Applied a total of 0 rules in 7 ms. Remains 93 /93 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 93/93 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 265/265 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-06-02 20:13:52] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 20:13:52] [INFO ] Invariant cache hit.
[2024-06-02 20:13:52] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:13:52] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 20:13:52] [INFO ] Invariant cache hit.
[2024-06-02 20:13:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:13:52] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-06-02 20:13:52] [INFO ] Redundant transitions in 11 ms returned []
Running 263 sub problems to find dead transitions.
[2024-06-02 20:13:52] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 20:13:52] [INFO ] Invariant cache hit.
[2024-06-02 20:13:52] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-02 20:13:53] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:13:53] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:13:53] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:13:53] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:13:54] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-06-02 20:13:54] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 8 ms to minimize.
[2024-06-02 20:13:54] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-02 20:13:54] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 236/328 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 38/145 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 1/329 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-02 20:13:59] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 147 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10733 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 236/328 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 38/146 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 263/409 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 1/329 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 410 constraints, problems are : Problem set: 0 solved, 263 unsolved in 16552 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
After SMT, in 27518ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 27533ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27841 ms. Remains : 93/93 places, 265/265 transitions.
RANDOM walk for 40000 steps (2619 resets) in 1804 ms. (22 steps per ms) remains 6/6 properties
[2024-06-02 20:14:20] [INFO ] Flatten gal took : 107 ms
BEST_FIRST walk for 40004 steps (597 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
[2024-06-02 20:14:20] [INFO ] Flatten gal took : 59 ms
[2024-06-02 20:14:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16957971774096812736.gal : 12 ms
BEST_FIRST walk for 40004 steps (679 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
[2024-06-02 20:14:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12824416662009222458.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16957971774096812736.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12824416662009222458.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (669 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12824416662009222458.prop.
BEST_FIRST walk for 40004 steps (710 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :12 after 20
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :20 after 43
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :43 after 105
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :105 after 231
BEST_FIRST walk for 40002 steps (623 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :231 after 1080
BEST_FIRST walk for 40004 steps (602 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1080 after 6317
Finished probabilistic random walk after 1821 steps, run visited all 6 properties in 41 ms. (steps per millisecond=44 )
Probabilistic random walk after 1821 steps, saw 1024 distinct states, run finished after 45 ms. (steps per millisecond=40 ) properties seen :6
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-02-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-02-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-02-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 45043 ms.
BK_STOP 1717359261338
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-02, 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 r550-tall-171734898700181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-02.tgz
mv FireWire-PT-02 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 '
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 ;