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.r355-tall-171683758600351.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 ShieldIIPt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758600351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K 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 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:43 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 ShieldIIPt-PT-100B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716951858229

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 03:04:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 03:04:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:04:19] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2024-05-29 03:04:20] [INFO ] Transformed 7003 places.
[2024-05-29 03:04:20] [INFO ] Transformed 6503 transitions.
[2024-05-29 03:04:20] [INFO ] Found NUPN structural information;
[2024-05-29 03:04:20] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 683 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2330 ms. (17 steps per ms) remains 11/16 properties
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 706 ms. (56 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 11/11 properties
// Phase 1: matrix 6503 rows 7003 cols
[2024-05-29 03:04:21] [INFO ] Computed 901 invariants in 62 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 4537/4722 variables, 570/755 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4722 variables, 4537/5292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4722 variables, 0/5292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2281/7003 variables, 331/5623 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7003 variables, 2281/7904 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7003 variables, 0/7904 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 5278ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 185 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1554 transitions
Trivial Post-agglo rules discarded 1554 transitions
Performed 1554 trivial Post agglomeration. Transition count delta: 1554
Iterating post reduction 0 with 1554 rules applied. Total rules applied 1554 place count 7003 transition count 4949
Reduce places removed 1554 places and 0 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 1 with 1604 rules applied. Total rules applied 3158 place count 5449 transition count 4899
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 2 with 50 rules applied. Total rules applied 3208 place count 5399 transition count 4899
Performed 413 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 413 Pre rules applied. Total rules applied 3208 place count 5399 transition count 4486
Deduced a syphon composed of 413 places in 22 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 3 with 826 rules applied. Total rules applied 4034 place count 4986 transition count 4486
Discarding 665 places :
Symmetric choice reduction at 3 with 665 rule applications. Total rules 4699 place count 4321 transition count 3821
Iterating global reduction 3 with 665 rules applied. Total rules applied 5364 place count 4321 transition count 3821
Performed 263 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 263 Pre rules applied. Total rules applied 5364 place count 4321 transition count 3558
Deduced a syphon composed of 263 places in 17 ms
Reduce places removed 263 places and 0 transitions.
Iterating global reduction 3 with 526 rules applied. Total rules applied 5890 place count 4058 transition count 3558
Performed 1626 Post agglomeration using F-continuation condition.Transition count delta: 1626
Deduced a syphon composed of 1626 places in 22 ms
Reduce places removed 1626 places and 0 transitions.
Iterating global reduction 3 with 3252 rules applied. Total rules applied 9142 place count 2432 transition count 1932
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9344 place count 2331 transition count 1985
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9546 place count 2230 transition count 2036
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 59 places in 8 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 9664 place count 2171 transition count 2069
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9665 place count 2171 transition count 2068
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 9679 place count 2171 transition count 2054
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 9693 place count 2157 transition count 2054
Partial Free-agglomeration rule applied 95 times.
Drop transitions (Partial Free agglomeration) removed 95 transitions
Iterating global reduction 5 with 95 rules applied. Total rules applied 9788 place count 2157 transition count 2054
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9789 place count 2156 transition count 2053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 9790 place count 2155 transition count 2053
Applied a total of 9790 rules in 2609 ms. Remains 2155 /7003 variables (removed 4848) and now considering 2053/6503 (removed 4450) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2619 ms. Remains : 2155/7003 places, 2053/6503 transitions.
RANDOM walk for 40000 steps (8 resets) in 1152 ms. (34 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 551 ms. (72 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 410 ms. (97 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 321 ms. (124 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 56665 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 11
Probabilistic random walk after 56665 steps, saw 39022 distinct states, run finished after 3004 ms. (steps per millisecond=18 ) properties seen :0
// Phase 1: matrix 2053 rows 2155 cols
[2024-05-29 03:04:34] [INFO ] Computed 900 invariants in 10 ms
[2024-05-29 03:04:34] [INFO ] State equation strengthened by 657 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1275/1460 variables, 570/570 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1460 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 604/2064 variables, 287/857 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2064 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2000/4064 variables, 2064/2921 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4064 variables, 655/3576 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4064 variables, 0/3576 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 100/4164 variables, 64/3640 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4164 variables, 28/3668 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4164 variables, 2/3670 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4164 variables, 0/3670 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 2/4166 variables, 3/3673 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4166 variables, 2/3675 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4166 variables, 0/3675 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 2/4168 variables, 1/3676 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4168 variables, 0/3676 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 30/4198 variables, 18/3694 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4198 variables, 7/3701 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4198 variables, 0/3701 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 1/4199 variables, 1/3702 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4199 variables, 1/3703 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4199 variables, 0/3703 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 2/4201 variables, 1/3704 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4201 variables, 0/3704 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 7/4208 variables, 6/3710 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4208 variables, 2/3712 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4208 variables, 0/3712 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 0/4208 variables, 0/3712 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4208/4208 variables, and 3712 constraints, problems are : Problem set: 0 solved, 11 unsolved in 17084 ms.
Refiners :[Positive P Invariants (semi-flows): 900/900 constraints, State Equation: 2155/2155 constraints, ReadFeed: 657/657 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1275/1460 variables, 570/570 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 03:04:52] [INFO ] Deduced a trap composed of 8 places in 486 ms of which 60 ms to minimize.
[2024-05-29 03:04:52] [INFO ] Deduced a trap composed of 5 places in 482 ms of which 16 ms to minimize.
[2024-05-29 03:04:53] [INFO ] Deduced a trap composed of 8 places in 400 ms of which 7 ms to minimize.
[2024-05-29 03:04:53] [INFO ] Deduced a trap composed of 8 places in 420 ms of which 7 ms to minimize.
[2024-05-29 03:04:53] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 3 ms to minimize.
[2024-05-29 03:04:53] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2024-05-29 03:04:54] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-05-29 03:04:54] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 3 ms to minimize.
[2024-05-29 03:04:54] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-05-29 03:04:54] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-29 03:04:54] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-05-29 03:04:54] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-29 03:04:54] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-05-29 03:04:55] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-29 03:04:55] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-05-29 03:04:55] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 3 ms to minimize.
[2024-05-29 03:04:55] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 3 ms to minimize.
[2024-05-29 03:04:55] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-29 03:04:55] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-29 03:04:55] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1460 variables, 20/590 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 03:04:55] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1460 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 03:04:56] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 3 ms to minimize.
[2024-05-29 03:04:56] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1460 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1460 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 604/2064 variables, 287/880 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 03:04:57] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 2 ms to minimize.
[2024-05-29 03:04:57] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-05-29 03:04:57] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 3 ms to minimize.
[2024-05-29 03:04:57] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 3 ms to minimize.
[2024-05-29 03:04:58] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-05-29 03:04:58] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-05-29 03:04:58] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 3 ms to minimize.
[2024-05-29 03:04:58] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 2 ms to minimize.
[2024-05-29 03:04:58] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-05-29 03:04:58] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 3 ms to minimize.
[2024-05-29 03:04:59] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 3 ms to minimize.
[2024-05-29 03:04:59] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-05-29 03:04:59] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-29 03:04:59] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2064 variables, 14/894 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 03:05:00] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2064 variables, 1/895 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2064 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 2000/4064 variables, 2064/2959 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4064 variables, 655/3614 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4064 variables, 6/3620 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 03:05:08] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 4 ms to minimize.
[2024-05-29 03:05:09] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 4 ms to minimize.
[2024-05-29 03:05:09] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 3 ms to minimize.
[2024-05-29 03:05:09] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 4 ms to minimize.
[2024-05-29 03:05:10] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 3 ms to minimize.
[2024-05-29 03:05:10] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 4 ms to minimize.
[2024-05-29 03:05:10] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 4 ms to minimize.
[2024-05-29 03:05:11] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 4 ms to minimize.
[2024-05-29 03:05:11] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4064 variables, 9/3629 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 03:05:13] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 4 ms to minimize.
[2024-05-29 03:05:13] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/4064 variables, 2/3631 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4064 variables, 0/3631 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 100/4164 variables, 64/3695 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4164 variables, 28/3723 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4164 variables, 2/3725 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4164 variables, 5/3730 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 03:05:28] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 3 ms to minimize.
[2024-05-29 03:05:29] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 3 ms to minimize.
[2024-05-29 03:05:29] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-05-29 03:05:29] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-05-29 03:05:30] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/4164 variables, 5/3735 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4164/4208 variables, and 3735 constraints, problems are : Problem set: 0 solved, 11 unsolved in 45011 ms.
Refiners :[Positive P Invariants (semi-flows): 885/900 constraints, State Equation: 2128/2155 constraints, ReadFeed: 657/657 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 54/54 constraints]
After SMT, in 62181ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 185 out of 2155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2155/2155 places, 2053/2053 transitions.
Applied a total of 0 rules in 80 ms. Remains 2155 /2155 variables (removed 0) and now considering 2053/2053 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 2155/2155 places, 2053/2053 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2155/2155 places, 2053/2053 transitions.
Applied a total of 0 rules in 64 ms. Remains 2155 /2155 variables (removed 0) and now considering 2053/2053 (removed 0) transitions.
[2024-05-29 03:05:36] [INFO ] Invariant cache hit.
[2024-05-29 03:05:37] [INFO ] Implicit Places using invariants in 1169 ms returned []
[2024-05-29 03:05:37] [INFO ] Invariant cache hit.
[2024-05-29 03:05:38] [INFO ] State equation strengthened by 657 read => feed constraints.
[2024-05-29 03:05:58] [INFO ] Implicit Places using invariants and state equation in 20440 ms returned []
Implicit Place search using SMT with State Equation took 21619 ms to find 0 implicit places.
[2024-05-29 03:05:58] [INFO ] Redundant transitions in 112 ms returned []
Running 2043 sub problems to find dead transitions.
[2024-05-29 03:05:58] [INFO ] Invariant cache hit.
[2024-05-29 03:05:58] [INFO ] State equation strengthened by 657 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2148 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 2043 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2148/4208 variables, and 49 constraints, problems are : Problem set: 0 solved, 2043 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 49/900 constraints, State Equation: 0/2155 constraints, ReadFeed: 0/657 constraints, PredecessorRefiner: 2043/2043 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2043 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2148 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 2043 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2148/4208 variables, and 49 constraints, problems are : Problem set: 0 solved, 2043 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 49/900 constraints, State Equation: 0/2155 constraints, ReadFeed: 0/657 constraints, PredecessorRefiner: 0/2043 constraints, Known Traps: 0/0 constraints]
After SMT, in 60953ms problems are : Problem set: 0 solved, 2043 unsolved
Search for dead transitions found 0 dead transitions in 60976ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82799 ms. Remains : 2155/2155 places, 2053/2053 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 361 times.
Drop transitions (Partial Free agglomeration) removed 361 transitions
Iterating global reduction 0 with 361 rules applied. Total rules applied 361 place count 2155 transition count 2053
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 367 place count 2155 transition count 2047
Applied a total of 367 rules in 174 ms. Remains 2155 /2155 variables (removed 0) and now considering 2047/2053 (removed 6) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 2047 rows 2155 cols
[2024-05-29 03:06:59] [INFO ] Computed 900 invariants in 16 ms
[2024-05-29 03:07:00] [INFO ] [Real]Absence check using 900 positive place invariants in 180 ms returned sat
[2024-05-29 03:07:00] [INFO ] After 860ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-29 03:07:01] [INFO ] [Nat]Absence check using 900 positive place invariants in 170 ms returned sat
[2024-05-29 03:07:03] [INFO ] After 2090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-29 03:07:03] [INFO ] State equation strengthened by 326 read => feed constraints.
[2024-05-29 03:07:07] [INFO ] After 3841ms SMT Verify possible using 326 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-05-29 03:07:07] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 5 ms to minimize.
[2024-05-29 03:07:08] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 12 ms to minimize.
[2024-05-29 03:07:08] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 4 ms to minimize.
[2024-05-29 03:07:08] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 4 ms to minimize.
[2024-05-29 03:07:09] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 5 ms to minimize.
[2024-05-29 03:07:09] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 4 ms to minimize.
[2024-05-29 03:07:09] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 5 ms to minimize.
[2024-05-29 03:07:10] [INFO ] Deduced a trap composed of 18 places in 246 ms of which 5 ms to minimize.
[2024-05-29 03:07:10] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 5 ms to minimize.
[2024-05-29 03:07:10] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 5 ms to minimize.
[2024-05-29 03:07:11] [INFO ] Deduced a trap composed of 14 places in 239 ms of which 5 ms to minimize.
[2024-05-29 03:07:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3733 ms
[2024-05-29 03:07:11] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 4 ms to minimize.
[2024-05-29 03:07:12] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 5 ms to minimize.
[2024-05-29 03:07:12] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 5 ms to minimize.
[2024-05-29 03:07:12] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 5 ms to minimize.
[2024-05-29 03:07:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1440 ms
[2024-05-29 03:07:14] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 5 ms to minimize.
[2024-05-29 03:07:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2024-05-29 03:07:15] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 5 ms to minimize.
[2024-05-29 03:07:15] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 4 ms to minimize.
[2024-05-29 03:07:15] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 4 ms to minimize.
[2024-05-29 03:07:16] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 5 ms to minimize.
[2024-05-29 03:07:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1390 ms
[2024-05-29 03:07:17] [INFO ] Deduced a trap composed of 5 places in 768 ms of which 10 ms to minimize.
[2024-05-29 03:07:18] [INFO ] Deduced a trap composed of 4 places in 751 ms of which 10 ms to minimize.
[2024-05-29 03:07:19] [INFO ] Deduced a trap composed of 6 places in 739 ms of which 9 ms to minimize.
[2024-05-29 03:07:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2583 ms
[2024-05-29 03:07:20] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 5 ms to minimize.
[2024-05-29 03:07:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 447 ms
[2024-05-29 03:07:23] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 5 ms to minimize.
[2024-05-29 03:07:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 449 ms
TRAPS : Iteration 1
[2024-05-29 03:07:24] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 4 ms to minimize.
[2024-05-29 03:07:24] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 6 ms to minimize.
[2024-05-29 03:07:24] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 4 ms to minimize.
[2024-05-29 03:07:25] [INFO ] Deduced a trap composed of 5 places in 266 ms of which 6 ms to minimize.
[2024-05-29 03:07:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1473 ms
[2024-05-29 03:07:26] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 5 ms to minimize.
[2024-05-29 03:07:27] [INFO ] Deduced a trap composed of 9 places in 291 ms of which 5 ms to minimize.
[2024-05-29 03:07:27] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 5 ms to minimize.
[2024-05-29 03:07:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1206 ms
[2024-05-29 03:07:28] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 5 ms to minimize.
[2024-05-29 03:07:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
[2024-05-29 03:07:29] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 5 ms to minimize.
[2024-05-29 03:07:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 439 ms
TRAPS : Iteration 2
[2024-05-29 03:07:32] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 5 ms to minimize.
[2024-05-29 03:07:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 444 ms
[2024-05-29 03:07:32] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 6 ms to minimize.
[2024-05-29 03:07:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 441 ms
[2024-05-29 03:07:33] [INFO ] Deduced a trap composed of 14 places in 287 ms of which 5 ms to minimize.
[2024-05-29 03:07:34] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 6 ms to minimize.
[2024-05-29 03:07:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 829 ms
[2024-05-29 03:07:35] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 6 ms to minimize.
[2024-05-29 03:07:36] [INFO ] Deduced a trap composed of 21 places in 311 ms of which 6 ms to minimize.
[2024-05-29 03:07:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 881 ms
[2024-05-29 03:07:37] [INFO ] Deduced a trap composed of 16 places in 318 ms of which 5 ms to minimize.
[2024-05-29 03:07:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2024-05-29 03:07:39] [INFO ] Deduced a trap composed of 13 places in 326 ms of which 6 ms to minimize.
[2024-05-29 03:07:40] [INFO ] Deduced a trap composed of 14 places in 316 ms of which 6 ms to minimize.
[2024-05-29 03:07:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 894 ms
TRAPS : Iteration 3
[2024-05-29 03:07:41] [INFO ] Deduced a trap composed of 13 places in 316 ms of which 6 ms to minimize.
[2024-05-29 03:07:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 472 ms
[2024-05-29 03:07:43] [INFO ] Deduced a trap composed of 17 places in 347 ms of which 6 ms to minimize.
[2024-05-29 03:07:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 510 ms
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 17 places in 330 ms of which 6 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 486 ms
[2024-05-29 03:07:47] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 6 ms to minimize.
[2024-05-29 03:07:48] [INFO ] Deduced a trap composed of 8 places in 276 ms of which 5 ms to minimize.
[2024-05-29 03:07:48] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 5 ms to minimize.
[2024-05-29 03:07:48] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 5 ms to minimize.
[2024-05-29 03:07:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1540 ms
TRAPS : Iteration 4
[2024-05-29 03:07:50] [INFO ] Deduced a trap composed of 16 places in 498 ms of which 8 ms to minimize.
[2024-05-29 03:07:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1421 ms
[2024-05-29 03:07:55] [INFO ] Deduced a trap composed of 16 places in 309 ms of which 5 ms to minimize.
[2024-05-29 03:07:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 469 ms
TRAPS : Iteration 5
[2024-05-29 03:07:56] [INFO ] Deduced a trap composed of 7 places in 307 ms of which 6 ms to minimize.
[2024-05-29 03:07:56] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 5 ms to minimize.
[2024-05-29 03:07:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 843 ms
[2024-05-29 03:08:02] [INFO ] Deduced a trap composed of 16 places in 304 ms of which 5 ms to minimize.
[2024-05-29 03:08:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 464 ms
TRAPS : Iteration 6
[2024-05-29 03:08:04] [INFO ] Deduced a trap composed of 7 places in 538 ms of which 7 ms to minimize.
[2024-05-29 03:08:05] [INFO ] Deduced a trap composed of 8 places in 782 ms of which 10 ms to minimize.
[2024-05-29 03:08:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1615 ms
[2024-05-29 03:08:06] [INFO ] Deduced a trap composed of 16 places in 317 ms of which 6 ms to minimize.
[2024-05-29 03:08:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 478 ms
[2024-05-29 03:08:07] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 5 ms to minimize.
[2024-05-29 03:08:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 470 ms
[2024-05-29 03:08:10] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 6 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 6 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 894 ms
TRAPS : Iteration 7
[2024-05-29 03:08:13] [INFO ] Deduced a trap composed of 8 places in 314 ms of which 6 ms to minimize.
[2024-05-29 03:08:13] [INFO ] Deduced a trap composed of 14 places in 302 ms of which 6 ms to minimize.
[2024-05-29 03:08:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 864 ms
[2024-05-29 03:08:14] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 6 ms to minimize.
[2024-05-29 03:08:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 473 ms
[2024-05-29 03:08:15] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 6 ms to minimize.
[2024-05-29 03:08:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2024-05-29 03:08:19] [INFO ] Deduced a trap composed of 14 places in 297 ms of which 6 ms to minimize.
[2024-05-29 03:08:19] [INFO ] Deduced a trap composed of 14 places in 290 ms of which 6 ms to minimize.
[2024-05-29 03:08:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 842 ms
TRAPS : Iteration 8
[2024-05-29 03:08:23] [INFO ] Deduced a trap composed of 14 places in 351 ms of which 6 ms to minimize.
[2024-05-29 03:08:23] [INFO ] Deduced a trap composed of 8 places in 337 ms of which 6 ms to minimize.
[2024-05-29 03:08:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 942 ms
[2024-05-29 03:08:26] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 5 ms to minimize.
[2024-05-29 03:08:26] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 5 ms to minimize.
[2024-05-29 03:08:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 816 ms
TRAPS : Iteration 9
[2024-05-29 03:08:27] [INFO ] Deduced a trap composed of 7 places in 281 ms of which 5 ms to minimize.
[2024-05-29 03:08:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2024-05-29 03:08:32] [INFO ] Deduced a trap composed of 21 places in 318 ms of which 5 ms to minimize.
[2024-05-29 03:08:33] [INFO ] Deduced a trap composed of 16 places in 316 ms of which 6 ms to minimize.
[2024-05-29 03:08:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 893 ms
TRAPS : Iteration 10
[2024-05-29 03:08:34] [INFO ] Deduced a trap composed of 12 places in 626 ms of which 9 ms to minimize.
[2024-05-29 03:08:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 777 ms
[2024-05-29 03:08:35] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 4 ms to minimize.
[2024-05-29 03:08:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 437 ms
[2024-05-29 03:08:36] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 5 ms to minimize.
[2024-05-29 03:08:36] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 6 ms to minimize.
[2024-05-29 03:08:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 850 ms
[2024-05-29 03:08:37] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 5 ms to minimize.
[2024-05-29 03:08:38] [INFO ] Deduced a trap composed of 22 places in 307 ms of which 5 ms to minimize.
[2024-05-29 03:08:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 857 ms
[2024-05-29 03:08:41] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 6 ms to minimize.
[2024-05-29 03:08:41] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 6 ms to minimize.
[2024-05-29 03:08:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 884 ms
TRAPS : Iteration 11
[2024-05-29 03:08:44] [INFO ] Deduced a trap composed of 13 places in 289 ms of which 5 ms to minimize.
[2024-05-29 03:08:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 458 ms
[2024-05-29 03:08:47] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 5 ms to minimize.
[2024-05-29 03:08:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 480 ms
TRAPS : Iteration 12
[2024-05-29 03:08:52] [INFO ] After 109039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2024-05-29 03:08:58] [INFO ] After 117669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Over-approximation ignoring read arcs solved 0 properties in 118773 ms.
[2024-05-29 03:08:58] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-29 03:08:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2155 places, 2053 transitions and 9929 arcs took 15 ms.
[2024-05-29 03:08:58] [INFO ] Flatten gal took : 237 ms
Total runtime 279121 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPt-PT-100B

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: 2155
TRANSITIONS: 2053
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.055s, Sys 0.006s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.008s, 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: 998
MODEL NAME: /home/mcc/execution/414/model
2155 places, 2053 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...

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-100B"
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 ShieldIIPt-PT-100B, 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 r355-tall-171683758600351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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