Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397700191.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V20P10N20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397700191
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 16K Apr 13 02:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 02:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 119K Apr 13 02:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 469K Apr 13 02:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.3K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 54K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 157K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 13 02:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 02:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 261K Apr 13 02:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 13 02:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 782K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716284926940

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:48:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 09:48:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:48:49] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-05-21 09:48:49] [INFO ] Transformed 78 places.
[2024-05-21 09:48:49] [INFO ] Transformed 968 transitions.
[2024-05-21 09:48:49] [INFO ] Parsed PT model containing 78 places and 968 transitions and 7350 arcs in 409 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 128 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (228 resets) in 4584 ms. (8 steps per ms) remains 10/13 properties
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (90 resets) in 2095 ms. (19 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (68 resets) in 5180 ms. (7 steps per ms) remains 9/10 properties
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (76 resets) in 1262 ms. (31 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (84 resets) in 313 ms. (127 steps per ms) remains 8/9 properties
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (83 resets) in 1605 ms. (24 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (84 resets) in 323 ms. (123 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (85 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (76 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (88 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
[2024-05-21 09:48:54] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2024-05-21 09:48:54] [INFO ] Computed 7 invariants in 14 ms
[2024-05-21 09:48:54] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-00 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-15 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 170/248 variables, 78/85 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 42/127 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/127 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/248 variables, 0/127 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 127 constraints, problems are : Problem set: 3 solved, 5 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 170/248 variables, 78/85 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 42/127 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 5/132 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/132 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/248 variables, 0/132 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 132 constraints, problems are : Problem set: 3 solved, 5 unsolved in 3286 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 4686ms problems are : Problem set: 3 solved, 5 unsolved
Parikh walk visited 0 properties in 1891 ms.
Support contains 75 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 642 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 100 ms. Remains 76 /78 variables (removed 2) and now considering 968/968 (removed 0) transitions.
Running 965 sub problems to find dead transitions.
[2024-05-21 09:49:01] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2024-05-21 09:49:01] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 09:49:01] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 965 unsolved
[2024-05-21 09:49:06] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 10 ms to minimize.
[2024-05-21 09:49:09] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
Problem TDEAD528 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD927 is UNSAT
[2024-05-21 09:49:11] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD507 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 3 (OVERLAPS) 170/246 variables, 76/84 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 42/126 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/126 constraints. Problems are: Problem set: 42 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 246/246 variables, and 126 constraints, problems are : Problem set: 42 solved, 923 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 76/76 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 965/965 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 42 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 170/246 variables, 76/84 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 42/126 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 923/1049 constraints. Problems are: Problem set: 42 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 1049 constraints, problems are : Problem set: 42 solved, 923 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 76/76 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 923/965 constraints, Known Traps: 3/3 constraints]
After SMT, in 43420ms problems are : Problem set: 42 solved, 923 unsolved
Search for dead transitions found 42 dead transitions in 43432ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 76/78 places, 926/968 transitions.
Applied a total of 0 rules in 51 ms. Remains 76 /76 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43609 ms. Remains : 76/78 places, 926/968 transitions.
RANDOM walk for 40000 steps (228 resets) in 771 ms. (51 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (76 resets) in 2498 ms. (16 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (87 resets) in 372 ms. (107 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (82 resets) in 384 ms. (103 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (83 resets) in 336 ms. (118 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (76 resets) in 298 ms. (133 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 182168 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 5
Probabilistic random walk after 182168 steps, saw 48834 distinct states, run finished after 3018 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-21 09:49:49] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 76 cols
[2024-05-21 09:49:49] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 09:49:49] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 166/242 variables, 76/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 123 constraints, problems are : Problem set: 0 solved, 5 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 166/242 variables, 76/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 128 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3633 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 4645ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2937 ms.
Support contains 75 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 926/926 transitions.
Applied a total of 0 rules in 82 ms. Remains 76 /76 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 76/76 places, 926/926 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 926/926 transitions.
Applied a total of 0 rules in 69 ms. Remains 76 /76 variables (removed 0) and now considering 926/926 (removed 0) transitions.
[2024-05-21 09:49:57] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 09:49:57] [INFO ] Invariant cache hit.
[2024-05-21 09:49:58] [INFO ] Implicit Places using invariants in 1205 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1224 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 75/76 places, 926/926 transitions.
Applied a total of 0 rules in 35 ms. Remains 75 /75 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1340 ms. Remains : 75/76 places, 926/926 transitions.
RANDOM walk for 40000 steps (228 resets) in 587 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (76 resets) in 2153 ms. (18 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (86 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (83 resets) in 319 ms. (125 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (83 resets) in 288 ms. (138 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (76 resets) in 268 ms. (148 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 148901 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 5
Probabilistic random walk after 148901 steps, saw 41462 distinct states, run finished after 3014 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-21 09:50:02] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 75 cols
[2024-05-21 09:50:02] [INFO ] Computed 6 invariants in 7 ms
[2024-05-21 09:50:02] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 166/241 variables, 75/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 121 constraints, problems are : Problem set: 0 solved, 5 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 166/241 variables, 75/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/241 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 126 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3288 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 3965ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1411 ms.
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 926/926 transitions.
Applied a total of 0 rules in 94 ms. Remains 75 /75 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 75/75 places, 926/926 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 926/926 transitions.
Applied a total of 0 rules in 62 ms. Remains 75 /75 variables (removed 0) and now considering 926/926 (removed 0) transitions.
[2024-05-21 09:50:08] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 09:50:08] [INFO ] Invariant cache hit.
[2024-05-21 09:50:08] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 09:50:08] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 09:50:08] [INFO ] Invariant cache hit.
[2024-05-21 09:50:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 09:50:08] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-21 09:50:08] [INFO ] Redundant transitions in 60 ms returned []
Running 923 sub problems to find dead transitions.
[2024-05-21 09:50:08] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 09:50:08] [INFO ] Invariant cache hit.
[2024-05-21 09:50:08] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 09:50:14] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 166/241 variables, 75/82 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (OVERLAPS) 0/241 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 923 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 122 constraints, problems are : Problem set: 0 solved, 923 unsolved in 28649 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 166/241 variables, 75/82 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 923/1045 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 241/241 variables, and 1045 constraints, problems are : Problem set: 0 solved, 923 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 1/1 constraints]
After SMT, in 61627ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 61638ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61959 ms. Remains : 75/75 places, 926/926 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 760 transitions
Reduce isomorphic transitions removed 760 transitions.
Iterating post reduction 0 with 760 rules applied. Total rules applied 760 place count 75 transition count 166
Applied a total of 760 rules in 25 ms. Remains 75 /75 variables (removed 0) and now considering 166/926 (removed 760) transitions.
Running SMT prover for 5 properties.
[2024-05-21 09:51:10] [INFO ] Invariant cache hit.
[2024-05-21 09:51:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 09:51:10] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 09:51:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 09:51:11] [INFO ] After 1265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-21 09:51:13] [INFO ] After 2521ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-21 09:51:14] [INFO ] After 3809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 4144 ms.
[2024-05-21 09:51:14] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 12 ms.
[2024-05-21 09:51:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 75 places, 926 transitions and 6980 arcs took 12 ms.
[2024-05-21 09:51:14] [INFO ] Flatten gal took : 175 ms
Total runtime 146005 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V20P10N20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/420/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 75
TRANSITIONS: 926
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.033s, Sys 0.000s]


SAVING FILE /home/mcc/execution/420/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 642
MODEL NAME: /home/mcc/execution/420/model
75 places, 926 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 BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N20-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716285191218

--------------------
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="BridgeAndVehicles-PT-V20P10N20"
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 BridgeAndVehicles-PT-V20P10N20, 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 r047-tajo-171620397700191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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