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.r549-tall-171734898200254.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 FireWire-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898200254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 125K Jun 2 16:33 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 FireWire-PT-11-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-11-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717367740170

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:35:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:35:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:35:41] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-02 22:35:41] [INFO ] Transformed 169 places.
[2024-06-02 22:35:41] [INFO ] Transformed 508 transitions.
[2024-06-02 22:35:41] [INFO ] Found NUPN structural information;
[2024-06-02 22:35:41] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1883 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 65 transitions
Reduce redundant transitions removed 65 transitions.
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1079 resets) in 1939 ms. (20 steps per ms) remains 10/13 properties
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (210 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (216 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (23 resets) in 309 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (205 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (202 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (199 resets) in 696 ms. (57 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (10 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (224 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (205 resets) in 230 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (198 resets) in 135 ms. (294 steps per ms) remains 9/10 properties
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 22:35:42] [INFO ] Flow matrix only has 405 transitions (discarded 38 similar events)
// Phase 1: matrix 405 rows 169 cols
[2024-06-02 22:35:43] [INFO ] Computed 10 invariants in 15 ms
[2024-06-02 22:35:43] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 93/167 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 93/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 404/571 variables, 167/344 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 57/401 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 2/573 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 1/574 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/574 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 406 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1141 ms.
Refiners :[Domain max(s): 169/169 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FireWire-PT-11-ReachabilityCardinality-2024-11 is UNSAT
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 93/167 variables, 9/84 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 93/177 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-02 22:35:44] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 11 ms to minimize.
[2024-06-02 22:35:44] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 2/179 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 404/571 variables, 167/346 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 57/403 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 6/409 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 0/409 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/573 variables, 2/411 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 2/413 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/573 variables, 2/415 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-02 22:35:45] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/573 variables, 1/416 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/573 variables, 0/416 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 1/574 variables, 1/417 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/574 variables, 0/417 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/574 variables, 0/417 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 417 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1660 ms.
Refiners :[Domain max(s): 169/169 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 2904ms problems are : Problem set: 1 solved, 8 unsolved
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 4556 ms.
Support contains 47 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 443/443 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 169 transition count 440
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 167 transition count 436
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 167 transition count 436
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 166 transition count 438
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 166 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 18 place count 166 transition count 429
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 166 transition count 429
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 26 place count 163 transition count 427
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 163 transition count 423
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 163 transition count 447
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 34 place count 162 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 45 place count 162 transition count 434
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 162 transition count 434
Applied a total of 46 rules in 128 ms. Remains 162 /169 variables (removed 7) and now considering 434/443 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 162/169 places, 434/443 transitions.
RANDOM walk for 40000 steps (1068 resets) in 207 ms. (192 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (220 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (18 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (224 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (216 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (191 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (218 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 626606 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :1 out of 6
Probabilistic random walk after 626606 steps, saw 153360 distinct states, run finished after 3008 ms. (steps per millisecond=208 ) properties seen :1
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 22:35:53] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
// Phase 1: matrix 402 rows 162 cols
[2024-06-02 22:35:53] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 22:35:53] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 113/160 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 402/562 variables, 160/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 61/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/564 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/564 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 233 constraints, problems are : Problem set: 0 solved, 5 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 113/160 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 402/562 variables, 160/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 61/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/564 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/564 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 241 constraints, problems are : Problem set: 0 solved, 5 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 1318ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 816 ms.
Support contains 47 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 162 /162 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 162/162 places, 434/434 transitions.
RANDOM walk for 40000 steps (1059 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (13 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (217 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (218 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (210 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (206 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 639804 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 5
Probabilistic random walk after 639804 steps, saw 157345 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
[2024-06-02 22:35:59] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 22:35:59] [INFO ] Invariant cache hit.
[2024-06-02 22:35:59] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 113/160 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 402/562 variables, 160/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 61/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/564 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:35:59] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:35:59] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/564 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 235 constraints, problems are : Problem set: 0 solved, 5 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 113/160 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:35:59] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:36:00] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:36:00] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 402/562 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 61/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/564 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:36:00] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/564 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/564 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 244 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1085 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 1704ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2277 ms.
Support contains 47 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 434/434 transitions.
Applied a total of 0 rules in 26 ms. Remains 162 /162 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 162/162 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 162 /162 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-06-02 22:36:03] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 22:36:03] [INFO ] Invariant cache hit.
[2024-06-02 22:36:03] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 22:36:03] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 22:36:03] [INFO ] Invariant cache hit.
[2024-06-02 22:36:03] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:36:03] [INFO ] Implicit Places using invariants and state equation in 251 ms returned [160]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 337 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 161/162 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 353 ms. Remains : 161/162 places, 434/434 transitions.
RANDOM walk for 40000 steps (1099 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (17 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (223 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (214 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (200 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (219 resets) in 36 ms. (1081 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 616025 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 5
Probabilistic random walk after 616025 steps, saw 150625 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
[2024-06-02 22:36:06] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
// Phase 1: matrix 402 rows 161 cols
[2024-06-02 22:36:06] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 22:36:06] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/156 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 402/558 variables, 156/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 61/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/563 variables, 5/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/563 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 233 constraints, problems are : Problem set: 0 solved, 5 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/156 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 402/558 variables, 156/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 61/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 5/563 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/563 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 240 constraints, problems are : Problem set: 0 solved, 5 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 1276ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2558 ms.
Support contains 47 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 161/161 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 434/434 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-06-02 22:36:10] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 22:36:10] [INFO ] Invariant cache hit.
[2024-06-02 22:36:10] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 22:36:10] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 22:36:10] [INFO ] Invariant cache hit.
[2024-06-02 22:36:10] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:36:10] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-06-02 22:36:11] [INFO ] Redundant transitions in 35 ms returned []
Running 433 sub problems to find dead transitions.
[2024-06-02 22:36:11] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 22:36:11] [INFO ] Invariant cache hit.
[2024-06-02 22:36:11] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 22:36:14] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:36:14] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:36:14] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:36:14] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:36:14] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:36:14] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:36:14] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:36:15] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:36:15] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:36:16] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 402/563 variables, 161/180 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 61/241 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 7 (OVERLAPS) 0/563 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 433 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 241 constraints, problems are : Problem set: 0 solved, 433 unsolved in 16722 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 402/563 variables, 161/180 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 61/241 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 433/674 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 22:36:41] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 22:36:52] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/563 variables, and 676 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 12/12 constraints]
After SMT, in 47169ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 47174ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47549 ms. Remains : 161/161 places, 434/434 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 79 edges and 161 vertex of which 11 / 161 are part of one of the 4 SCC in 2 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 85 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 153 transition count 348
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 41 place count 153 transition count 310
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 43 place count 153 transition count 308
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 151 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 150 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 149 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 149 transition count 304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 148 transition count 303
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 147 transition count 264
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 147 transition count 264
Free-agglomeration rule applied 9 times with reduction of 4 identical transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 64 place count 147 transition count 251
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 80 place count 138 transition count 244
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 138 transition count 243
Applied a total of 81 rules in 57 ms. Remains 138 /161 variables (removed 23) and now considering 243/434 (removed 191) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 243 rows 138 cols
[2024-06-02 22:36:58] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 22:36:58] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 22:36:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-02 22:36:58] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-02 22:36:58] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:36:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 1
[2024-06-02 22:36:58] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 2 ms to minimize.
[2024-06-02 22:36:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
TRAPS : Iteration 2
[2024-06-02 22:36:58] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-02 22:36:58] [INFO ] After 667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 800 ms.
[2024-06-02 22:36:58] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-02 22:36:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 161 places, 434 transitions and 1632 arcs took 5 ms.
[2024-06-02 22:36:59] [INFO ] Flatten gal took : 63 ms
Total runtime 77856 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-11

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 691
MODEL NAME: /home/mcc/execution/411/model
161 places, 434 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 FireWire-PT-11-ReachabilityCardinality-2024-06 CANNOT_COMPUTE
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-07 CANNOT_COMPUTE
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-08 CANNOT_COMPUTE
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-10 CANNOT_COMPUTE
FORMULA FireWire-PT-11-ReachabilityCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717368575845

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

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