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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K 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 100K 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-09-UpperBounds-00
FORMULA_NAME FireWire-PT-09-UpperBounds-01
FORMULA_NAME FireWire-PT-09-UpperBounds-02
FORMULA_NAME FireWire-PT-09-UpperBounds-03
FORMULA_NAME FireWire-PT-09-UpperBounds-04
FORMULA_NAME FireWire-PT-09-UpperBounds-05
FORMULA_NAME FireWire-PT-09-UpperBounds-06
FORMULA_NAME FireWire-PT-09-UpperBounds-07
FORMULA_NAME FireWire-PT-09-UpperBounds-08
FORMULA_NAME FireWire-PT-09-UpperBounds-09
FORMULA_NAME FireWire-PT-09-UpperBounds-10
FORMULA_NAME FireWire-PT-09-UpperBounds-11
FORMULA_NAME FireWire-PT-09-UpperBounds-12
FORMULA_NAME FireWire-PT-09-UpperBounds-13
FORMULA_NAME FireWire-PT-09-UpperBounds-14
FORMULA_NAME FireWire-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717361888146

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 20:58:09] [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:58:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:58:09] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-02 20:58:09] [INFO ] Transformed 130 places.
[2024-06-02 20:58:09] [INFO ] Transformed 408 transitions.
[2024-06-02 20:58:09] [INFO ] Found NUPN structural information;
[2024-06-02 20:58:09] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 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:58:09] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
// Phase 1: matrix 320 rows 130 cols
[2024-06-02 20:58:09] [INFO ] Computed 8 invariants in 29 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 (556 resets) in 52 ms. (188 steps per ms)
FORMULA FireWire-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80005 steps (1150 resets) in 121 ms. (655 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 20:58:09] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
[2024-06-02 20:58:09] [INFO ] Invariant cache hit.
[2024-06-02 20:58:09] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:58:10] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-06-02 20:58:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:58:10] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-02 20:58:10] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:58:10] [INFO ] [Nat]Added 45 Read/Feed constraints in 23 ms returned sat
[2024-06-02 20:58:10] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 10 ms to minimize.
[2024-06-02 20:58:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2024-06-02 20:58:10] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 33 ms.
[2024-06-02 20:58:10] [INFO ] Added : 0 causal constraints over 0 iterations in 70 ms. Result :sat
Minimization took 122 ms.
[2024-06-02 20:58:10] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:58:10] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 20:58:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:58:10] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 20:58:10] [INFO ] [Nat]Added 45 Read/Feed constraints in 30 ms returned sat
[2024-06-02 20:58:10] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 36 ms.
[2024-06-02 20:58:11] [INFO ] Added : 19 causal constraints over 6 iterations in 223 ms. Result :sat
Minimization took 137 ms.
[2024-06-02 20:58:11] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:58:11] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-02 20:58:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:58:11] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-02 20:58:11] [INFO ] [Nat]Added 45 Read/Feed constraints in 14 ms returned sat
[2024-06-02 20:58:11] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 35 ms.
[2024-06-02 20:58:11] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:58:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-06-02 20:58:11] [INFO ] Added : 30 causal constraints over 8 iterations in 260 ms. Result :sat
Minimization took 118 ms.
[2024-06-02 20:58:11] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:58:12] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-02 20:58:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:58:12] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 20:58:12] [INFO ] [Nat]Added 45 Read/Feed constraints in 24 ms returned sat
[2024-06-02 20:58:12] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 26 ms.
[2024-06-02 20:58:12] [INFO ] Added : 10 causal constraints over 5 iterations in 132 ms. Result :sat
Minimization took 120 ms.
[2024-06-02 20:58:12] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:58:12] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-02 20:58:12] [INFO ] [Real]Added 45 Read/Feed constraints in 17 ms returned sat
[2024-06-02 20:58:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:58:12] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 20:58:12] [INFO ] [Nat]Added 45 Read/Feed constraints in 25 ms returned sat
[2024-06-02 20:58:12] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 22 ms.
[2024-06-02 20:58:12] [INFO ] Added : 17 causal constraints over 5 iterations in 128 ms. Result :sat
Minimization took 124 ms.
[2024-06-02 20:58:13] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:13] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 20:58:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:58:13] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-02 20:58:13] [INFO ] [Nat]Added 45 Read/Feed constraints in 11 ms returned sat
[2024-06-02 20:58:13] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:58:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-06-02 20:58:13] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 25 ms.
[2024-06-02 20:58:13] [INFO ] Added : 12 causal constraints over 5 iterations in 123 ms. Result :sat
Minimization took 118 ms.
[2024-06-02 20:58:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:58:13] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-02 20:58:13] [INFO ] [Real]Added 45 Read/Feed constraints in 9 ms returned sat
[2024-06-02 20:58:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:58:13] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-02 20:58:13] [INFO ] [Nat]Added 45 Read/Feed constraints in 20 ms returned sat
[2024-06-02 20:58:13] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 28 ms.
[2024-06-02 20:58:13] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:58:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-06-02 20:58:14] [INFO ] Added : 14 causal constraints over 5 iterations in 203 ms. Result :sat
Minimization took 122 ms.
[2024-06-02 20:58:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:58:14] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-02 20:58:14] [INFO ] [Real]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-06-02 20:58:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:58:14] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 20:58:14] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-02 20:58:14] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:58:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-06-02 20:58:14] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 19 ms.
[2024-06-02 20:58:14] [INFO ] Added : 4 causal constraints over 2 iterations in 68 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 352/352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 349
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 126 transition count 341
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 126 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 126 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 125 transition count 335
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 124 transition count 333
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 123 transition count 330
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 122 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 121 transition count 325
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 120 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 119 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 118 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 117 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 116 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 115 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 114 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 114 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 111 transition count 315
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 50 place count 111 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 59 place count 111 transition count 300
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 111 transition count 302
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 3 with 3 rules applied. Total rules applied 63 place count 110 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 110 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 109 transition count 297
Applied a total of 66 rules in 156 ms. Remains 109 /130 variables (removed 21) and now considering 297/352 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 109/130 places, 297/352 transitions.
[2024-06-02 20:58:14] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
// Phase 1: matrix 268 rows 109 cols
[2024-06-02 20:58:14] [INFO ] Computed 8 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (57844 resets) in 1122 ms. (890 steps per ms)
BEST_FIRST walk for 3000002 steps (42618 resets) in 1245 ms. (2407 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 20:58:17] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 20:58:17] [INFO ] Invariant cache hit.
[2024-06-02 20:58:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:17] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 20:58:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:17] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 20:58:17] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:58:17] [INFO ] [Nat]Added 40 Read/Feed constraints in 15 ms returned sat
[2024-06-02 20:58:17] [INFO ] Computed and/alt/rep : 120/482/120 causal constraints (skipped 146 transitions) in 22 ms.
[2024-06-02 20:58:17] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:58:17] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:58:17] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:58:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 210 ms
[2024-06-02 20:58:17] [INFO ] Added : 41 causal constraints over 9 iterations in 387 ms. Result :sat
Minimization took 68 ms.
[2024-06-02 20:58:18] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:18] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 20:58:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:18] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 20:58:18] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-06-02 20:58:18] [INFO ] Computed and/alt/rep : 120/482/120 causal constraints (skipped 146 transitions) in 18 ms.
[2024-06-02 20:58:18] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:58:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-06-02 20:58:18] [INFO ] Added : 41 causal constraints over 10 iterations in 266 ms. Result :sat
Minimization took 65 ms.
[2024-06-02 20:58:18] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:18] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 20:58:18] [INFO ] [Real]Added 40 Read/Feed constraints in 10 ms returned sat
[2024-06-02 20:58:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:18] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 20:58:18] [INFO ] [Nat]Added 40 Read/Feed constraints in 17 ms returned sat
[2024-06-02 20:58:18] [INFO ] Computed and/alt/rep : 120/482/120 causal constraints (skipped 146 transitions) in 16 ms.
[2024-06-02 20:58:18] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2024-06-02 20:58:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-06-02 20:58:19] [INFO ] Added : 42 causal constraints over 9 iterations in 308 ms. Result :sat
Minimization took 83 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 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 109/109 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 20:58:19] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 20:58:19] [INFO ] Invariant cache hit.
[2024-06-02 20:58:19] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:58:19] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 20:58:19] [INFO ] Invariant cache hit.
[2024-06-02 20:58:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:58:19] [INFO ] Implicit Places using invariants and state equation in 172 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 244 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 107/109 places, 297/297 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 105 transition count 295
Applied a total of 4 rules in 13 ms. Remains 105 /107 variables (removed 2) and now considering 295/297 (removed 2) transitions.
[2024-06-02 20:58:19] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
// Phase 1: matrix 266 rows 105 cols
[2024-06-02 20:58:19] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 20:58:19] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:58:19] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 20:58:19] [INFO ] Invariant cache hit.
[2024-06-02 20:58:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:58:19] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 105/109 places, 295/297 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 495 ms. Remains : 105/109 places, 295/297 transitions.
[2024-06-02 20:58:19] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 20:58:19] [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 (57408 resets) in 1137 ms. (878 steps per ms)
BEST_FIRST walk for 3000003 steps (42256 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:58:22] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 20:58:22] [INFO ] Invariant cache hit.
[2024-06-02 20:58:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:22] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 20:58:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:22] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 20:58:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:58:22] [INFO ] [Nat]Added 40 Read/Feed constraints in 22 ms returned sat
[2024-06-02 20:58:22] [INFO ] Computed and/alt/rep : 118/476/118 causal constraints (skipped 146 transitions) in 17 ms.
[2024-06-02 20:58:22] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:58:22] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:58:22] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:58:22] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:58:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 302 ms
[2024-06-02 20:58:22] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:58:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-06-02 20:58:22] [INFO ] Added : 49 causal constraints over 14 iterations in 624 ms. Result :sat
Minimization took 78 ms.
[2024-06-02 20:58:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:23] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 20:58:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:23] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 20:58:23] [INFO ] [Nat]Added 40 Read/Feed constraints in 17 ms returned sat
[2024-06-02 20:58:23] [INFO ] Computed and/alt/rep : 118/476/118 causal constraints (skipped 146 transitions) in 15 ms.
[2024-06-02 20:58:23] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:58:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-06-02 20:58:23] [INFO ] Added : 23 causal constraints over 6 iterations in 202 ms. Result :sat
Minimization took 63 ms.
[2024-06-02 20:58:23] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 20:58:23] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 20:58:23] [INFO ] [Real]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-02 20:58:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:23] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-02 20:58:23] [INFO ] [Nat]Added 40 Read/Feed constraints in 14 ms returned sat
[2024-06-02 20:58:23] [INFO ] Computed and/alt/rep : 118/476/118 causal constraints (skipped 146 transitions) in 20 ms.
[2024-06-02 20:58:23] [INFO ] Added : 40 causal constraints over 9 iterations in 157 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA FireWire-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 105 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p92) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 290/290 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 5 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 284
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 5 place count 102 transition count 284
Applied a total of 5 rules in 12 ms. Remains 102 /105 variables (removed 3) and now considering 284/290 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 102/105 places, 284/290 transitions.
[2024-06-02 20:58:23] [INFO ] Flow matrix only has 255 transitions (discarded 29 similar events)
// Phase 1: matrix 255 rows 102 cols
[2024-06-02 20:58:23] [INFO ] Computed 6 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (60800 resets) in 1045 ms. (956 steps per ms)
BEST_FIRST walk for 1000001 steps (15092 resets) in 384 ms. (2597 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 20:58:25] [INFO ] Flow matrix only has 255 transitions (discarded 29 similar events)
[2024-06-02 20:58:25] [INFO ] Invariant cache hit.
[2024-06-02 20:58:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:25] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 20:58:25] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:58:25] [INFO ] [Real]Added 39 Read/Feed constraints in 13 ms returned sat
[2024-06-02 20:58:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 20:58:25] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 20:58:25] [INFO ] [Nat]Added 39 Read/Feed constraints in 20 ms returned sat
[2024-06-02 20:58:25] [INFO ] Computed and/alt/rep : 113/465/113 causal constraints (skipped 140 transitions) in 21 ms.
[2024-06-02 20:58:25] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:58:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-06-02 20:58:25] [INFO ] Added : 38 causal constraints over 9 iterations in 206 ms. Result :sat
Minimization took 67 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 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 284/284 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 102/102 places, 284/284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 284/284 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-06-02 20:58:25] [INFO ] Flow matrix only has 255 transitions (discarded 29 similar events)
[2024-06-02 20:58:25] [INFO ] Invariant cache hit.
[2024-06-02 20:58:25] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:58:25] [INFO ] Flow matrix only has 255 transitions (discarded 29 similar events)
[2024-06-02 20:58:25] [INFO ] Invariant cache hit.
[2024-06-02 20:58:26] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:58:26] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-06-02 20:58:26] [INFO ] Redundant transitions in 16 ms returned []
Running 282 sub problems to find dead transitions.
[2024-06-02 20:58:26] [INFO ] Flow matrix only has 255 transitions (discarded 29 similar events)
[2024-06-02 20:58:26] [INFO ] Invariant cache hit.
[2024-06-02 20:58:26] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 20:58:27] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:58:28] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-06-02 20:58:28] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 20:58:28] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:58:28] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-02 20:58:28] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:58:28] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 255/356 variables, 101/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 20:58:31] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:58:32] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 1/357 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (OVERLAPS) 0/357 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 156 constraints, problems are : Problem set: 0 solved, 282 unsolved in 12648 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 255/356 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 39/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 282/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 20:58:43] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (OVERLAPS) 1/357 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 20:58:54] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/357 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 15 (OVERLAPS) 0/357 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 357/357 variables, and 440 constraints, problems are : Problem set: 0 solved, 282 unsolved in 29102 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 11/11 constraints]
After SMT, in 42001ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 42017ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42264 ms. Remains : 102/102 places, 284/284 transitions.
RANDOM walk for 40000 steps (2380 resets) in 763 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (535 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (624 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
[2024-06-02 20:59:08] [INFO ] Flatten gal took : 118 ms
Finished probabilistic random walk after 1544 steps, run visited all 2 properties in 43 ms. (steps per millisecond=35 )
[2024-06-02 20:59:08] [INFO ] Flatten gal took : 29 ms
Probabilistic random walk after 1544 steps, saw 973 distinct states, run finished after 50 ms. (steps per millisecond=30 ) properties seen :2
[2024-06-02 20:59:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12539622209294348766.gal : 10 ms
[2024-06-02 20:59:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18377840785122805942.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12539622209294348766.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18377840785122805942.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-09-UpperBounds-10 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 59388 ms.

BK_STOP 1717361948774

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

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