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.r333-tall-171679078500447.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SafeBus-PT-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078500447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 20K Apr 12 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 12 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.3M Apr 12 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 42K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 740K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.2M Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 52K Apr 12 20:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 332K Apr 12 20:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6M Apr 12 20:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 12 20:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.8K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 7.8M 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 SafeBus-PT-20-ReachabilityFireability-2024-00
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-01
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-02
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-03
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-04
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-05
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-06
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-07
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-08
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-09
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-10
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-11
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-12
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-13
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-14
FORMULA_NAME SafeBus-PT-20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716864832269

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:53:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 02:53:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:53:54] [INFO ] Load time of PNML (sax parser for PT used): 437 ms
[2024-05-28 02:53:54] [INFO ] Transformed 1026 places.
[2024-05-28 02:53:54] [INFO ] Transformed 10461 transitions.
[2024-05-28 02:53:54] [INFO ] Found NUPN structural information;
[2024-05-28 02:53:54] [INFO ] Parsed PT model containing 1026 places and 10461 transitions and 77364 arcs in 615 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 227 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 20 places and 0 transitions.
RANDOM walk for 40000 steps (8 resets) in 11810 ms. (3 steps per ms) remains 5/16 properties
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 24931 steps (4 resets) in 20019 ms. (1 steps per ms) remains 4/5 properties
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 3328 ms. (12 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3852 ms. (10 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 3218 ms. (12 steps per ms) remains 4/4 properties
[2024-05-28 02:54:06] [INFO ] Flow matrix only has 2482 transitions (discarded 7979 similar events)
// Phase 1: matrix 2482 rows 1006 cols
[2024-05-28 02:54:06] [INFO ] Computed 85 invariants in 162 ms
[2024-05-28 02:54:06] [INFO ] State equation strengthened by 421 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/926 variables, 926/926 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/926 variables, 3/929 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem SafeBus-PT-20-ReachabilityFireability-2024-13 is UNSAT
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/926 variables, 40/969 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/926 variables, 0/969 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 984/3488 variables, and 1009 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5104 ms.
Refiners :[Domain max(s): 926/1006 constraints, Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 40/41 constraints, State Equation: 0/1006 constraints, ReadFeed: 0/421 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Problem SafeBus-PT-20-ReachabilityFireability-2024-00 is UNSAT
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/925 variables, 925/925 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/925 variables, 3/928 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem SafeBus-PT-20-ReachabilityFireability-2024-10 is UNSAT
FORMULA SafeBus-PT-20-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/925 variables, 40/968 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/925 variables, 0/968 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/983 variables, 40/1008 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/983 variables, 58/1066 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/983 variables, 0/1066 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/1004 variables, 1/1067 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1004 variables, 21/1088 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-28 02:54:34] [INFO ] Deduced a trap composed of 116 places in 842 ms of which 56 ms to minimize.
[2024-05-28 02:54:34] [INFO ] Deduced a trap composed of 99 places in 739 ms of which 13 ms to minimize.
[2024-05-28 02:54:35] [INFO ] Deduced a trap composed of 118 places in 713 ms of which 5 ms to minimize.
[2024-05-28 02:54:36] [INFO ] Deduced a trap composed of 99 places in 743 ms of which 5 ms to minimize.
SMT process timed out in 30118ms, After SMT, problems are : Problem set: 3 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 10461/10461 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 1006 transition count 10442
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 987 transition count 10442
Applied a total of 38 rules in 10019 ms. Remains 987 /1006 variables (removed 19) and now considering 10442/10461 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10041 ms. Remains : 987/1006 places, 10442/10461 transitions.
RANDOM walk for 40000 steps (8 resets) in 1879 ms. (21 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 649 ms. (61 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 56361 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 56361 steps, saw 38912 distinct states, run finished after 3006 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-28 02:54:50] [INFO ] Flow matrix only has 2463 transitions (discarded 7979 similar events)
// Phase 1: matrix 2463 rows 987 cols
[2024-05-28 02:54:50] [INFO ] Computed 85 invariants in 102 ms
[2024-05-28 02:54:50] [INFO ] State equation strengthened by 421 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 660/693 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 660/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 10/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 247/940 variables, 27/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 247/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 6/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 45/985 variables, 25/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/985 variables, 45/1069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/985 variables, 0/1069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2462/3447 variables, 985/2054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3447 variables, 420/2474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3447 variables, 0/2474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/3450 variables, 2/2476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3450 variables, 2/2478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3450 variables, 1/2479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3450 variables, 1/2480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3450 variables, 0/2480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/3450 variables, 0/2480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3450/3450 variables, and 2480 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1653 ms.
Refiners :[Domain max(s): 987/987 constraints, Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 987/987 constraints, ReadFeed: 421/421 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 660/693 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 660/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 10/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 247/940 variables, 27/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 247/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 6/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 45/985 variables, 25/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/985 variables, 45/1069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/985 variables, 0/1069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2462/3447 variables, 985/2054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3447 variables, 420/2474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3447 variables, 0/2474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/3450 variables, 2/2476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3450 variables, 2/2478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3450 variables, 1/2479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3450 variables, 1/2480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3450 variables, 0/2480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/3450 variables, 0/2480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3450/3450 variables, and 2480 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3255 ms.
Refiners :[Domain max(s): 987/987 constraints, Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 987/987 constraints, ReadFeed: 421/421 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5237ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 150 ms.
Support contains 33 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 10442/10442 transitions.
Applied a total of 0 rules in 4667 ms. Remains 987 /987 variables (removed 0) and now considering 10442/10442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4667 ms. Remains : 987/987 places, 10442/10442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 10442/10442 transitions.
Applied a total of 0 rules in 4985 ms. Remains 987 /987 variables (removed 0) and now considering 10442/10442 (removed 0) transitions.
[2024-05-28 02:55:05] [INFO ] Flow matrix only has 2463 transitions (discarded 7979 similar events)
[2024-05-28 02:55:05] [INFO ] Invariant cache hit.
[2024-05-28 02:55:13] [INFO ] Implicit Places using invariants in 8051 ms returned [926, 927, 928, 929, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 8075 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 968/987 places, 10442/10442 transitions.
Applied a total of 0 rules in 4987 ms. Remains 968 /968 variables (removed 0) and now considering 10442/10442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18050 ms. Remains : 968/987 places, 10442/10442 transitions.
RANDOM walk for 40000 steps (8 resets) in 1782 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 58409 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 1
Probabilistic random walk after 58409 steps, saw 40280 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-28 02:55:22] [INFO ] Flow matrix only has 2463 transitions (discarded 7979 similar events)
// Phase 1: matrix 2463 rows 968 cols
[2024-05-28 02:55:22] [INFO ] Computed 66 invariants in 31 ms
[2024-05-28 02:55:22] [INFO ] State equation strengthened by 421 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 457/490 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 457/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 286/776 variables, 38/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 286/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/776 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 190/966 variables, 10/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 190/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2462/3428 variables, 966/1997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3428 variables, 420/2417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3428 variables, 0/2417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/3431 variables, 2/2419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3431 variables, 2/2421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3431 variables, 1/2422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3431 variables, 1/2423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3431 variables, 0/2423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/3431 variables, 0/2423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3431/3431 variables, and 2423 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1689 ms.
Refiners :[Domain max(s): 968/968 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 968/968 constraints, ReadFeed: 421/421 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 457/490 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 457/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 286/776 variables, 38/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 286/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 02:55:25] [INFO ] Deduced a trap composed of 63 places in 1174 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/776 variables, 1/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/776 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 190/966 variables, 10/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 190/1032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2462/3428 variables, 966/1998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3428 variables, 420/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3428 variables, 0/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/3431 variables, 2/2420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3431 variables, 2/2422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3431 variables, 1/2423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3431 variables, 1/2424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3431 variables, 0/2424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/3431 variables, 0/2424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3431/3431 variables, and 2424 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5776 ms.
Refiners :[Domain max(s): 968/968 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 968/968 constraints, ReadFeed: 421/421 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints]
After SMT, in 7702ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 33 out of 968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 10442/10442 transitions.
Applied a total of 0 rules in 5150 ms. Remains 968 /968 variables (removed 0) and now considering 10442/10442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5152 ms. Remains : 968/968 places, 10442/10442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 10442/10442 transitions.
Applied a total of 0 rules in 5007 ms. Remains 968 /968 variables (removed 0) and now considering 10442/10442 (removed 0) transitions.
[2024-05-28 02:55:40] [INFO ] Flow matrix only has 2463 transitions (discarded 7979 similar events)
[2024-05-28 02:55:40] [INFO ] Invariant cache hit.
[2024-05-28 02:55:47] [INFO ] Implicit Places using invariants in 7349 ms returned []
Implicit Place search using SMT only with invariants took 7350 ms to find 0 implicit places.
Running 10422 sub problems to find dead transitions.
[2024-05-28 02:55:47] [INFO ] Flow matrix only has 2463 transitions (discarded 7979 similar events)
[2024-05-28 02:55:47] [INFO ] Invariant cache hit.
[2024-05-28 02:55:47] [INFO ] State equation strengthened by 421 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-PT-20

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 1026
TRANSITIONS: 10461
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 77364
NUPN UNITS: 68
LOADING TIME: 38.31

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.256
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 39.335
OK.
----------------------------------------------------------------------
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: 620
MODEL NAME: /home/mcc/execution/model
1026 places, 10461 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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.

BK_TIME_CONFINEMENT_REACHED

--------------------
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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-PT-20"
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 SafeBus-PT-20, 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 r333-tall-171679078500447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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