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.r157-smll-171636265100159.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 EisenbergMcGuire-PT-04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265100159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 255K 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 EisenbergMcGuire-PT-04-ReachabilityFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-12
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-13
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-14
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716480719788

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 16:12:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 16:12:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 16:12:02] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2024-05-23 16:12:02] [INFO ] Transformed 196 places.
[2024-05-23 16:12:02] [INFO ] Transformed 448 transitions.
[2024-05-23 16:12:02] [INFO ] Found NUPN structural information;
[2024-05-23 16:12:02] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 470 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3279 ms. (12 steps per ms) remains 13/16 properties
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 789 ms. (50 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 12/13 properties
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 592 ms. (67 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 11/12 properties
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 399 ms. (100 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 10/11 properties
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-23 16:12:05] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
// Phase 1: matrix 284 rows 196 cols
[2024-05-23 16:12:05] [INFO ] Computed 13 invariants in 16 ms
[2024-05-23 16:12:05] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem EisenbergMcGuire-PT-04-ReachabilityFireability-2024-10 is UNSAT
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem EisenbergMcGuire-PT-04-ReachabilityFireability-2024-11 is UNSAT
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/88 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/88 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 109/196 variables, 8/96 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 109/205 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 4/209 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 284/480 variables, 196/405 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 112/517 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 0/517 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/480 variables, 0/517 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 517 constraints, problems are : Problem set: 2 solved, 8 unsolved in 1395 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem EisenbergMcGuire-PT-04-ReachabilityFireability-2024-06 is UNSAT
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/75 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/75 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 122/196 variables, 8/83 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 122/205 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 4/209 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-23 16:12:07] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 63 ms to minimize.
[2024-05-23 16:12:07] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 4 ms to minimize.
[2024-05-23 16:12:07] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-23 16:12:07] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:12:07] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:12:07] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:12:08] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 3 ms to minimize.
[2024-05-23 16:12:08] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 5 ms to minimize.
[2024-05-23 16:12:08] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
Problem EisenbergMcGuire-PT-04-ReachabilityFireability-2024-05 is UNSAT
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-23 16:12:08] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 3 ms to minimize.
[2024-05-23 16:12:08] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 11/220 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-23 16:12:08] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 4 ms to minimize.
[2024-05-23 16:12:09] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 4 ms to minimize.
[2024-05-23 16:12:09] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 2 ms to minimize.
[2024-05-23 16:12:09] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 4/224 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-23 16:12:09] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:12:09] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:12:09] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 3/227 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-23 16:12:09] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/228 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/228 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 284/480 variables, 196/424 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 112/536 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/480 variables, 6/542 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/480 variables, 0/542 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/480 variables, 0/542 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 542 constraints, problems are : Problem set: 4 solved, 6 unsolved in 4782 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 19/19 constraints]
After SMT, in 6459ms problems are : Problem set: 4 solved, 6 unsolved
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3766 ms.
Support contains 74 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 448/448 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 196 transition count 424
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 172 transition count 424
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 166 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 166 transition count 400
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 157 transition count 391
Applied a total of 78 rules in 118 ms. Remains 157 /196 variables (removed 39) and now considering 391/448 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 157/196 places, 391/448 transitions.
RANDOM walk for 40000 steps (8 resets) in 441 ms. (90 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 742 ms. (53 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 395900 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :3 out of 5
Probabilistic random walk after 395900 steps, saw 89883 distinct states, run finished after 3006 ms. (steps per millisecond=131 ) properties seen :3
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-23 16:12:19] [INFO ] Flow matrix only has 227 transitions (discarded 164 similar events)
// Phase 1: matrix 227 rows 157 cols
[2024-05-23 16:12:19] [INFO ] Computed 13 invariants in 4 ms
[2024-05-23 16:12:19] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 90/157 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 227/384 variables, 157/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 94/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 264 constraints, problems are : Problem set: 0 solved, 2 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 157/157 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 90/157 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:12:19] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 3 ms to minimize.
[2024-05-23 16:12:20] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
[2024-05-23 16:12:20] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:12:20] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:12:20] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 2 ms to minimize.
[2024-05-23 16:12:20] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:12:20] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 227/384 variables, 157/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 94/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:12:21] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:12:21] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/384 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2392 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 157/157 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 2841ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 214 ms.
Support contains 67 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 391/391 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 157 transition count 387
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 387
Applied a total of 8 rules in 27 ms. Remains 153 /157 variables (removed 4) and now considering 387/391 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 153/157 places, 387/391 transitions.
RANDOM walk for 40000 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 433 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 580575 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :0 out of 2
Probabilistic random walk after 580575 steps, saw 127249 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
[2024-05-23 16:12:25] [INFO ] Flow matrix only has 223 transitions (discarded 164 similar events)
// Phase 1: matrix 223 rows 153 cols
[2024-05-23 16:12:25] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 16:12:25] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 85/152 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/153 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 223/376 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 94/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/376 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 260 constraints, problems are : Problem set: 0 solved, 2 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 153/153 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 85/152 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:12:26] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:12:26] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/153 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 223/376 variables, 153/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 94/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/376 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 264 constraints, problems are : Problem set: 0 solved, 2 unsolved in 953 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 153/153 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1366ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 204 ms.
Support contains 67 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 387/387 transitions.
Applied a total of 0 rules in 15 ms. Remains 153 /153 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 153/153 places, 387/387 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 387/387 transitions.
Applied a total of 0 rules in 15 ms. Remains 153 /153 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2024-05-23 16:12:27] [INFO ] Flow matrix only has 223 transitions (discarded 164 similar events)
[2024-05-23 16:12:27] [INFO ] Invariant cache hit.
[2024-05-23 16:12:27] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-23 16:12:27] [INFO ] Flow matrix only has 223 transitions (discarded 164 similar events)
[2024-05-23 16:12:27] [INFO ] Invariant cache hit.
[2024-05-23 16:12:27] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 16:12:27] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-05-23 16:12:27] [INFO ] Redundant transitions in 30 ms returned []
Running 383 sub problems to find dead transitions.
[2024-05-23 16:12:27] [INFO ] Flow matrix only has 223 transitions (discarded 164 similar events)
[2024-05-23 16:12:27] [INFO ] Invariant cache hit.
[2024-05-23 16:12:27] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 16:12:30] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 3 ms to minimize.
[2024-05-23 16:12:30] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:12:30] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:12:30] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 3 ms to minimize.
[2024-05-23 16:12:31] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 3 ms to minimize.
[2024-05-23 16:12:31] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:12:31] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-05-23 16:12:31] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:12:32] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 3 ms to minimize.
[2024-05-23 16:12:32] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 4 ms to minimize.
[2024-05-23 16:12:32] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
[2024-05-23 16:12:32] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 16:12:32] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-23 16:12:32] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 16:12:32] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-23 16:12:32] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-23 16:12:32] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-23 16:12:32] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 16:12:33] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:12:33] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 16:12:34] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 4 ms to minimize.
[2024-05-23 16:12:34] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-05-23 16:12:34] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:12:35] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 2 ms to minimize.
[2024-05-23 16:12:35] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 2 ms to minimize.
[2024-05-23 16:12:35] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 3 ms to minimize.
[2024-05-23 16:12:35] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 7 ms to minimize.
[2024-05-23 16:12:36] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 3 ms to minimize.
[2024-05-23 16:12:36] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:12:36] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 2 ms to minimize.
[2024-05-23 16:12:36] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:12:37] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2024-05-23 16:12:37] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:12:37] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 3 ms to minimize.
[2024-05-23 16:12:37] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 3 ms to minimize.
[2024-05-23 16:12:38] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 3 ms to minimize.
[2024-05-23 16:12:38] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 3 ms to minimize.
[2024-05-23 16:12:38] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:12:39] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 3 ms to minimize.
[2024-05-23 16:12:39] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 16:12:42] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 3 ms to minimize.
[2024-05-23 16:12:43] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 3 ms to minimize.
[2024-05-23 16:12:43] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-05-23 16:12:43] [INFO ] Deduced a trap composed of 60 places in 154 ms of which 3 ms to minimize.
[2024-05-23 16:12:43] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 3 ms to minimize.
[2024-05-23 16:12:44] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 3 ms to minimize.
[2024-05-23 16:12:44] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 3 ms to minimize.
[2024-05-23 16:12:44] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 3 ms to minimize.
[2024-05-23 16:12:44] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:12:44] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:12:44] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 3 ms to minimize.
[2024-05-23 16:12:45] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:12:45] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 3 ms to minimize.
[2024-05-23 16:12:46] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:12:46] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 3 ms to minimize.
[2024-05-23 16:12:46] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 16:12:48] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:12:48] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:12:48] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:12:48] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 16:12:52] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 3 ms to minimize.
[2024-05-23 16:12:52] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
[2024-05-23 16:12:52] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-05-23 16:12:52] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 2 ms to minimize.
[2024-05-23 16:12:52] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-05-23 16:12:52] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-05-23 16:12:53] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 3 ms to minimize.
[2024-05-23 16:12:53] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:12:54] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-05-23 16:12:54] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 16:12:57] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 153/376 variables, and 84 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/153 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 71/84 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 16:12:59] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:13:01] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:13:01] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:13:01] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 3 ms to minimize.
[2024-05-23 16:13:01] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-05-23 16:13:02] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 3 ms to minimize.
[2024-05-23 16:13:02] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 3 ms to minimize.
[2024-05-23 16:13:02] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 3 ms to minimize.
[2024-05-23 16:13:02] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 9/93 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 16:13:05] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 3 ms to minimize.
[2024-05-23 16:13:05] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 3 ms to minimize.
[2024-05-23 16:13:05] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:13:05] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 3 ms to minimize.
[2024-05-23 16:13:05] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 3 ms to minimize.
[2024-05-23 16:13:06] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:13:06] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 3 ms to minimize.
[2024-05-23 16:13:06] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:13:07] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 3 ms to minimize.
[2024-05-23 16:13:07] [INFO ] Deduced a trap composed of 63 places in 158 ms of which 3 ms to minimize.
[2024-05-23 16:13:08] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-23 16:13:08] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 2 ms to minimize.
[2024-05-23 16:13:08] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 13/106 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 16:13:10] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 3 ms to minimize.
[2024-05-23 16:13:11] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-05-23 16:13:11] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:13:11] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 3 ms to minimize.
[2024-05-23 16:13:12] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 16:13:13] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:13:16] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 16:13:18] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 3 ms to minimize.
[2024-05-23 16:13:20] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 16:13:22] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 153/376 variables, and 116 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/153 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 0/383 constraints, Known Traps: 103/103 constraints]
After SMT, in 60242ms problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60853 ms. Remains : 153/153 places, 387/387 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 153 vertex of which 8 / 153 are part of one of the 4 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 174 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 149 transition count 208
Reduce places removed 5 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 11 rules applied. Total rules applied 17 place count 144 transition count 202
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 23 place count 138 transition count 202
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 23 place count 138 transition count 198
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 31 place count 134 transition count 198
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 39 place count 130 transition count 194
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 49 place count 125 transition count 214
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 59 place count 125 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 82 place count 125 transition count 181
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 4 with 2 rules applied. Total rules applied 84 place count 124 transition count 183
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 93 place count 124 transition count 174
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 102 place count 115 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 115 transition count 173
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 115 transition count 173
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 106 place count 115 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 107 place count 115 transition count 172
Applied a total of 107 rules in 103 ms. Remains 115 /153 variables (removed 38) and now considering 172/387 (removed 215) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 172 rows 115 cols
[2024-05-23 16:13:28] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 16:13:28] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 16:13:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-23 16:13:28] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-23 16:13:28] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 16:13:28] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-23 16:13:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-23 16:13:28] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
[2024-05-23 16:13:28] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-23 16:13:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
TRAPS : Iteration 1
[2024-05-23 16:13:29] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-23 16:13:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
TRAPS : Iteration 2
[2024-05-23 16:13:29] [INFO ] After 1088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 16:13:29] [INFO ] After 1355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1577 ms.
[2024-05-23 16:13:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2024-05-23 16:13:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 153 places, 387 transitions and 1782 arcs took 13 ms.
[2024-05-23 16:13:30] [INFO ] Flatten gal took : 129 ms
Total runtime 87823 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 153
TRANSITIONS: 387
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.017s, Sys 0.005s]


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


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

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

Process ID: 1049
MODEL NAME: /home/mcc/execution/414/model
153 places, 387 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 EisenbergMcGuire-PT-04-ReachabilityFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716480882022

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-04"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is EisenbergMcGuire-PT-04, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r157-smll-171636265100159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-04.tgz
mv EisenbergMcGuire-PT-04 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;