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-171620397900311.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-V80P50N20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397900311
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 21K Apr 13 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 13 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 386K Apr 13 00:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 13 00:56 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 18K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 286K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 828K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 13 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K Apr 13 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 963K Apr 13 01:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 13 01:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:30 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 3.1M 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-V80P50N20-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716292883665

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-V80P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:01:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 12:01:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:01:25] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2024-05-21 12:01:25] [INFO ] Transformed 198 places.
[2024-05-21 12:01:25] [INFO ] Transformed 3728 transitions.
[2024-05-21 12:01:25] [INFO ] Parsed PT model containing 198 places and 3728 transitions and 28830 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 185 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (56 resets) in 4702 ms. (8 steps per ms) remains 8/14 properties
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (20 resets) in 888 ms. (44 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (20 resets) in 421 ms. (94 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (20 resets) in 580 ms. (68 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (20 resets) in 482 ms. (82 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (20 resets) in 331 ms. (120 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (20 resets) in 276 ms. (144 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (20 resets) in 328 ms. (121 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (20 resets) in 221 ms. (180 steps per ms) remains 8/8 properties
[2024-05-21 12:01:28] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2024-05-21 12:01:28] [INFO ] Computed 7 invariants in 21 ms
[2024-05-21 12:01:28] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-08 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-10 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-14 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 84/198 variables, 6/7 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 410/608 variables, 198/205 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 42/247 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 0/247 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/608 variables, 0/247 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 247 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1927 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 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/37 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 161/198 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-21 12:01:31] [INFO ] Deduced a trap composed of 7 places in 457 ms of which 17 ms to minimize.
[2024-05-21 12:01:32] [INFO ] Deduced a trap composed of 5 places in 544 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 2/9 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 410/608 variables, 198/207 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 42/249 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 5/254 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 0/254 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/608 variables, 0/254 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 254 constraints, problems are : Problem set: 3 solved, 5 unsolved in 4654 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 7024ms problems are : Problem set: 3 solved, 5 unsolved
Parikh walk visited 0 properties in 14247 ms.
Support contains 37 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 732 ms. Remains 195 /198 variables (removed 3) and now considering 3727/3728 (removed 1) transitions.
Running 3724 sub problems to find dead transitions.
[2024-05-21 12:01:50] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2024-05-21 12:01:50] [INFO ] Computed 5 invariants in 7 ms
[2024-05-21 12:01:50] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/604 variables, and 5 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 20143 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3724/3724 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
[2024-05-21 12:03:07] [INFO ] Deduced a trap composed of 5 places in 443 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 50)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3724 constraints, Known Traps: 1/1 constraints]
After SMT, in 88241ms problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 88350ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89160 ms. Remains : 195/198 places, 3727/3728 transitions.
RANDOM walk for 40000 steps (56 resets) in 1502 ms. (26 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (20 resets) in 484 ms. (82 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (20 resets) in 547 ms. (72 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (20 resets) in 319 ms. (125 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (20 resets) in 331 ms. (120 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (20 resets) in 381 ms. (104 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 147356 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 5
Probabilistic random walk after 147356 steps, saw 40617 distinct states, run finished after 3004 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-21 12:03:23] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 12:03:23] [INFO ] Invariant cache hit.
[2024-05-21 12:03:23] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 156/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 409/602 variables, 193/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 42/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/604 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 242 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1296 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 195/195 constraints, ReadFeed: 42/42 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 156/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 409/602 variables, 193/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 42/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/604 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/604 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 247 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 195/195 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 7497ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 43994 ms.
Support contains 37 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 524 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 526 ms. Remains : 195/195 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 463 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2024-05-21 12:04:15] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 12:04:15] [INFO ] Invariant cache hit.
[2024-05-21 12:04:16] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-21 12:04:16] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 12:04:16] [INFO ] Invariant cache hit.
[2024-05-21 12:04:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 12:04:17] [INFO ] Implicit Places using invariants and state equation in 953 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1263 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 194/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 479 ms. Remains 194 /194 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2206 ms. Remains : 194/195 places, 3727/3727 transitions.
RANDOM walk for 40000 steps (56 resets) in 695 ms. (57 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (20 resets) in 233 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (20 resets) in 223 ms. (178 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 316 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 213 ms. (186 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 189982 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 5
Probabilistic random walk after 189982 steps, saw 51824 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-21 12:04:21] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 194 cols
[2024-05-21 12:04:21] [INFO ] Computed 5 invariants in 9 ms
[2024-05-21 12:04:21] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 156/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 409/602 variables, 193/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 42/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/603 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/603 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 241 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1184 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 194/194 constraints, ReadFeed: 42/42 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 156/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 409/602 variables, 193/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 42/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/603 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/603 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 603/603 variables, and 246 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4884 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 194/194 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 6188ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 5217 ms.
Support contains 37 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3727/3727 transitions.
Applied a total of 0 rules in 460 ms. Remains 194 /194 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 461 ms. Remains : 194/194 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3727/3727 transitions.
Applied a total of 0 rules in 477 ms. Remains 194 /194 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2024-05-21 12:04:33] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 12:04:33] [INFO ] Invariant cache hit.
[2024-05-21 12:04:34] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-21 12:04:34] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 12:04:34] [INFO ] Invariant cache hit.
[2024-05-21 12:04:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 12:04:34] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
[2024-05-21 12:04:35] [INFO ] Redundant transitions in 227 ms returned []
Running 3724 sub problems to find dead transitions.
[2024-05-21 12:04:35] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 12:04:35] [INFO ] Invariant cache hit.
[2024-05-21 12:04:35] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
[2024-05-21 12:05:40] [INFO ] Deduced a trap composed of 5 places in 411 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 194/603 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/194 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3724/3724 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/603 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/194 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3724 constraints, Known Traps: 1/1 constraints]
After SMT, in 101885ms problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 101921ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103861 ms. Remains : 194/194 places, 3727/3727 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3318 transitions
Reduce isomorphic transitions removed 3318 transitions.
Iterating post reduction 0 with 3318 rules applied. Total rules applied 3318 place count 194 transition count 409
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 3322 place count 192 transition count 407
Applied a total of 3322 rules in 28 ms. Remains 192 /194 variables (removed 2) and now considering 407/3727 (removed 3320) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 407 rows 192 cols
[2024-05-21 12:06:17] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 12:06:17] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 12:06:17] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 12:06:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 12:06:18] [INFO ] After 546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-21 12:06:18] [INFO ] After 878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-21 12:06:18] [INFO ] After 1261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 1753 ms.
[2024-05-21 12:06:18] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-21 12:06:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 194 places, 3727 transitions and 28665 arcs took 33 ms.
[2024-05-21 12:06:19] [INFO ] Flatten gal took : 456 ms
Total runtime 294606 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V80P50N20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 194
TRANSITIONS: 3727
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.152s, Sys 0.020s]


SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.014s, 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: 645
MODEL NAME: /home/mcc/execution/419/model
194 places, 3727 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-V80P50N20-ReachabilityFireability-2024-09 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-11 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-12 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-13 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716294135669

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="BridgeAndVehicles-PT-V80P50N20"
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-V80P50N20, 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-171620397900311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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