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.r342-tall-171679093200259.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 greatspnxred
Input is SafeBus-PT-03, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r342-tall-171679093200259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 8.5K Apr 12 14:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 14:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 14:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 14:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 14:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 12 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 154K Apr 12 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 95K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716818505135

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 14:01:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-27 14:01:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 14:01:46] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-27 14:01:46] [INFO ] Transformed 57 places.
[2024-05-27 14:01:46] [INFO ] Transformed 91 transitions.
[2024-05-27 14:01:46] [INFO ] Found NUPN structural information;
[2024-05-27 14:01:46] [INFO ] Parsed PT model containing 57 places and 91 transitions and 541 arcs in 159 ms.
Reduce places removed 3 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.15889KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 54/54 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 16 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 29 ms. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 54/54 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-27 14:01:46] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-27 14:01:46] [INFO ] Computed 17 invariants in 9 ms
[2024-05-27 14:01:46] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-27 14:01:46] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-05-27 14:01:46] [INFO ] Invariant cache hit.
[2024-05-27 14:01:46] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:01:46] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-27 14:01:46] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-27 14:01:46] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-05-27 14:01:46] [INFO ] Invariant cache hit.
[2024-05-27 14:01:46] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 14:01:47] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 9 ms to minimize.
[2024-05-27 14:01:47] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-27 14:01:47] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-27 14:01:47] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-27 14:01:47] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-27 14:01:47] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-27 14:01:47] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-27 14:01:47] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-27 14:01:47] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-27 14:01:47] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 10/81 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 14:01:48] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-27 14:01:48] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/83 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 14:01:48] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/84 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 14:01:48] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 68/122 variables, 54/139 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 13/152 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/152 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/152 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 152 constraints, problems are : Problem set: 9 solved, 79 unsolved in 2873 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 9 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 14/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 14:01:50] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-27 14:01:50] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-27 14:01:50] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-27 14:01:50] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/89 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/89 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 68/122 variables, 54/143 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 13/156 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 79/235 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/235 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/235 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 235 constraints, problems are : Problem set: 9 solved, 79 unsolved in 2497 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/88 constraints, Known Traps: 18/18 constraints]
After SMT, in 5492ms problems are : Problem set: 9 solved, 79 unsolved
Search for dead transitions found 9 dead transitions in 5504ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 54/54 places, 82/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:01:52] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 5822 ms. Remains : 54/54 places, 82/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1290 ms (no deadlock found). (steps per millisecond=968 )
Random directed walk for 1250000 steps, including 0 resets, run took 892 ms (no deadlock found). (steps per millisecond=1401 )
[2024-05-27 14:01:54] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-27 14:01:54] [INFO ] Computed 17 invariants in 6 ms
[2024-05-27 14:01:54] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-27 14:01:54] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 15 ms returned sat
[2024-05-27 14:01:54] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-27 14:01:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:01:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-27 14:01:54] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-27 14:01:54] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-27 14:01:54] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:01:54] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-05-27 14:01:54] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-27 14:01:54] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-27 14:01:54] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-27 14:01:54] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-27 14:01:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 169 ms
[2024-05-27 14:01:54] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 5 ms.
[2024-05-27 14:01:55] [INFO ] Added : 34 causal constraints over 7 iterations in 113 ms. Result :sat
Parikh directed walk for 10500 steps, including 927 resets, run took 33 ms. (steps per millisecond=318 )
Random directed walk for 500002 steps, including 0 resets, run took 401 ms (no deadlock found). (steps per millisecond=1246 )
Random walk for 500000 steps, including 0 resets, run took 432 ms (no deadlock found). (steps per millisecond=1157 )
Random directed walk for 500002 steps, including 0 resets, run took 328 ms (no deadlock found). (steps per millisecond=1524 )
Random walk for 500000 steps, including 0 resets, run took 431 ms (no deadlock found). (steps per millisecond=1160 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 54/54 places, 82/82 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:01:56] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:01:56] [INFO ] Invariant cache hit.
[2024-05-27 14:01:56] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-27 14:01:56] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:01:56] [INFO ] Invariant cache hit.
[2024-05-27 14:01:56] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:01:56] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-27 14:01:56] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-27 14:01:56] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:01:56] [INFO ] Invariant cache hit.
[2024-05-27 14:01:56] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 2 ms to minimize.
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-27 14:01:57] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 68/122 variables, 54/140 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 153 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2497 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:01:59] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-27 14:01:59] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 68/122 variables, 54/142 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 79/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 234 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1890 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 17/17 constraints]
After SMT, in 4427ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4429ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 4544 ms. Remains : 54/54 places, 82/82 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1089 ms (no deadlock found). (steps per millisecond=1147 )
Random directed walk for 1250000 steps, including 0 resets, run took 819 ms (no deadlock found). (steps per millisecond=1526 )
[2024-05-27 14:02:03] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:02:03] [INFO ] Invariant cache hit.
[2024-05-27 14:02:03] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-27 14:02:03] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 24 ms returned sat
[2024-05-27 14:02:03] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-27 14:02:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:02:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-27 14:02:03] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-27 14:02:03] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-27 14:02:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:02:03] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-27 14:02:03] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-27 14:02:03] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-27 14:02:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2024-05-27 14:02:03] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 4 ms.
[2024-05-27 14:02:03] [INFO ] Added : 23 causal constraints over 5 iterations in 48 ms. Result :sat
Parikh directed walk for 4800 steps, including 394 resets, run took 11 ms. (steps per millisecond=436 )
Random directed walk for 500001 steps, including 0 resets, run took 330 ms (no deadlock found). (steps per millisecond=1515 )
Random walk for 500000 steps, including 0 resets, run took 452 ms (no deadlock found). (steps per millisecond=1106 )
Random directed walk for 500000 steps, including 0 resets, run took 330 ms (no deadlock found). (steps per millisecond=1515 )
Random walk for 500000 steps, including 0 resets, run took 430 ms (no deadlock found). (steps per millisecond=1162 )
[2024-05-27 14:02:05] [INFO ] Flatten gal took : 59 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 57/57 places, 91/91 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 54 transition count 91
Applied a total of 3 rules in 5 ms. Remains 54 /57 variables (removed 3) and now considering 91/91 (removed 0) transitions.
[2024-05-27 14:02:05] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-27 14:02:05] [INFO ] Computed 17 invariants in 1 ms
[2024-05-27 14:02:05] [INFO ] Implicit Places using invariants in 125 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 128 ms to find 3 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 51/57 places, 91/91 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 88
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 88
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 45 transition count 91
Applied a total of 12 rules in 7 ms. Remains 45 /51 variables (removed 6) and now considering 91/91 (removed 0) transitions.
[2024-05-27 14:02:05] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 45 cols
[2024-05-27 14:02:05] [INFO ] Computed 14 invariants in 2 ms
[2024-05-27 14:02:05] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-27 14:02:05] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-05-27 14:02:05] [INFO ] Invariant cache hit.
[2024-05-27 14:02:05] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:02:05] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 45/57 places, 91/91 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 594 ms. Remains : 45/57 places, 91/91 transitions.
Discarding 9 transitions out of 91. Remains 82
Initial state reduction rules removed 3 formulas.
RANDOM walk for 40000 steps (8 resets) in 1602 ms. (24 steps per ms) remains 9/79 properties
BEST_FIRST walk for 40003 steps (8 resets) in 435 ms. (91 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 108 ms. (366 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
[2024-05-27 14:02:07] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-05-27 14:02:07] [INFO ] Invariant cache hit.
[2024-05-27 14:02:07] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 13/29 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem qltransition_7 is UNSAT
SMT process timed out in 102ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 45/45 places, 91/91 transitions.
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 21033 ms.
ITS solved all properties within timeout

BK_STOP 1716818527802

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-PT-03"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 greatspnxred"
echo " Input is SafeBus-PT-03, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r342-tall-171679093200259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-03.tgz
mv SafeBus-PT-03 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;