About the Execution of GreatSPN+red for EisenbergMcGuire-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
610.424 | 83399.00 | 159875.00 | 415.90 | TFFFTTFFTFTTTTFT | 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.r157-smll-171636265100146.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is EisenbergMcGuire-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265100146
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 12 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 12 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 121K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2023-12
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2023-14
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716478748953
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 15:39:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 15:39:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 15:39:10] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-23 15:39:10] [INFO ] Transformed 117 places.
[2024-05-23 15:39:10] [INFO ] Transformed 216 transitions.
[2024-05-23 15:39:10] [INFO ] Found NUPN structural information;
[2024-05-23 15:39:10] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 82 ms.
Support contains 75 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Applied a total of 0 rules in 20 ms. Remains 117 /117 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-23 15:39:11] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
// Phase 1: matrix 153 rows 117 cols
[2024-05-23 15:39:11] [INFO ] Computed 10 invariants in 21 ms
[2024-05-23 15:39:11] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-23 15:39:11] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2024-05-23 15:39:11] [INFO ] Invariant cache hit.
[2024-05-23 15:39:11] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 15:39:11] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-23 15:39:12] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2024-05-23 15:39:12] [INFO ] Invariant cache hit.
[2024-05-23 15:39:12] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 15:39:14] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 13 ms to minimize.
[2024-05-23 15:39:14] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 4 ms to minimize.
[2024-05-23 15:39:14] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-23 15:39:14] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-23 15:39:14] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-23 15:39:14] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-23 15:39:14] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-23 15:39:15] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-23 15:39:15] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
[2024-05-23 15:39:15] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-05-23 15:39:15] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-05-23 15:39:15] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 2 ms to minimize.
[2024-05-23 15:39:15] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-05-23 15:39:15] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-23 15:39:15] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-23 15:39:15] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-05-23 15:39:16] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-23 15:39:16] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2024-05-23 15:39:16] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-23 15:39:16] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 15:39:17] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-23 15:39:17] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 3 ms to minimize.
[2024-05-23 15:39:18] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-23 15:39:18] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-23 15:39:18] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-05-23 15:39:18] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-23 15:39:18] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-23 15:39:18] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-23 15:39:19] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-23 15:39:19] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 10/157 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 15:39:20] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-23 15:39:20] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-05-23 15:39:20] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 15:39:21] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 153/270 variables, 117/278 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 56/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 334 constraints, problems are : Problem set: 0 solved, 213 unsolved in 18558 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 34/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 153/270 variables, 117/278 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 56/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 213/547 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 15:39:34] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 4 ms to minimize.
[2024-05-23 15:39:34] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-05-23 15:39:34] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-23 15:39:34] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 4/551 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 15:39:40] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 15:39:43] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (OVERLAPS) 0/270 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 553 constraints, problems are : Problem set: 0 solved, 213 unsolved in 24970 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 40/40 constraints]
After SMT, in 43725ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 43754ms
Finished structural reductions in LTL mode , in 1 iterations and 44584 ms. Remains : 117/117 places, 216/216 transitions.
Support contains 75 out of 117 places after structural reductions.
[2024-05-23 15:39:56] [INFO ] Flatten gal took : 65 ms
[2024-05-23 15:39:56] [INFO ] Flatten gal took : 29 ms
[2024-05-23 15:39:56] [INFO ] Input system was already deterministic with 216 transitions.
RANDOM walk for 40000 steps (8 resets) in 3616 ms. (11 steps per ms) remains 46/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 40/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
[2024-05-23 15:39:57] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2024-05-23 15:39:57] [INFO ] Invariant cache hit.
[2024-05-23 15:39:57] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/51 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 2 solved, 38 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 3 (OVERLAPS) 67/117 variables, 6/57 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 67/124 constraints. Problems are: Problem set: 4 solved, 36 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 5 solved, 35 unsolved
[2024-05-23 15:39:58] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 3 ms to minimize.
[2024-05-23 15:39:58] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-23 15:39:58] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-23 15:39:58] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-23 15:39:58] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Problem AtomicPropp21 is UNSAT
[2024-05-23 15:39:59] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-23 15:39:59] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-23 15:39:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 15:39:59] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2024-05-23 15:39:59] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-23 15:39:59] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2024-05-23 15:39:59] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 12/139 constraints. Problems are: Problem set: 6 solved, 34 unsolved
[2024-05-23 15:39:59] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-05-23 15:39:59] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-05-23 15:39:59] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 2 ms to minimize.
[2024-05-23 15:39:59] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-05-23 15:40:00] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 5/144 constraints. Problems are: Problem set: 6 solved, 34 unsolved
[2024-05-23 15:40:00] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-05-23 15:40:00] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-23 15:40:00] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-23 15:40:00] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 4/148 constraints. Problems are: Problem set: 6 solved, 34 unsolved
[2024-05-23 15:40:00] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 1/149 constraints. Problems are: Problem set: 6 solved, 34 unsolved
[2024-05-23 15:40:01] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 1/150 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 0/150 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 153/270 variables, 117/267 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 56/323 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 0/323 constraints. Problems are: Problem set: 6 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/270 variables, and 323 constraints, problems are : Problem set: 6 solved, 34 unsolved in 5013 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 6 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 1/42 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/42 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 76/117 variables, 6/48 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 76/124 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/150 constraints. Problems are: Problem set: 6 solved, 34 unsolved
[2024-05-23 15:40:03] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 3 ms to minimize.
[2024-05-23 15:40:03] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-23 15:40:03] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 3/153 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/153 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 153/270 variables, 117/270 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 56/326 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 34/360 constraints. Problems are: Problem set: 6 solved, 34 unsolved
[2024-05-23 15:40:05] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 1/361 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 0/361 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 14 (OVERLAPS) 0/270 variables, 0/361 constraints. Problems are: Problem set: 6 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 361 constraints, problems are : Problem set: 6 solved, 34 unsolved in 4383 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 34/40 constraints, Known Traps: 27/27 constraints]
After SMT, in 9462ms problems are : Problem set: 6 solved, 34 unsolved
Fused 34 Parikh solutions to 32 different solutions.
Parikh walk visited 4 properties in 2672 ms.
Support contains 39 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 117 transition count 198
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 99 transition count 198
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 95 transition count 186
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 95 transition count 186
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 90 transition count 181
Applied a total of 54 rules in 62 ms. Remains 90 /117 variables (removed 27) and now considering 181/216 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 90/117 places, 181/216 transitions.
RANDOM walk for 40000 steps (8 resets) in 549 ms. (72 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
Probably explored full state space saw : 12498 states, properties seen :29
Probabilistic random walk after 49992 steps, saw 12498 distinct states, run finished after 606 ms. (steps per millisecond=82 ) properties seen :29
Explored full state space saw : 12498 states, properties seen :0
Exhaustive walk after 49992 steps, saw 12498 distinct states, run finished after 111 ms. (steps per millisecond=450 ) properties seen :0
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 18 ms
[2024-05-23 15:40:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 20 ms
[2024-05-23 15:40:11] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 68 out of 117 places (down from 71) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 9 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 111/117 places, 198/216 transitions.
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 14 ms
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 16 ms
[2024-05-23 15:40:11] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 9 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 112/117 places, 201/216 transitions.
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 13 ms
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 16 ms
[2024-05-23 15:40:11] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 9 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 112/117 places, 201/216 transitions.
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 13 ms
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 15 ms
[2024-05-23 15:40:11] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 115 transition count 214
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 4 place count 115 transition count 184
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 64 place count 85 transition count 184
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 79 transition count 166
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 79 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 73 transition count 160
Applied a total of 88 rules in 31 ms. Remains 73 /117 variables (removed 44) and now considering 160/216 (removed 56) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 73/117 places, 160/216 transitions.
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 10 ms
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 12 ms
[2024-05-23 15:40:11] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 7 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 112/117 places, 201/216 transitions.
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 12 ms
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 13 ms
[2024-05-23 15:40:11] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 6 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 111/117 places, 198/216 transitions.
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 12 ms
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 13 ms
[2024-05-23 15:40:11] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 5 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 112/117 places, 201/216 transitions.
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 10 ms
[2024-05-23 15:40:11] [INFO ] Flatten gal took : 11 ms
[2024-05-23 15:40:12] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 213
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 114 transition count 184
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 85 transition count 184
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 79 transition count 166
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 79 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 73 transition count 160
Applied a total of 88 rules in 23 ms. Remains 73 /117 variables (removed 44) and now considering 160/216 (removed 56) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 73/117 places, 160/216 transitions.
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 7 ms
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 8 ms
[2024-05-23 15:40:12] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 4 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 112/117 places, 201/216 transitions.
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 9 ms
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 10 ms
[2024-05-23 15:40:12] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 115 transition count 214
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 4 place count 115 transition count 185
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 62 place count 86 transition count 185
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 80 transition count 167
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 80 transition count 167
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 74 transition count 161
Applied a total of 86 rules in 22 ms. Remains 74 /117 variables (removed 43) and now considering 161/216 (removed 55) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 74/117 places, 161/216 transitions.
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 7 ms
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 8 ms
[2024-05-23 15:40:12] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 4 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 111/117 places, 198/216 transitions.
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 9 ms
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 9 ms
[2024-05-23 15:40:12] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 204
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 204
Applied a total of 8 rules in 3 ms. Remains 113 /117 variables (removed 4) and now considering 204/216 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 113/117 places, 204/216 transitions.
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 9 ms
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 10 ms
[2024-05-23 15:40:12] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 4 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 111/117 places, 198/216 transitions.
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 8 ms
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 10 ms
[2024-05-23 15:40:12] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 4 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 112/117 places, 201/216 transitions.
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 8 ms
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 9 ms
[2024-05-23 15:40:12] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 4 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 111/117 places, 198/216 transitions.
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 9 ms
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 10 ms
[2024-05-23 15:40:12] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 14 ms
[2024-05-23 15:40:12] [INFO ] Flatten gal took : 11 ms
[2024-05-23 15:40:12] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-05-23 15:40:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 216 transitions and 900 arcs took 4 ms.
Total runtime 61825 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running EisenbergMcGuire-PT-03
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 117
TRANSITIONS: 216
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]
SAVING FILE /home/mcc/execution/405/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 756
MODEL NAME: /home/mcc/execution/405/model
117 places, 216 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716478832352
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-03"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is EisenbergMcGuire-PT-03, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r157-smll-171636265100146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-03.tgz
mv EisenbergMcGuire-PT-03 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;