Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r252-tall-174915606300582.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is ViralEpidemic-PT-S02D1C1A12, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r252-tall-174915606300582
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 7.3K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 11 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 19M May 29 14:33 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 1749207299286

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ViralEpidemic-PT-S02D1C1A12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-06 10:55:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-06 10:55:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 10:55:01] [INFO ] Load time of PNML (sax parser for PT used): 1080 ms
[2025-06-06 10:55:01] [INFO ] Transformed 32765 places.
[2025-06-06 10:55:01] [INFO ] Transformed 40955 transitions.
[2025-06-06 10:55:01] [INFO ] Found NUPN structural information;
[2025-06-06 10:55:01] [INFO ] Parsed PT model containing 32765 places and 40955 transitions and 90101 arcs in 1398 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 463 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2025-06-06 10:55:12] [INFO ] Invariants computation overflowed in 9687 ms
[2025-06-06 10:55:46] [INFO ] Performed 19761/32765 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-06 10:56:02] [INFO ] Implicit Places using invariants in 60034 ms returned []
Implicit Place search using SMT only with invariants took 60069 ms to find 0 implicit places.
Running 40954 sub problems to find dead transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2025-06-06 10:56:12] [INFO ] Invariants computation overflowed in 8985 ms
SMT process timed out in 181551ms, After SMT, problems are : Problem set: 0 solved, 40954 unsolved
Search for dead transitions found 0 dead transitions in 181934ms
Finished structural reductions in LIVENESS mode , in 1 iterations and 242633 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Discarding 8190 transitions out of 40955. Remains 32765
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (3686 resets) in 44326 ms. (0 steps per ms) remains 32239/32764 properties
BEST_FIRST walk for 124 steps (8 resets) in 155 ms. (0 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 233 ms. (0 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 113 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 117 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 132 ms. (0 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 122 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 121 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 139 ms. (0 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 139 ms. (0 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 111 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 98 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 97 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 99 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 97 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 98 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 97 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 96 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 95 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 94 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 99 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 98 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 97 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 99 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 97 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 95 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 100 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 99 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 98 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 98 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 93 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 98 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 95 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 104 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 127 ms. (0 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 99 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 95 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 101 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 100 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 99 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 101 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 99 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 97 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 102 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 103 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 100 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 97 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 95 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 93 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 93 ms. (1 steps per ms) remains 32239/32239 properties
BEST_FIRST walk for 124 steps (8 resets) in 94 ms. (1 steps per ms) remains 32239/32239 properties
Interrupted probabilistic random walk after 11216 steps, run timeout after 39057 ms. (steps per millisecond=0 ) properties seen :817 out of 32239
Probabilistic random walk after 11216 steps, saw 10829 distinct states, run finished after 39065 ms. (steps per millisecond=0 ) properties seen :817
// Phase 1: matrix 40955 rows 32765 cols
[2025-06-06 11:00:07] [INFO ] Invariants computation overflowed in 9257 ms
SMT process timed out in 120488ms, After SMT, problems are : Problem set: 0 solved, 31422 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31509 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 31798 are kept as prefixes of interest. Removing 967 places using SCC suffix rule.65 ms
Discarding 967 places :
Also discarding 901 output transitions
Drop transitions (Output transitions of discarded places.) removed 901 transitions
Drop transitions (Empty/Sink Transition effects.) removed 489 transitions
Reduce isomorphic transitions removed 489 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 494 rules applied. Total rules applied 495 place count 31798 transition count 39560
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 500 place count 31793 transition count 39560
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 16 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 656 place count 31715 transition count 39482
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 657 place count 31714 transition count 39481
Applied a total of 657 rules in 1340 ms. Remains 31714 /32765 variables (removed 1051) and now considering 39481/40955 (removed 1474) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1345 ms. Remains : 31714/32765 places, 39481/40955 transitions.
RANDOM walk for 381485 steps (602 resets) in 120007 ms. (3 steps per ms) remains 12402/31422 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1036 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1022 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 990 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1010 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1015 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 992 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1014 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 994 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1001 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1007 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1007 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1014 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 989 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1009 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1008 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 997 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1009 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 995 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 999 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1016 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 990 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1024 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1018 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 995 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1021 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1001 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1023 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1000 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4003 steps (8 resets) in 991 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4003 steps (8 resets) in 1028 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 987 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1001 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1017 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 991 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1016 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4003 steps (8 resets) in 1004 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 996 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1010 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 987 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1011 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4003 steps (8 resets) in 1014 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 991 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1007 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4003 steps (8 resets) in 1010 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 999 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1016 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 996 ms. (4 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1017 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4003 steps (8 resets) in 1004 ms. (3 steps per ms) remains 12402/12402 properties
BEST_FIRST walk for 4004 steps (8 resets) in 993 ms. (4 steps per ms) remains 12402/12402 properties
// Phase 1: matrix 39481 rows 31714 cols
[2025-06-06 11:02:52] [INFO ] Computed 116 invariants in 8113 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14098 variables, 14098/14098 constraints. Problems are: Problem set: 0 solved, 12402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 14098/71195 variables, and 14098 constraints, problems are : Problem set: 0 solved, 12402 unsolved in 45317 ms.
Refiners :[Domain max(s): 14098/31714 constraints, Generalized P Invariants (flows): 0/116 constraints, State Equation: 0/31714 constraints, PredecessorRefiner: 12402/12402 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12402 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14098 variables, 14098/14098 constraints. Problems are: Problem set: 0 solved, 12402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 14098/71195 variables, and 14098 constraints, problems are : Problem set: 0 solved, 12402 unsolved in 45135 ms.
Refiners :[Domain max(s): 14098/31714 constraints, Generalized P Invariants (flows): 0/116 constraints, State Equation: 0/31714 constraints, PredecessorRefiner: 0/12402 constraints, Known Traps: 0/0 constraints]
After SMT, in 141470ms problems are : Problem set: 0 solved, 12402 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14098 out of 31714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31714/31714 places, 39481/39481 transitions.
Graph (complete) has 15861 edges and 31714 vertex of which 18881 are kept as prefixes of interest. Removing 12833 places using SCC suffix rule.15 ms
Discarding 12833 places :
Also discarding 10391 output transitions
Drop transitions (Output transitions of discarded places.) removed 10391 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8193 transitions
Reduce isomorphic transitions removed 8193 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 0 with 8373 rules applied. Total rules applied 8374 place count 18881 transition count 20717
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 1 with 180 rules applied. Total rules applied 8554 place count 18701 transition count 20717
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 8554 place count 18701 transition count 20316
Deduced a syphon composed of 401 places in 10 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 9356 place count 18300 transition count 20316
Performed 1627 Post agglomeration using F-continuation condition.Transition count delta: 1627
Deduced a syphon composed of 1627 places in 8 ms
Reduce places removed 1627 places and 0 transitions.
Iterating global reduction 2 with 3254 rules applied. Total rules applied 12610 place count 16673 transition count 18689
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12611 place count 16673 transition count 18688
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12612 place count 16672 transition count 18688
Reduce places removed 49 places and 49 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 12661 place count 16623 transition count 18639
Applied a total of 12661 rules in 4087 ms. Remains 16623 /31714 variables (removed 15091) and now considering 18639/39481 (removed 20842) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4087 ms. Remains : 16623/31714 places, 18639/39481 transitions.
RANDOM walk for 347179 steps (52 resets) in 120004 ms. (2 steps per ms) remains 16/12402 properties
BEST_FIRST walk for 117844 steps (0 resets) in 20298 ms. (5 steps per ms) remains 16/16 properties
BEST_FIRST walk for 137616 steps (3 resets) in 20299 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 129700 steps (1 resets) in 20187 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 138597 steps (3 resets) in 20298 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 139603 steps (3 resets) in 20451 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 139572 steps (3 resets) in 20355 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 133330 steps (3 resets) in 20304 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 129828 steps (1 resets) in 20198 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 105519 steps (0 resets) in 20502 ms. (5 steps per ms) remains 16/16 properties
BEST_FIRST walk for 134352 steps (3 resets) in 20291 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 136581 steps (3 resets) in 20291 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 138407 steps (3 resets) in 20271 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 138495 steps (3 resets) in 20235 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 140430 steps (3 resets) in 20456 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 139296 steps (3 resets) in 20305 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 140506 steps (3 resets) in 20410 ms. (6 steps per ms) remains 16/16 properties
// Phase 1: matrix 18639 rows 16623 cols
[2025-06-06 11:07:03] [INFO ] Computed 1540 invariants in 1874 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 221/239 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 221/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 289/528 variables, 239/483 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/532 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 10/542 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 16/558 variables, 6/499 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/558 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 17/575 variables, 8/513 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/575 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 22/597 variables, 8/529 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/597 variables, 8/537 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/597 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 22/619 variables, 10/547 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/619 variables, 10/557 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/619 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (OVERLAPS) 16/635 variables, 8/565 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/635 variables, 8/573 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/635 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 28 (OVERLAPS) 4/639 variables, 4/577 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/639 variables, 4/581 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/639 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 31 (OVERLAPS) 0/639 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/35262 variables, and 581 constraints, problems are : Problem set: 0 solved, 16 unsolved in 7649 ms.
Refiners :[Domain max(s): 288/16623 constraints, Generalized P Invariants (flows): 5/1540 constraints, State Equation: 288/16623 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 221/239 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 221/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 289/528 variables, 239/483 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 16/499 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 4/532 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 10/542 variables, 4/505 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 16/558 variables, 6/515 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/558 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 17/575 variables, 8/529 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/575 variables, 8/537 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/575 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 22/597 variables, 8/545 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/597 variables, 8/553 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/597 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (OVERLAPS) 22/619 variables, 10/563 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/619 variables, 10/573 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/619 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 26 (OVERLAPS) 16/635 variables, 8/581 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/635 variables, 8/589 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/635 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 29 (OVERLAPS) 4/639 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/639 variables, 4/597 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/639 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 32 (OVERLAPS) 0/639 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 639/35262 variables, and 597 constraints, problems are : Problem set: 0 solved, 16 unsolved in 8534 ms.
Refiners :[Domain max(s): 288/16623 constraints, Generalized P Invariants (flows): 5/1540 constraints, State Equation: 288/16623 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 18191ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 1 different solutions.
Finished Parikh walk after 51 steps, including 0 resets, run visited all 16 properties in 14 ms. (steps per millisecond=3 )
Parikh walk visited 16 properties in 29 ms.
Able to resolve query QuasiLiveness after proving 32765 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 739485 ms.
ITS solved all properties within timeout

BK_STOP 1749208040087

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="ViralEpidemic-PT-S02D1C1A12"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is ViralEpidemic-PT-S02D1C1A12, 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 r252-tall-174915606300582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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