About the Execution of GreatSPN+red for Anderson-PT-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11654.264 | 3600000.00 | 14143210.00 | 419.10 | F??????TT??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.r003-smll-171620117600369.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 Anderson-PT-11, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117600369
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.4K 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 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 15:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 15:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-11-CTLCardinality-2024-00
FORMULA_NAME Anderson-PT-11-CTLCardinality-2024-01
FORMULA_NAME Anderson-PT-11-CTLCardinality-2024-02
FORMULA_NAME Anderson-PT-11-CTLCardinality-2024-03
FORMULA_NAME Anderson-PT-11-CTLCardinality-2024-04
FORMULA_NAME Anderson-PT-11-CTLCardinality-2024-05
FORMULA_NAME Anderson-PT-11-CTLCardinality-2024-06
FORMULA_NAME Anderson-PT-11-CTLCardinality-2024-07
FORMULA_NAME Anderson-PT-11-CTLCardinality-2024-08
FORMULA_NAME Anderson-PT-11-CTLCardinality-2024-09
FORMULA_NAME Anderson-PT-11-CTLCardinality-2024-10
FORMULA_NAME Anderson-PT-11-CTLCardinality-2024-11
FORMULA_NAME Anderson-PT-11-CTLCardinality-2023-12
FORMULA_NAME Anderson-PT-11-CTLCardinality-2023-13
FORMULA_NAME Anderson-PT-11-CTLCardinality-2023-14
FORMULA_NAME Anderson-PT-11-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716457190156
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 09:39:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 09:39:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 09:39:52] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2024-05-23 09:39:52] [INFO ] Transformed 749 places.
[2024-05-23 09:39:52] [INFO ] Transformed 3245 transitions.
[2024-05-23 09:39:52] [INFO ] Found NUPN structural information;
[2024-05-23 09:39:52] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 629 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
FORMULA Anderson-PT-11-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 119 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Discarding 164 places :
Symmetric choice reduction at 0 with 164 rule applications. Total rules 164 place count 585 transition count 1221
Iterating global reduction 0 with 164 rules applied. Total rules applied 328 place count 585 transition count 1221
Applied a total of 328 rules in 184 ms. Remains 585 /749 variables (removed 164) and now considering 1221/3245 (removed 2024) transitions.
// Phase 1: matrix 1221 rows 585 cols
[2024-05-23 09:39:53] [INFO ] Computed 25 invariants in 88 ms
[2024-05-23 09:39:54] [INFO ] Implicit Places using invariants in 1700 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1757 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 584/749 places, 1221/3245 transitions.
Applied a total of 0 rules in 41 ms. Remains 584 /584 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2019 ms. Remains : 584/749 places, 1221/3245 transitions.
Support contains 119 out of 584 places after structural reductions.
[2024-05-23 09:39:55] [INFO ] Flatten gal took : 194 ms
[2024-05-23 09:39:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Anderson-PT-11-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 09:39:55] [INFO ] Flatten gal took : 113 ms
[2024-05-23 09:39:55] [INFO ] Input system was already deterministic with 1221 transitions.
Support contains 100 out of 584 places (down from 119) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2919 ms. (13 steps per ms) remains 11/61 properties
BEST_FIRST walk for 40003 steps (8 resets) in 301 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 186 ms. (213 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 232 ms. (171 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 148 ms. (268 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 233 ms. (170 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
// Phase 1: matrix 1221 rows 584 cols
[2024-05-23 09:39:57] [INFO ] Computed 24 invariants in 28 ms
[2024-05-23 09:39:57] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 556/573 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/573 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1/574 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 10/584 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 09:39:59] [INFO ] Deduced a trap composed of 221 places in 628 ms of which 67 ms to minimize.
[2024-05-23 09:39:59] [INFO ] Deduced a trap composed of 198 places in 564 ms of which 8 ms to minimize.
[2024-05-23 09:40:00] [INFO ] Deduced a trap composed of 216 places in 517 ms of which 11 ms to minimize.
[2024-05-23 09:40:00] [INFO ] Deduced a trap composed of 249 places in 590 ms of which 7 ms to minimize.
[2024-05-23 09:40:01] [INFO ] Deduced a trap composed of 212 places in 596 ms of which 6 ms to minimize.
[2024-05-23 09:40:02] [INFO ] Deduced a trap composed of 281 places in 551 ms of which 7 ms to minimize.
[2024-05-23 09:40:02] [INFO ] Deduced a trap composed of 255 places in 578 ms of which 8 ms to minimize.
SMT process timed out in 5114ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 584 transition count 1106
Reduce places removed 115 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 116 rules applied. Total rules applied 231 place count 469 transition count 1105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 468 transition count 1105
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 232 place count 468 transition count 1004
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 434 place count 367 transition count 1004
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 481 place count 320 transition count 617
Iterating global reduction 3 with 47 rules applied. Total rules applied 528 place count 320 transition count 617
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 546 place count 311 transition count 608
Applied a total of 546 rules in 152 ms. Remains 311 /584 variables (removed 273) and now considering 608/1221 (removed 613) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 311/584 places, 608/1221 transitions.
RANDOM walk for 40000 steps (8 resets) in 492 ms. (81 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
// Phase 1: matrix 608 rows 311 cols
[2024-05-23 09:40:03] [INFO ] Computed 24 invariants in 6 ms
[2024-05-23 09:40:03] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 284/298 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 3/301 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 10/311 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 608/919 variables, 311/335 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/919 variables, 110/445 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/919 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/919 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 919/919 variables, and 445 constraints, problems are : Problem set: 0 solved, 7 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 311/311 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 284/298 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 3/301 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp43 is UNSAT
At refinement iteration 6 (OVERLAPS) 10/311 variables, 10/24 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-23 09:40:04] [INFO ] Deduced a trap composed of 144 places in 231 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-23 09:40:05] [INFO ] Deduced a trap composed of 133 places in 228 ms of which 4 ms to minimize.
[2024-05-23 09:40:05] [INFO ] Deduced a trap composed of 124 places in 238 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 2/27 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 608/919 variables, 311/338 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/919 variables, 110/448 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/919 variables, 6/454 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/919 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/919 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 919/919 variables, and 454 constraints, problems are : Problem set: 1 solved, 6 unsolved in 2462 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 311/311 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 3352ms problems are : Problem set: 1 solved, 6 unsolved
Parikh walk visited 1 properties in 927 ms.
Support contains 6 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 608/608 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 311 transition count 603
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 306 transition count 603
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 302 transition count 599
Applied a total of 18 rules in 43 ms. Remains 302 /311 variables (removed 9) and now considering 599/608 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 302/311 places, 599/608 transitions.
RANDOM walk for 40000 steps (8 resets) in 214 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/5 properties
// Phase 1: matrix 599 rows 302 cols
[2024-05-23 09:40:07] [INFO ] Computed 24 invariants in 4 ms
[2024-05-23 09:40:07] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 269/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/280 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 21/301 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/302 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 599/901 variables, 302/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/901 variables, 110/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/901 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/901 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 901/901 variables, and 436 constraints, problems are : Problem set: 0 solved, 3 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 302/302 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 269/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/280 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 21/301 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/302 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 599/901 variables, 302/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/901 variables, 110/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/901 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/901 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/901 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 901/901 variables, and 439 constraints, problems are : Problem set: 0 solved, 3 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 302/302 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1349ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 200 ms.
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 599/599 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 300 transition count 597
Applied a total of 4 rules in 29 ms. Remains 300 /302 variables (removed 2) and now considering 597/599 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 300/302 places, 597/599 transitions.
RANDOM walk for 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 735400 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :2 out of 3
Probabilistic random walk after 735400 steps, saw 539546 distinct states, run finished after 3009 ms. (steps per millisecond=244 ) properties seen :2
// Phase 1: matrix 597 rows 300 cols
[2024-05-23 09:40:12] [INFO ] Computed 24 invariants in 5 ms
[2024-05-23 09:40:12] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 267/269 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/278 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/300 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 597/897 variables, 300/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/897 variables, 110/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/897 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/897 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 897/897 variables, and 434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 300/300 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 267/269 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/278 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/300 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 597/897 variables, 300/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/897 variables, 110/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/897 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/897 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/897 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 897/897 variables, and 435 constraints, problems are : Problem set: 0 solved, 1 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 300/300 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 852ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 597/597 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 298 transition count 595
Applied a total of 4 rules in 27 ms. Remains 298 /300 variables (removed 2) and now considering 595/597 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 298/300 places, 595/597 transitions.
RANDOM walk for 40000 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 945801 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :0 out of 1
Probabilistic random walk after 945801 steps, saw 690881 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
// Phase 1: matrix 595 rows 298 cols
[2024-05-23 09:40:16] [INFO ] Computed 24 invariants in 5 ms
[2024-05-23 09:40:16] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 265/267 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/276 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/298 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 595/893 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/893 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/893 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/893 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 893/893 variables, and 432 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 265/267 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/276 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/298 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 595/893 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/893 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/893 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/893 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/893 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 893/893 variables, and 433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 869ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 17 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 298/298 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 18 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-23 09:40:17] [INFO ] Invariant cache hit.
[2024-05-23 09:40:18] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-23 09:40:18] [INFO ] Invariant cache hit.
[2024-05-23 09:40:18] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 09:40:19] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
[2024-05-23 09:40:19] [INFO ] Redundant transitions in 37 ms returned []
Running 584 sub problems to find dead transitions.
[2024-05-23 09:40:19] [INFO ] Invariant cache hit.
[2024-05-23 09:40:19] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-23 09:40:26] [INFO ] Deduced a trap composed of 108 places in 217 ms of which 4 ms to minimize.
[2024-05-23 09:40:28] [INFO ] Deduced a trap composed of 76 places in 295 ms of which 4 ms to minimize.
[2024-05-23 09:40:28] [INFO ] Deduced a trap composed of 102 places in 270 ms of which 3 ms to minimize.
[2024-05-23 09:40:28] [INFO ] Deduced a trap composed of 80 places in 285 ms of which 4 ms to minimize.
[2024-05-23 09:40:29] [INFO ] Deduced a trap composed of 84 places in 277 ms of which 3 ms to minimize.
[2024-05-23 09:40:29] [INFO ] Deduced a trap composed of 70 places in 199 ms of which 3 ms to minimize.
[2024-05-23 09:40:29] [INFO ] Deduced a trap composed of 96 places in 277 ms of which 4 ms to minimize.
[2024-05-23 09:40:29] [INFO ] Deduced a trap composed of 88 places in 267 ms of which 3 ms to minimize.
[2024-05-23 09:40:30] [INFO ] Deduced a trap composed of 61 places in 271 ms of which 3 ms to minimize.
[2024-05-23 09:40:30] [INFO ] Deduced a trap composed of 76 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:40:30] [INFO ] Deduced a trap composed of 71 places in 267 ms of which 3 ms to minimize.
[2024-05-23 09:40:30] [INFO ] Deduced a trap composed of 70 places in 223 ms of which 3 ms to minimize.
[2024-05-23 09:40:31] [INFO ] Deduced a trap composed of 68 places in 251 ms of which 3 ms to minimize.
[2024-05-23 09:40:31] [INFO ] Deduced a trap composed of 81 places in 233 ms of which 3 ms to minimize.
[2024-05-23 09:40:31] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 3 ms to minimize.
[2024-05-23 09:40:31] [INFO ] Deduced a trap composed of 133 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:40:32] [INFO ] Deduced a trap composed of 94 places in 263 ms of which 3 ms to minimize.
[2024-05-23 09:40:32] [INFO ] Deduced a trap composed of 109 places in 375 ms of which 5 ms to minimize.
[2024-05-23 09:40:32] [INFO ] Deduced a trap composed of 99 places in 312 ms of which 3 ms to minimize.
[2024-05-23 09:40:33] [INFO ] Deduced a trap composed of 107 places in 253 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-23 09:40:35] [INFO ] Deduced a trap composed of 104 places in 306 ms of which 3 ms to minimize.
[2024-05-23 09:40:36] [INFO ] Deduced a trap composed of 152 places in 237 ms of which 4 ms to minimize.
[2024-05-23 09:40:36] [INFO ] Deduced a trap composed of 145 places in 212 ms of which 3 ms to minimize.
[2024-05-23 09:40:36] [INFO ] Deduced a trap composed of 158 places in 248 ms of which 4 ms to minimize.
[2024-05-23 09:40:37] [INFO ] Deduced a trap composed of 135 places in 272 ms of which 5 ms to minimize.
[2024-05-23 09:40:37] [INFO ] Deduced a trap composed of 108 places in 267 ms of which 3 ms to minimize.
[2024-05-23 09:40:37] [INFO ] Deduced a trap composed of 139 places in 287 ms of which 4 ms to minimize.
[2024-05-23 09:40:37] [INFO ] Deduced a trap composed of 131 places in 256 ms of which 3 ms to minimize.
[2024-05-23 09:40:38] [INFO ] Deduced a trap composed of 134 places in 246 ms of which 3 ms to minimize.
[2024-05-23 09:40:38] [INFO ] Deduced a trap composed of 133 places in 265 ms of which 4 ms to minimize.
[2024-05-23 09:40:38] [INFO ] Deduced a trap composed of 136 places in 267 ms of which 3 ms to minimize.
[2024-05-23 09:40:39] [INFO ] Deduced a trap composed of 114 places in 272 ms of which 3 ms to minimize.
[2024-05-23 09:40:39] [INFO ] Deduced a trap composed of 114 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:40:39] [INFO ] Deduced a trap composed of 128 places in 333 ms of which 3 ms to minimize.
[2024-05-23 09:40:40] [INFO ] Deduced a trap composed of 139 places in 258 ms of which 4 ms to minimize.
[2024-05-23 09:40:40] [INFO ] Deduced a trap composed of 120 places in 289 ms of which 4 ms to minimize.
[2024-05-23 09:40:40] [INFO ] Deduced a trap composed of 128 places in 255 ms of which 4 ms to minimize.
[2024-05-23 09:40:40] [INFO ] Deduced a trap composed of 100 places in 258 ms of which 3 ms to minimize.
[2024-05-23 09:40:41] [INFO ] Deduced a trap composed of 84 places in 288 ms of which 4 ms to minimize.
[2024-05-23 09:40:41] [INFO ] Deduced a trap composed of 81 places in 273 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (OVERLAPS) 1/298 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 298/893 variables, and 64 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 40/63 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/893 variables, and 63 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/584 constraints, Known Traps: 40/40 constraints]
After SMT, in 60825ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60838ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62768 ms. Remains : 298/298 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 120 Pre rules applied. Total rules applied 0 place count 298 transition count 475
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 0 with 240 rules applied. Total rules applied 240 place count 178 transition count 475
Applied a total of 240 rules in 23 ms. Remains 178 /298 variables (removed 120) and now considering 475/595 (removed 120) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 475 rows 178 cols
[2024-05-23 09:41:20] [INFO ] Computed 24 invariants in 3 ms
[2024-05-23 09:41:20] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 09:41:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-23 09:41:20] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 14 ms returned sat
[2024-05-23 09:41:20] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 09:41:20] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 09:41:20] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 555 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA Anderson-PT-11-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 09:41:20] [INFO ] Flatten gal took : 72 ms
[2024-05-23 09:41:21] [INFO ] Flatten gal took : 70 ms
[2024-05-23 09:41:21] [INFO ] Input system was already deterministic with 1221 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 533 transition count 850
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 533 transition count 850
Applied a total of 102 rules in 24 ms. Remains 533 /584 variables (removed 51) and now considering 850/1221 (removed 371) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 533/584 places, 850/1221 transitions.
[2024-05-23 09:41:21] [INFO ] Flatten gal took : 34 ms
[2024-05-23 09:41:21] [INFO ] Flatten gal took : 37 ms
[2024-05-23 09:41:21] [INFO ] Input system was already deterministic with 850 transitions.
Starting structural reductions in LTL mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 532 transition count 849
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 532 transition count 849
Applied a total of 104 rules in 23 ms. Remains 532 /584 variables (removed 52) and now considering 849/1221 (removed 372) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 532/584 places, 849/1221 transitions.
[2024-05-23 09:41:21] [INFO ] Flatten gal took : 28 ms
[2024-05-23 09:41:21] [INFO ] Flatten gal took : 30 ms
[2024-05-23 09:41:21] [INFO ] Input system was already deterministic with 849 transitions.
Starting structural reductions in LTL mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 538 transition count 895
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 538 transition count 895
Applied a total of 92 rules in 23 ms. Remains 538 /584 variables (removed 46) and now considering 895/1221 (removed 326) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 538/584 places, 895/1221 transitions.
[2024-05-23 09:41:21] [INFO ] Flatten gal took : 28 ms
[2024-05-23 09:41:21] [INFO ] Flatten gal took : 32 ms
[2024-05-23 09:41:21] [INFO ] Input system was already deterministic with 895 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 584 transition count 1104
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 235 place count 467 transition count 1103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 236 place count 466 transition count 1103
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 236 place count 466 transition count 995
Deduced a syphon composed of 108 places in 1 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 452 place count 358 transition count 995
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 504 place count 306 transition count 663
Iterating global reduction 3 with 52 rules applied. Total rules applied 556 place count 306 transition count 663
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 558 place count 305 transition count 662
Applied a total of 558 rules in 74 ms. Remains 305 /584 variables (removed 279) and now considering 662/1221 (removed 559) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 305/584 places, 662/1221 transitions.
[2024-05-23 09:41:21] [INFO ] Flatten gal took : 23 ms
[2024-05-23 09:41:21] [INFO ] Flatten gal took : 25 ms
[2024-05-23 09:41:22] [INFO ] Input system was already deterministic with 662 transitions.
Starting structural reductions in LTL mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 538 transition count 915
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 538 transition count 915
Applied a total of 92 rules in 22 ms. Remains 538 /584 variables (removed 46) and now considering 915/1221 (removed 306) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 538/584 places, 915/1221 transitions.
[2024-05-23 09:41:22] [INFO ] Flatten gal took : 29 ms
[2024-05-23 09:41:22] [INFO ] Flatten gal took : 33 ms
[2024-05-23 09:41:22] [INFO ] Input system was already deterministic with 915 transitions.
Starting structural reductions in LTL mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 530 transition count 827
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 530 transition count 827
Applied a total of 108 rules in 23 ms. Remains 530 /584 variables (removed 54) and now considering 827/1221 (removed 394) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 530/584 places, 827/1221 transitions.
[2024-05-23 09:41:22] [INFO ] Flatten gal took : 26 ms
[2024-05-23 09:41:22] [INFO ] Flatten gal took : 28 ms
[2024-05-23 09:41:22] [INFO ] Input system was already deterministic with 827 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 584 transition count 1122
Reduce places removed 99 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 110 rules applied. Total rules applied 209 place count 485 transition count 1111
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 220 place count 474 transition count 1111
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 220 place count 474 transition count 1001
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 440 place count 364 transition count 1001
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 496 place count 308 transition count 605
Iterating global reduction 3 with 56 rules applied. Total rules applied 552 place count 308 transition count 605
Applied a total of 552 rules in 51 ms. Remains 308 /584 variables (removed 276) and now considering 605/1221 (removed 616) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 308/584 places, 605/1221 transitions.
[2024-05-23 09:41:22] [INFO ] Flatten gal took : 19 ms
[2024-05-23 09:41:22] [INFO ] Flatten gal took : 21 ms
[2024-05-23 09:41:22] [INFO ] Input system was already deterministic with 605 transitions.
RANDOM walk for 40 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-11-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 584 transition count 1103
Reduce places removed 118 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 120 rules applied. Total rules applied 238 place count 466 transition count 1101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 240 place count 464 transition count 1101
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 240 place count 464 transition count 1004
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 434 place count 367 transition count 1004
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 481 place count 320 transition count 637
Iterating global reduction 3 with 47 rules applied. Total rules applied 528 place count 320 transition count 637
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 544 place count 312 transition count 629
Applied a total of 544 rules in 78 ms. Remains 312 /584 variables (removed 272) and now considering 629/1221 (removed 592) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78 ms. Remains : 312/584 places, 629/1221 transitions.
[2024-05-23 09:41:22] [INFO ] Flatten gal took : 24 ms
[2024-05-23 09:41:22] [INFO ] Flatten gal took : 26 ms
[2024-05-23 09:41:22] [INFO ] Input system was already deterministic with 629 transitions.
Starting structural reductions in LTL mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 532 transition count 869
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 532 transition count 869
Applied a total of 104 rules in 31 ms. Remains 532 /584 variables (removed 52) and now considering 869/1221 (removed 352) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 532/584 places, 869/1221 transitions.
[2024-05-23 09:41:22] [INFO ] Flatten gal took : 30 ms
[2024-05-23 09:41:22] [INFO ] Flatten gal took : 31 ms
[2024-05-23 09:41:22] [INFO ] Input system was already deterministic with 869 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 584 transition count 1100
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 463 transition count 1100
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 242 place count 463 transition count 990
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 462 place count 353 transition count 990
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 518 place count 297 transition count 594
Iterating global reduction 2 with 56 rules applied. Total rules applied 574 place count 297 transition count 594
Applied a total of 574 rules in 47 ms. Remains 297 /584 variables (removed 287) and now considering 594/1221 (removed 627) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 297/584 places, 594/1221 transitions.
[2024-05-23 09:41:23] [INFO ] Flatten gal took : 20 ms
[2024-05-23 09:41:23] [INFO ] Flatten gal took : 23 ms
[2024-05-23 09:41:23] [INFO ] Input system was already deterministic with 594 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 584 transition count 1102
Reduce places removed 119 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 121 rules applied. Total rules applied 240 place count 465 transition count 1100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 463 transition count 1100
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 242 place count 463 transition count 990
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 462 place count 353 transition count 990
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 518 place count 297 transition count 594
Iterating global reduction 3 with 56 rules applied. Total rules applied 574 place count 297 transition count 594
Applied a total of 574 rules in 51 ms. Remains 297 /584 variables (removed 287) and now considering 594/1221 (removed 627) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 297/584 places, 594/1221 transitions.
[2024-05-23 09:41:23] [INFO ] Flatten gal took : 20 ms
[2024-05-23 09:41:23] [INFO ] Flatten gal took : 25 ms
[2024-05-23 09:41:23] [INFO ] Input system was already deterministic with 594 transitions.
Starting structural reductions in LTL mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 529 transition count 846
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 529 transition count 846
Applied a total of 110 rules in 22 ms. Remains 529 /584 variables (removed 55) and now considering 846/1221 (removed 375) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 529/584 places, 846/1221 transitions.
[2024-05-23 09:41:23] [INFO ] Flatten gal took : 22 ms
[2024-05-23 09:41:23] [INFO ] Flatten gal took : 26 ms
[2024-05-23 09:41:23] [INFO ] Input system was already deterministic with 846 transitions.
Starting structural reductions in LTL mode, iteration 0 : 584/584 places, 1221/1221 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 530 transition count 827
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 530 transition count 827
Applied a total of 108 rules in 23 ms. Remains 530 /584 variables (removed 54) and now considering 827/1221 (removed 394) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 530/584 places, 827/1221 transitions.
[2024-05-23 09:41:23] [INFO ] Flatten gal took : 22 ms
[2024-05-23 09:41:23] [INFO ] Flatten gal took : 23 ms
[2024-05-23 09:41:23] [INFO ] Input system was already deterministic with 827 transitions.
[2024-05-23 09:41:23] [INFO ] Flatten gal took : 37 ms
[2024-05-23 09:41:23] [INFO ] Flatten gal took : 38 ms
[2024-05-23 09:41:23] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-05-23 09:41:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 584 places, 1221 transitions and 4344 arcs took 10 ms.
Total runtime 91695 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Anderson-PT-11
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 584
TRANSITIONS: 1221
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.032s, Sys 0.002s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.006s, 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: 757
MODEL NAME: /home/mcc/execution/412/model
584 places, 1221 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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.
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//
++ 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 CTLCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-11"
export BK_EXAMINATION="CTLCardinality"
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 Anderson-PT-11, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r003-smll-171620117600369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-11.tgz
mv Anderson-PT-11 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;