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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 18K Apr 13 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 13 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 129K Apr 13 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 529K Apr 13 02:26 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 7.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 77K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 227K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Apr 13 02:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 264K Apr 13 02:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Apr 13 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 514K Apr 13 02:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K 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 1.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-V50P50N10-ReachabilityCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716288533208

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:48:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 10:48:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:48:54] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2024-05-21 10:48:54] [INFO ] Transformed 128 places.
[2024-05-21 10:48:54] [INFO ] Transformed 1328 transitions.
[2024-05-21 10:48:54] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (88 resets) in 2770 ms. (14 steps per ms) remains 11/13 properties
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (24 resets) in 248 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 760 ms. (52 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 247 ms. (161 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (32 resets) in 405 ms. (98 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (28 resets) in 304 ms. (131 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (28 resets) in 308 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (24 resets) in 202 ms. (197 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 312 ms. (127 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (27 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (34 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (24 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
[2024-05-21 10:48:57] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2024-05-21 10:48:57] [INFO ] Computed 7 invariants in 16 ms
[2024-05-21 10:48:57] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-08 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 26/128 variables, 3/7 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 250/378 variables, 128/135 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 22/157 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/157 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/157 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 157 constraints, problems are : Problem set: 9 solved, 2 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/15 variables, 1/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 250/265 variables, 15/19 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 22/41 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/41 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 113/378 variables, 113/154 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 3/157 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 2/159 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/159 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/378 variables, 0/159 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 159 constraints, problems are : Problem set: 9 solved, 2 unsolved in 1136 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 2138ms problems are : Problem set: 9 solved, 2 unsolved
Parikh walk visited 0 properties in 1010 ms.
Support contains 13 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 186 ms. Remains 128 /128 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2024-05-21 10:49:00] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2024-05-21 10:49:00] [INFO ] Invariant cache hit.
[2024-05-21 10:49:00] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-05-21 10:49:11] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 9 ms to minimize.
[2024-05-21 10:49:17] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 2 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
[2024-05-21 10:49:21] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 5 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/378 variables, and 8 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1325 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/10 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
[2024-05-21 10:49:37] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/11 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/378 variables, and 11 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/1325 constraints, Known Traps: 4/4 constraints]
After SMT, in 46216ms problems are : Problem set: 100 solved, 1225 unsolved
Search for dead transitions found 100 dead transitions in 46253ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 128/128 places, 1228/1328 transitions.
Applied a total of 0 rules in 67 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46533 ms. Remains : 128/128 places, 1228/1328 transitions.
RANDOM walk for 40000 steps (88 resets) in 437 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (32 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40008 steps (32 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 333918 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 2
Probabilistic random walk after 333918 steps, saw 91318 distinct states, run finished after 3006 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-21 10:49:49] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 128 cols
[2024-05-21 10:49:49] [INFO ] Computed 7 invariants in 10 ms
[2024-05-21 10:49:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 248/263 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 113/376 variables, 113/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/376 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 248/263 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 113/376 variables, 113/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1852ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 715 ms.
Support contains 13 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 83 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 128/128 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 74 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2024-05-21 10:49:52] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-05-21 10:49:52] [INFO ] Invariant cache hit.
[2024-05-21 10:49:52] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-21 10:49:52] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-05-21 10:49:52] [INFO ] Invariant cache hit.
[2024-05-21 10:49:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:49:53] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
[2024-05-21 10:49:53] [INFO ] Redundant transitions in 90 ms returned []
Running 1225 sub problems to find dead transitions.
[2024-05-21 10:49:53] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-05-21 10:49:53] [INFO ] Invariant cache hit.
[2024-05-21 10:49:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 10:50:03] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 10:50:23] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 128/376 variables, and 9 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 6 (OVERLAPS) 248/376 variables, 128/137 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 20/157 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 1380 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 31565 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 2/2 constraints]
After SMT, in 67145ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 67159ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 128/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 85 ms. Remains 128 /128 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2024-05-21 10:51:01] [INFO ] Redundant transitions in 63 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68390 ms. Remains : 128/128 places, 1226/1228 transitions.
RANDOM walk for 40000 steps (88 resets) in 446 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (32 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (32 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 355686 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 2
Probabilistic random walk after 355686 steps, saw 97448 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-21 10:51:04] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 128 cols
[2024-05-21 10:51:04] [INFO ] Computed 9 invariants in 11 ms
[2024-05-21 10:51:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 102/117 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 246/363 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/374 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/374 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 102/117 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 246/363 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/374 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/374 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 159 constraints, problems are : Problem set: 0 solved, 2 unsolved in 835 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1173ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 776 ms.
Support contains 13 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1226/1226 transitions.
Applied a total of 0 rules in 72 ms. Remains 128 /128 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 128/128 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1226/1226 transitions.
Applied a total of 0 rules in 66 ms. Remains 128 /128 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2024-05-21 10:51:06] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 10:51:06] [INFO ] Invariant cache hit.
[2024-05-21 10:51:06] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 10:51:06] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 10:51:06] [INFO ] Invariant cache hit.
[2024-05-21 10:51:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:51:07] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2024-05-21 10:51:07] [INFO ] Redundant transitions in 17 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-05-21 10:51:07] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 10:51:07] [INFO ] Invariant cache hit.
[2024-05-21 10:51:07] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 10:51:16] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (OVERLAPS) 2/128 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 10:51:38] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 2 ms to minimize.
[2024-05-21 10:51:39] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 128/374 variables, and 12 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/128 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (OVERLAPS) 2/128 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 10:51:53] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/374 variables, and 13 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/128 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1223 constraints, Known Traps: 4/4 constraints]
After SMT, in 64635ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 64650ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65398 ms. Remains : 128/128 places, 1226/1226 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 128 transition count 246
Applied a total of 980 rules in 26 ms. Remains 128 /128 variables (removed 0) and now considering 246/1226 (removed 980) transitions.
Running SMT prover for 2 properties.
[2024-05-21 10:52:11] [INFO ] Invariant cache hit.
[2024-05-21 10:52:11] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 10:52:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 10:52:11] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 10:52:12] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 10:52:12] [INFO ] After 448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 10:52:12] [INFO ] After 613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 719 ms.
[2024-05-21 10:52:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-21 10:52:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 1226 transitions and 9202 arcs took 24 ms.
[2024-05-21 10:52:12] [INFO ] Flatten gal took : 167 ms
Total runtime 198250 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P50N10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 128
TRANSITIONS: 1226
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.071s, Sys 0.004s]


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


----------------------------------------------------------------------
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: 671
MODEL NAME: /home/mcc/execution/416/model
128 places, 1226 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-V50P50N10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716288774449

--------------------
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 ReachabilityCardinality -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-V50P50N10"
export BK_EXAMINATION="ReachabilityCardinality"
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-V50P50N10, examination is ReachabilityCardinality"
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-171620397800254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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