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.r399-tall-171690531200823.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 Szymanski-PT-a04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531200823
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 11 15:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 15:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 11 15:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 101K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-00
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-01
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-02
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-03
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-04
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-05
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-06
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-07
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-08
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-09
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-10
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-11
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-12
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-13
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-14
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717092590058

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 18:09:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 18:09:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 18:09:51] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-30 18:09:51] [INFO ] Transformed 61 places.
[2024-05-30 18:09:51] [INFO ] Transformed 224 transitions.
[2024-05-30 18:09:51] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40003 steps (55 resets) in 1227 ms. (32 steps per ms) remains 13/15 properties
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (29 resets) in 209 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1036 ms. (38 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (31 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 192 ms. (207 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (11 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (28 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (73 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
[2024-05-30 18:09:53] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2024-05-30 18:09:53] [INFO ] Computed 3 invariants in 11 ms
[2024-05-30 18:09:53] [INFO ] State equation strengthened by 9 read => feed constraints.
Problem Szymanski-PT-a04-ReachabilityFireability-2024-03 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem Szymanski-PT-a04-ReachabilityFireability-2024-01 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-02 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-05 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-07 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-09 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-10 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-13 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-15 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 3/48 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 1/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 79/128 variables, 49/52 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 9/61 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/61 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/61 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 61 constraints, problems are : Problem set: 9 solved, 4 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/48 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-05-30 18:09:53] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 1/4 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 79/128 variables, 49/53 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 9/62 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 4/66 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 66 constraints, problems are : Problem set: 9 solved, 4 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 1241ms problems are : Problem set: 9 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 37 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 251 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 47 transition count 200
Applied a total of 17 rules in 31 ms. Remains 47 /49 variables (removed 2) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 47/49 places, 200/216 transitions.
RANDOM walk for 40005 steps (63 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (29 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (29 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (27 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 2179367 steps, run timeout after 3001 ms. (steps per millisecond=726 ) properties seen :3 out of 4
Probabilistic random walk after 2179367 steps, saw 1151569 distinct states, run finished after 3006 ms. (steps per millisecond=725 ) properties seen :3
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-30 18:09:57] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 47 cols
[2024-05-30 18:09:57] [INFO ] Computed 1 invariants in 3 ms
[2024-05-30 18:09:57] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/122 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 57 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/122 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 58 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 373ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 200/200 transitions.
Applied a total of 0 rules in 13 ms. Remains 47 /47 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 47/47 places, 200/200 transitions.
RANDOM walk for 40004 steps (54 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2273752 steps, run timeout after 3001 ms. (steps per millisecond=757 ) properties seen :0 out of 1
Probabilistic random walk after 2273752 steps, saw 1203484 distinct states, run finished after 3001 ms. (steps per millisecond=757 ) properties seen :0
[2024-05-30 18:10:01] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2024-05-30 18:10:01] [INFO ] Invariant cache hit.
[2024-05-30 18:10:01] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/122 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 57 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/122 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 58 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 236ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 47 /47 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 47/47 places, 200/200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-30 18:10:01] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2024-05-30 18:10:01] [INFO ] Invariant cache hit.
[2024-05-30 18:10:01] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 18:10:01] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2024-05-30 18:10:01] [INFO ] Invariant cache hit.
[2024-05-30 18:10:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 18:10:01] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-30 18:10:01] [INFO ] Redundant transitions in 7 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-30 18:10:01] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2024-05-30 18:10:01] [INFO ] Invariant cache hit.
[2024-05-30 18:10:01] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 75/122 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 57 constraints, problems are : Problem set: 0 solved, 198 unsolved in 2428 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 75/122 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 198/255 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 255 constraints, problems are : Problem set: 0 solved, 198 unsolved in 3478 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 6016ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 6019ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6181 ms. Remains : 47/47 places, 200/200 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 47 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 127 place count 46 transition count 74
Applied a total of 127 rules in 11 ms. Remains 46 /47 variables (removed 1) and now considering 74/200 (removed 126) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 74 rows 46 cols
[2024-05-30 18:10:07] [INFO ] Computed 1 invariants in 3 ms
[2024-05-30 18:10:07] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-30 18:10:07] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 18:10:07] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 18:10:07] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 18:10:07] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 18:10:07] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 198 ms.
[2024-05-30 18:10:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-30 18:10:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 47 places, 200 transitions and 796 arcs took 5 ms.
[2024-05-30 18:10:07] [INFO ] Flatten gal took : 41 ms
Total runtime 16597 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Szymanski-PT-a04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 47
TRANSITIONS: 200
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.001s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 582
MODEL NAME: /home/mcc/execution/415/model
47 places, 200 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-08 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717093307903

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="Szymanski-PT-a04"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Szymanski-PT-a04, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690531200823"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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