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.r188-tall-171640615800037.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 FlexibleBarrier-PT-10b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-tall-171640615800037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 748K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 07:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 07:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 374K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716472385233

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FlexibleBarrier-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 13:53:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-23 13:53:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 13:53:06] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-23 13:53:06] [INFO ] Transformed 1402 places.
[2024-05-23 13:53:06] [INFO ] Transformed 1613 transitions.
[2024-05-23 13:53:06] [INFO ] Found NUPN structural information;
[2024-05-23 13:53:06] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 239 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 1370 edges and 1402 vertex of which 62 / 1402 are part of one of the 10 SCC in 10 ms
Free SCC test removed 52 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 360 place count 1350 transition count 1201
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 719 place count 991 transition count 1201
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 719 place count 991 transition count 1111
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 899 place count 901 transition count 1111
Performed 575 Post agglomeration using F-continuation condition.Transition count delta: 575
Deduced a syphon composed of 575 places in 0 ms
Reduce places removed 575 places and 0 transitions.
Iterating global reduction 2 with 1150 rules applied. Total rules applied 2049 place count 326 transition count 536
Applied a total of 2049 rules in 151 ms. Remains 326 /1402 variables (removed 1076) and now considering 536/1613 (removed 1077) transitions.
[2024-05-23 13:53:06] [INFO ] Flow matrix only has 507 transitions (discarded 29 similar events)
// Phase 1: matrix 507 rows 326 cols
[2024-05-23 13:53:06] [INFO ] Computed 12 invariants in 25 ms
[2024-05-23 13:53:07] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-23 13:53:07] [INFO ] Flow matrix only has 507 transitions (discarded 29 similar events)
[2024-05-23 13:53:07] [INFO ] Invariant cache hit.
[2024-05-23 13:53:07] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-23 13:53:07] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
Running 535 sub problems to find dead transitions.
[2024-05-23 13:53:07] [INFO ] Flow matrix only has 507 transitions (discarded 29 similar events)
[2024-05-23 13:53:07] [INFO ] Invariant cache hit.
[2024-05-23 13:53:07] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 325/325 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 12/337 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 506/832 variables, 326/664 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 60/724 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 8 (OVERLAPS) 1/833 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 833/833 variables, and 725 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30029 ms.
Refiners :[Domain max(s): 326/326 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 326/326 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 325/325 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 12/337 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 506/832 variables, 326/664 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 60/724 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 535/1259 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 0/1259 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 9 (OVERLAPS) 1/833 variables, 1/1260 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 833/833 variables, and 1260 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30030 ms.
Refiners :[Domain max(s): 326/326 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 326/326 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
After SMT, in 60870ms problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60897ms
Starting structural reductions in LIVENESS mode, iteration 1 : 326/1402 places, 536/1613 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 62063 ms. Remains : 326/1402 places, 536/1613 transitions.
Discarding 303 transitions out of 536. Remains 233
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2562 resets) in 3407 ms. (11 steps per ms) remains 182/232 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
[2024-05-23 13:54:09] [INFO ] Flow matrix only has 507 transitions (discarded 29 similar events)
[2024-05-23 13:54:09] [INFO ] Invariant cache hit.
[2024-05-23 13:54:09] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 274/274 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 52/326 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 52/338 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 506/832 variables, 326/664 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 60/724 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/833 variables, and 724 constraints, problems are : Problem set: 0 solved, 182 unsolved in 5020 ms.
Refiners :[Domain max(s): 326/326 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 326/326 constraints, ReadFeed: 60/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 274/274 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 52/326 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 52/338 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 506/832 variables, 326/664 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 60/724 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 182/906 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/833 variables, and 906 constraints, problems are : Problem set: 0 solved, 182 unsolved in 5013 ms.
Refiners :[Domain max(s): 326/326 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 326/326 constraints, ReadFeed: 60/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 10192ms problems are : Problem set: 0 solved, 182 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 274 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 536/536 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 326 transition count 506
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 50 place count 326 transition count 486
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 70 place count 306 transition count 486
Applied a total of 70 rules in 79 ms. Remains 306 /326 variables (removed 20) and now considering 486/536 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 306/326 places, 486/536 transitions.
RANDOM walk for 4000000 steps (283245 resets) in 44029 ms. (90 steps per ms) remains 23/182 properties
BEST_FIRST walk for 400004 steps (207 resets) in 640 ms. (624 steps per ms) remains 21/23 properties
BEST_FIRST walk for 400004 steps (208 resets) in 645 ms. (619 steps per ms) remains 20/21 properties
BEST_FIRST walk for 400004 steps (208 resets) in 251 ms. (1587 steps per ms) remains 18/20 properties
BEST_FIRST walk for 400004 steps (317 resets) in 252 ms. (1581 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (317 resets) in 171 ms. (2325 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (313 resets) in 156 ms. (2547 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (316 resets) in 172 ms. (2312 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (315 resets) in 170 ms. (2339 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (316 resets) in 159 ms. (2500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (317 resets) in 160 ms. (2484 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (317 resets) in 161 ms. (2469 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (315 resets) in 162 ms. (2454 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (316 resets) in 158 ms. (2515 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (313 resets) in 161 ms. (2469 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (314 resets) in 155 ms. (2564 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (316 resets) in 153 ms. (2597 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (315 resets) in 154 ms. (2580 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (316 resets) in 154 ms. (2580 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (312 resets) in 158 ms. (2515 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (318 resets) in 157 ms. (2531 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (314 resets) in 157 ms. (2531 steps per ms) remains 18/18 properties
// Phase 1: matrix 486 rows 306 cols
[2024-05-23 13:54:32] [INFO ] Computed 12 invariants in 5 ms
[2024-05-23 13:54:32] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 205/224 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 82/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 82/318 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 486/792 variables, 306/624 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 70/694 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/792 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/792 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 792/792 variables, and 694 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1165 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 306/306 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 205/224 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 82/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 82/318 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 486/792 variables, 306/624 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 70/694 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/792 variables, 18/712 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/792 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/792 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 792/792 variables, and 712 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1149 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 306/306 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 2338ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Finished Parikh walk after 7338 steps, including 174 resets, run visited all 6 properties in 91 ms. (steps per millisecond=80 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 18 properties in 166 ms.
Able to resolve query QuasiLiveness after proving 233 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 89064 ms.
ITS solved all properties within timeout

BK_STOP 1716472475465

--------------------
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 QuasiLiveness -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="FlexibleBarrier-PT-10b"
export BK_EXAMINATION="QuasiLiveness"
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 FlexibleBarrier-PT-10b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r188-tall-171640615800037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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