About the Execution of GreatSPN+red for FireWire-PT-19
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 525.960 | 98415.00 | 197043.00 | 187.60 | F | normal |
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.r560-tall-171734905900198.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-19, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905900198
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K 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.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 221K 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
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1717352692192
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:24:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:24:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:24:53] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-02 18:24:53] [INFO ] Transformed 602 places.
[2024-06-02 18:24:53] [INFO ] Transformed 944 transitions.
[2024-06-02 18:24:53] [INFO ] Found NUPN structural information;
[2024-06-02 18:24:53] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 207 ms.
Graph (trivial) has 494 edges and 602 vertex of which 19 / 602 are part of one of the 3 SCC in 5 ms
Free SCC test removed 16 places
Structural test allowed to assert that 139 places are NOT stable. Took 24 ms.
Ensure Unique test removed 17 transitions
Reduce redundant transitions removed 17 transitions.
RANDOM walk for 40000 steps (403 resets) in 1983 ms. (20 steps per ms) remains 315/463 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 315/315 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 315/315 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 315/315 properties
BEST_FIRST walk for 402 steps (8 resets) in 18 ms. (21 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 315/315 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 315/315 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 315/315 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 315/315 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 315/315 properties
[2024-06-02 18:24:54] [INFO ] Flow matrix only has 925 transitions (discarded 2 similar events)
// Phase 1: matrix 925 rows 586 cols
[2024-06-02 18:24:54] [INFO ] Computed 13 invariants in 18 ms
[2024-06-02 18:24:54] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 315/315 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 315/1511 variables, and 315 constraints, problems are : Problem set: 0 solved, 315 unsolved in 5051 ms.
Refiners :[Domain max(s): 315/586 constraints, Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/586 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 315/315 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 190/505 variables, 10/325 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 190/515 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-02 18:25:01] [INFO ] Deduced a trap composed of 172 places in 250 ms of which 38 ms to minimize.
[2024-06-02 18:25:02] [INFO ] Deduced a trap composed of 298 places in 202 ms of which 4 ms to minimize.
[2024-06-02 18:25:02] [INFO ] Deduced a trap composed of 172 places in 181 ms of which 4 ms to minimize.
[2024-06-02 18:25:02] [INFO ] Deduced a trap composed of 159 places in 183 ms of which 3 ms to minimize.
[2024-06-02 18:25:02] [INFO ] Deduced a trap composed of 99 places in 182 ms of which 4 ms to minimize.
[2024-06-02 18:25:02] [INFO ] Deduced a trap composed of 120 places in 182 ms of which 3 ms to minimize.
[2024-06-02 18:25:02] [INFO ] Deduced a trap composed of 103 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:25:03] [INFO ] Deduced a trap composed of 100 places in 185 ms of which 4 ms to minimize.
[2024-06-02 18:25:03] [INFO ] Deduced a trap composed of 87 places in 169 ms of which 3 ms to minimize.
[2024-06-02 18:25:03] [INFO ] Deduced a trap composed of 66 places in 175 ms of which 4 ms to minimize.
[2024-06-02 18:25:03] [INFO ] Deduced a trap composed of 104 places in 184 ms of which 3 ms to minimize.
[2024-06-02 18:25:04] [INFO ] Deduced a trap composed of 165 places in 175 ms of which 3 ms to minimize.
[2024-06-02 18:25:04] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/1511 variables, and 528 constraints, problems are : Problem set: 0 solved, 315 unsolved in 5012 ms.
Refiners :[Domain max(s): 505/586 constraints, Positive P Invariants (semi-flows): 10/13 constraints, State Equation: 0/586 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/315 constraints, Known Traps: 13/13 constraints]
After SMT, in 10231ms problems are : Problem set: 0 solved, 315 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 315 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 927/927 transitions.
Graph (complete) has 1585 edges and 586 vertex of which 577 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 577 transition count 816
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 1 with 108 rules applied. Total rules applied 220 place count 472 transition count 813
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 222 place count 470 transition count 813
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 222 place count 470 transition count 804
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 240 place count 461 transition count 804
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 256 place count 445 transition count 788
Iterating global reduction 3 with 16 rules applied. Total rules applied 272 place count 445 transition count 788
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 275 place count 445 transition count 785
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 275 place count 445 transition count 784
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 277 place count 444 transition count 784
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 279 place count 442 transition count 724
Iterating global reduction 4 with 2 rules applied. Total rules applied 281 place count 442 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 282 place count 442 transition count 723
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 344 place count 411 transition count 692
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 368 place count 399 transition count 710
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 371 place count 399 transition count 707
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 374 place count 399 transition count 704
Free-agglomeration rule applied 19 times.
Iterating global reduction 6 with 19 rules applied. Total rules applied 393 place count 399 transition count 685
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 415 place count 380 transition count 682
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 7 with 35 rules applied. Total rules applied 450 place count 380 transition count 647
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 451 place count 380 transition count 646
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 33 rules applied. Total rules applied 484 place count 379 transition count 614
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 487 place count 379 transition count 614
Applied a total of 487 rules in 198 ms. Remains 379 /586 variables (removed 207) and now considering 614/927 (removed 313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 379/586 places, 614/927 transitions.
RANDOM walk for 4000000 steps (238683 resets) in 47225 ms. (84 steps per ms) remains 115/315 properties
BEST_FIRST walk for 40004 steps (427 resets) in 118 ms. (336 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (453 resets) in 145 ms. (273 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (426 resets) in 141 ms. (281 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (430 resets) in 132 ms. (300 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (425 resets) in 128 ms. (310 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40002 steps (425 resets) in 104 ms. (380 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (429 resets) in 78 ms. (506 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (427 resets) in 72 ms. (548 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40001 steps (433 resets) in 68 ms. (579 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (433 resets) in 67 ms. (588 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (438 resets) in 70 ms. (563 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (421 resets) in 70 ms. (563 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (431 resets) in 70 ms. (563 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (431 resets) in 69 ms. (571 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (420 resets) in 68 ms. (579 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (423 resets) in 72 ms. (548 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (434 resets) in 69 ms. (571 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (417 resets) in 69 ms. (571 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (428 resets) in 68 ms. (579 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (416 resets) in 72 ms. (548 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (430 resets) in 67 ms. (588 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (432 resets) in 67 ms. (588 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (422 resets) in 69 ms. (571 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (422 resets) in 73 ms. (540 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (428 resets) in 67 ms. (588 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (436 resets) in 69 ms. (571 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (428 resets) in 70 ms. (563 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (426 resets) in 73 ms. (540 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (432 resets) in 69 ms. (571 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (438 resets) in 68 ms. (579 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (430 resets) in 69 ms. (571 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (444 resets) in 75 ms. (526 steps per ms) remains 113/115 properties
BEST_FIRST walk for 40003 steps (427 resets) in 69 ms. (571 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (425 resets) in 68 ms. (579 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (423 resets) in 69 ms. (571 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (424 resets) in 91 ms. (434 steps per ms) remains 111/113 properties
BEST_FIRST walk for 40003 steps (436 resets) in 93 ms. (425 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (432 resets) in 113 ms. (350 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (431 resets) in 120 ms. (330 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (419 resets) in 136 ms. (291 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (433 resets) in 117 ms. (339 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (438 resets) in 106 ms. (373 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (424 resets) in 86 ms. (459 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (414 resets) in 79 ms. (500 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (427 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (426 resets) in 70 ms. (563 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (436 resets) in 67 ms. (588 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (423 resets) in 72 ms. (548 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (425 resets) in 70 ms. (563 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (434 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (414 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (425 resets) in 71 ms. (555 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (431 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (436 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (423 resets) in 66 ms. (597 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (438 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (445 resets) in 70 ms. (563 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (435 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (429 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (416 resets) in 67 ms. (588 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (422 resets) in 72 ms. (547 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (427 resets) in 67 ms. (588 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (421 resets) in 66 ms. (597 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (419 resets) in 65 ms. (606 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (437 resets) in 75 ms. (526 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (429 resets) in 73 ms. (540 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (446 resets) in 74 ms. (533 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (433 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (428 resets) in 72 ms. (547 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (422 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (424 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (423 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (421 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (444 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (414 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (427 resets) in 66 ms. (597 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (433 resets) in 70 ms. (563 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (415 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (422 resets) in 67 ms. (588 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (426 resets) in 103 ms. (384 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (423 resets) in 89 ms. (444 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (415 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (425 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (423 resets) in 66 ms. (597 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (421 resets) in 71 ms. (555 steps per ms) remains 111/111 properties
[2024-06-02 18:25:20] [INFO ] Flow matrix only has 582 transitions (discarded 32 similar events)
// Phase 1: matrix 582 rows 379 cols
[2024-06-02 18:25:20] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:25:20] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 240/351 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 22/373 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 582/955 variables, 373/383 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/955 variables, 41/424 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/955 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 6/961 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/961 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/961 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 961/961 variables, and 430 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7106 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 240/351 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 18:25:28] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:25:28] [INFO ] Deduced a trap composed of 91 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:25:28] [INFO ] Deduced a trap composed of 94 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:25:28] [INFO ] Deduced a trap composed of 94 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:25:28] [INFO ] Deduced a trap composed of 98 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:25:28] [INFO ] Deduced a trap composed of 86 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:25:28] [INFO ] Deduced a trap composed of 95 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:25:29] [INFO ] Deduced a trap composed of 97 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 18:25:30] [INFO ] Deduced a trap composed of 98 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:25:30] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 18:25:30] [INFO ] Deduced a trap composed of 95 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:25:30] [INFO ] Deduced a trap composed of 94 places in 43 ms of which 0 ms to minimize.
[2024-06-02 18:25:30] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:25:30] [INFO ] Deduced a trap composed of 94 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:25:30] [INFO ] Deduced a trap composed of 95 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:25:30] [INFO ] Deduced a trap composed of 96 places in 47 ms of which 0 ms to minimize.
[2024-06-02 18:25:31] [INFO ] Deduced a trap composed of 94 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 18:25:31] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 18:25:33] [INFO ] Deduced a trap composed of 98 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:25:33] [INFO ] Deduced a trap composed of 99 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 22/373 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 18:25:35] [INFO ] Deduced a trap composed of 97 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 582/955 variables, 373/404 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/955 variables, 41/445 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/955 variables, 111/556 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 18:25:37] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 6 ms to minimize.
[2024-06-02 18:25:37] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 3 ms to minimize.
[2024-06-02 18:25:38] [INFO ] Deduced a trap composed of 95 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:25:38] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 2 ms to minimize.
[2024-06-02 18:25:39] [INFO ] Deduced a trap composed of 101 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:25:39] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:25:39] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:25:40] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/955 variables, 8/564 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 18:25:43] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 2 ms to minimize.
[2024-06-02 18:25:44] [INFO ] Deduced a trap composed of 100 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:25:44] [INFO ] Deduced a trap composed of 101 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:25:45] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/955 variables, 4/568 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 18:25:48] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/955 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/955 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 18 (OVERLAPS) 6/961 variables, 6/575 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/961 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 20 (OVERLAPS) 0/961 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 961/961 variables, and 575 constraints, problems are : Problem set: 0 solved, 111 unsolved in 44597 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 34/34 constraints]
After SMT, in 51734ms problems are : Problem set: 0 solved, 111 unsolved
Parikh walk visited 17 properties in 11221 ms.
Support contains 94 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 614/614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 379 transition count 557
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 322 transition count 557
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 114 place count 322 transition count 555
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 320 transition count 555
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 129 place count 309 transition count 544
Iterating global reduction 2 with 11 rules applied. Total rules applied 140 place count 309 transition count 544
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 140 place count 309 transition count 541
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 306 transition count 541
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 149 place count 303 transition count 538
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 303 transition count 538
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 2 with 4 rules applied. Total rules applied 156 place count 303 transition count 534
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 158 place count 301 transition count 534
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 216 place count 272 transition count 505
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 266 place count 247 transition count 526
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 278 place count 247 transition count 514
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 308 place count 247 transition count 484
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 317 place count 247 transition count 475
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 326 place count 238 transition count 475
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 329 place count 238 transition count 614
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 332 place count 235 transition count 614
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 334 place count 235 transition count 614
Applied a total of 334 rules in 95 ms. Remains 235 /379 variables (removed 144) and now considering 614/614 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 235/379 places, 614/614 transitions.
RANDOM walk for 4000000 steps (113687 resets) in 18685 ms. (214 steps per ms) remains 2/94 properties
BEST_FIRST walk for 4000004 steps (26447 resets) in 2685 ms. (1489 steps per ms) remains 2/2 properties
BEST_FIRST walk for 3492787 steps (22949 resets) in 3615 ms. (965 steps per ms) remains 0/2 properties
Able to resolve query StableMarking after proving 465 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 97266 ms.
ITS solved all properties within timeout
BK_STOP 1717352790607
--------------------
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 StableMarking -timeout 180 -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="FireWire-PT-19"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-19, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r560-tall-171734905900198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-19.tgz
mv FireWire-PT-19 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;