Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r091-tall-171624188300718.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DES-PT-40a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188300718
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 08:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 83K 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 DES-PT-40a-ReachabilityCardinality-2024-00
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-01
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-02
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-03
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-04
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-05
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-06
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-07
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-08
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-09
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-10
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-11
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-12
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-13
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-14
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716322910156

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 20:21:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 20:21:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:21:51] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-21 20:21:51] [INFO ] Transformed 274 places.
[2024-05-21 20:21:51] [INFO ] Transformed 231 transitions.
[2024-05-21 20:21:51] [INFO ] Found NUPN structural information;
[2024-05-21 20:21:51] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-40a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (876 resets) in 1862 ms. (21 steps per ms) remains 10/13 properties
FORMULA DES-PT-40a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (212 resets) in 416 ms. (95 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (197 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (230 resets) in 275 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (186 resets) in 167 ms. (238 steps per ms) remains 9/10 properties
FORMULA DES-PT-40a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (160 resets) in 421 ms. (94 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (173 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (187 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (213 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (177 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
// Phase 1: matrix 217 rows 274 cols
[2024-05-21 20:21:52] [INFO ] Computed 59 invariants in 28 ms
[2024-05-21 20:21:52] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 23/141 variables, 21/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 23/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 25/166 variables, 13/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 25/201 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 88/254 variables, 22/225 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 88/313 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem DES-PT-40a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA DES-PT-40a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (OVERLAPS) 216/470 variables, 254/567 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/470 variables, 1/568 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/470 variables, 0/568 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 21/491 variables, 20/588 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 20/608 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/491 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 608 constraints, problems are : Problem set: 1 solved, 8 unsolved in 3916 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 274/274 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 23/103 variables, 16/96 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 23/119 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 35/138 variables, 18/137 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 35/172 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 109/247 variables, 23/196 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 109/305 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 3/250 variables, 1/306 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 3/309 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-21 20:21:57] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 17 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 216/466 variables, 250/560 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 1/561 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/466 variables, 5/566 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/466 variables, 0/566 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 25/491 variables, 24/590 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/491 variables, 24/614 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/491 variables, 3/617 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/491 variables, and 617 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5010 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 274/274 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 9054ms problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 80 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 274 transition count 215
Applied a total of 5 rules in 54 ms. Remains 274 /274 variables (removed 0) and now considering 215/217 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 274/274 places, 215/217 transitions.
RANDOM walk for 40000 steps (524 resets) in 1116 ms. (35 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (91 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (203 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (82 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (72 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (95 resets) in 48 ms. (816 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (87 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (80 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (89 resets) in 49 ms. (800 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 781749 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :0 out of 8
Probabilistic random walk after 781749 steps, saw 112025 distinct states, run finished after 3021 ms. (steps per millisecond=258 ) properties seen :0
// Phase 1: matrix 215 rows 274 cols
[2024-05-21 20:22:05] [INFO ] Computed 61 invariants in 10 ms
[2024-05-21 20:22:05] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 29/109 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 29/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 35/144 variables, 18/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 35/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 107/251 variables, 23/205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 107/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 215/466 variables, 251/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 23/489 variables, 23/590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/489 variables, 23/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/489 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/489 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 613 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3804 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 274/274 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 29/109 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 29/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 35/144 variables, 18/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 35/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 107/251 variables, 23/205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 107/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 215/466 variables, 251/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 5/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 20:22:11] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 23/489 variables, 23/596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/489 variables, 23/619 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/489 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 20:22:15] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 20:22:15] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-21 20:22:16] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/489 variables, 3/625 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/489 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 20:22:18] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/489 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 20:22:21] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/489 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/489 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 0/489 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 489/489 variables, and 627 constraints, problems are : Problem set: 0 solved, 8 unsolved in 18663 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 274/274 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 22511ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 16953 ms.
Support contains 80 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 215/215 transitions.
Applied a total of 0 rules in 11 ms. Remains 274 /274 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 274/274 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 215/215 transitions.
Applied a total of 0 rules in 10 ms. Remains 274 /274 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-21 20:22:44] [INFO ] Invariant cache hit.
[2024-05-21 20:22:45] [INFO ] Implicit Places using invariants in 209 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 218 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 273/274 places, 215/215 transitions.
Applied a total of 0 rules in 15 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 244 ms. Remains : 273/274 places, 215/215 transitions.
RANDOM walk for 40000 steps (507 resets) in 332 ms. (120 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (94 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (208 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (89 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (62 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (93 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (100 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (89 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (91 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 798078 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 8
Probabilistic random walk after 798078 steps, saw 114199 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
// Phase 1: matrix 215 rows 273 cols
[2024-05-21 20:22:48] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 20:22:48] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 30/110 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 30/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 34/144 variables, 17/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 34/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 106/250 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 106/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 215/465 variables, 250/560 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 3/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 23/488 variables, 23/586 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/488 variables, 23/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/488 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 609 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3073 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 30/110 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 30/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 34/144 variables, 17/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 34/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 106/250 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 106/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 215/465 variables, 250/560 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 3/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 5/568 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/465 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 23/488 variables, 23/591 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 23/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/488 variables, 3/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/488 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/488 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 617 constraints, problems are : Problem set: 0 solved, 8 unsolved in 14129 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 17228ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 16620 ms.
Support contains 80 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 10 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 273/273 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 9 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-21 20:23:22] [INFO ] Invariant cache hit.
[2024-05-21 20:23:22] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-21 20:23:22] [INFO ] Invariant cache hit.
[2024-05-21 20:23:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 20:23:23] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2024-05-21 20:23:23] [INFO ] Redundant transitions in 12 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-21 20:23:23] [INFO ] Invariant cache hit.
[2024-05-21 20:23:23] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 272/272 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 11/283 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/273 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 13/333 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 215/488 variables, 273/606 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 3/609 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-21 20:23:30] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-21 20:23:38] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-21 20:23:50] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 612 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30014 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 272/272 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 11/283 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/273 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 13/333 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-21 20:23:54] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-05-21 20:23:55] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 3 ms to minimize.
[2024-05-21 20:23:55] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 215/488 variables, 273/612 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 3/615 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 214/829 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-21 20:24:14] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:24:15] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:24:21] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-21 20:24:22] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 833 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30020 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 10/10 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60869 ms. Remains : 273/273 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 10 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Running SMT prover for 8 properties.
[2024-05-21 20:24:23] [INFO ] Invariant cache hit.
[2024-05-21 20:24:23] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 20:24:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2024-05-21 20:24:23] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-21 20:24:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-21 20:24:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-21 20:24:24] [INFO ] After 896ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-05-21 20:24:24] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-21 20:24:24] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:24:24] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 20:24:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 201 ms
[2024-05-21 20:24:25] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2024-05-21 20:24:25] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-21 20:24:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2024-05-21 20:24:25] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-21 20:24:25] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-21 20:24:25] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-21 20:24:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 215 ms
TRAPS : Iteration 1
[2024-05-21 20:24:25] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-21 20:24:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
TRAPS : Iteration 2
[2024-05-21 20:24:26] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:24:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 3
[2024-05-21 20:24:28] [INFO ] After 4648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-05-21 20:24:28] [INFO ] After 5322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 5490 ms.
[2024-05-21 20:24:28] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-21 20:24:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 215 transitions and 1064 arcs took 4 ms.
[2024-05-21 20:24:29] [INFO ] Flatten gal took : 48 ms
Total runtime 157806 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-40a

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 669
MODEL NAME: /home/mcc/execution/408/model
273 places, 215 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 DES-PT-40a-ReachabilityCardinality-2024-02 CANNOT_COMPUTE
FORMULA DES-PT-40a-ReachabilityCardinality-2024-04 CANNOT_COMPUTE
FORMULA DES-PT-40a-ReachabilityCardinality-2024-08 CANNOT_COMPUTE
FORMULA DES-PT-40a-ReachabilityCardinality-2024-10 CANNOT_COMPUTE
FORMULA DES-PT-40a-ReachabilityCardinality-2024-11 CANNOT_COMPUTE
FORMULA DES-PT-40a-ReachabilityCardinality-2024-12 CANNOT_COMPUTE
FORMULA DES-PT-40a-ReachabilityCardinality-2024-14 CANNOT_COMPUTE
FORMULA DES-PT-40a-ReachabilityCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716323828260

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
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="DES-PT-40a"
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 DES-PT-40a, 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 r091-tall-171624188300718"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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