About the Execution of GreatSPN+red for CANConstruction-PT-040
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12860.027 | 3600000.00 | 5756810.00 | 7163.30 | F???????F?T???T? | 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.r069-tall-171620503700033.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 CANConstruction-PT-040, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503700033
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 18:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.5M 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 CANConstruction-PT-040-CTLCardinality-2024-00
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-01
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-02
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-03
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-04
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-05
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-06
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-07
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-08
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-09
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-10
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-11
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2023-12
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2023-13
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2023-14
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716363911203
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:45:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:45:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:45:12] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-05-22 07:45:12] [INFO ] Transformed 3682 places.
[2024-05-22 07:45:12] [INFO ] Transformed 6720 transitions.
[2024-05-22 07:45:12] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Support contains 192 out of 3682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Discarding 1438 places :
Symmetric choice reduction at 0 with 1438 rule applications. Total rules 1438 place count 2244 transition count 3844
Iterating global reduction 0 with 1438 rules applied. Total rules applied 2876 place count 2244 transition count 3844
Applied a total of 2876 rules in 451 ms. Remains 2244 /3682 variables (removed 1438) and now considering 3844/6720 (removed 2876) transitions.
// Phase 1: matrix 3844 rows 2244 cols
[2024-05-22 07:45:13] [INFO ] Computed 81 invariants in 83 ms
[2024-05-22 07:45:14] [INFO ] Implicit Places using invariants in 1569 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 404, 418, 432, 446, 460, 474, 488, 502, 530, 544, 558]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1608 ms to find 38 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2206/3682 places, 3844/6720 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 2172 transition count 3810
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 2172 transition count 3810
Applied a total of 68 rules in 238 ms. Remains 2172 /2206 variables (removed 34) and now considering 3810/3844 (removed 34) transitions.
// Phase 1: matrix 3810 rows 2172 cols
[2024-05-22 07:45:15] [INFO ] Computed 43 invariants in 50 ms
[2024-05-22 07:45:16] [INFO ] Implicit Places using invariants in 1068 ms returned []
[2024-05-22 07:45:16] [INFO ] Invariant cache hit.
[2024-05-22 07:45:17] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 07:45:38] [INFO ] Implicit Places using invariants and state equation in 22413 ms returned []
Implicit Place search using SMT with State Equation took 23486 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2172/3682 places, 3810/6720 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25802 ms. Remains : 2172/3682 places, 3810/6720 transitions.
Support contains 192 out of 2172 places after structural reductions.
[2024-05-22 07:45:39] [INFO ] Flatten gal took : 201 ms
[2024-05-22 07:45:39] [INFO ] Flatten gal took : 141 ms
[2024-05-22 07:45:39] [INFO ] Input system was already deterministic with 3810 transitions.
Support contains 183 out of 2172 places (down from 192) after GAL structural reductions.
RANDOM walk for 40000 steps (55 resets) in 2898 ms. (13 steps per ms) remains 31/99 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 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 23 ms. (166 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 18 ms. (210 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 16 ms. (235 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 17 ms. (222 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 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 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 13 ms. (286 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 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 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 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 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 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 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
[2024-05-22 07:45:40] [INFO ] Invariant cache hit.
[2024-05-22 07:45:40] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp96 is UNSAT
At refinement iteration 1 (OVERLAPS) 2090/2163 variables, 34/34 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2163 variables, 1/35 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2163 variables, 0/35 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 7/2170 variables, 7/42 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2170 variables, 0/42 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 1/2171 variables, 1/43 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2171 variables, 0/43 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 3810/5981 variables, 2171/2214 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5981 variables, 3160/5374 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5981 variables, 0/5374 constraints. Problems are: Problem set: 14 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5982/5982 variables, and 5375 constraints, problems are : Problem set: 14 solved, 16 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2172/2172 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 2109/2156 variables, 28/28 constraints. Problems are: Problem set: 14 solved, 16 unsolved
[2024-05-22 07:45:47] [INFO ] Deduced a trap composed of 5 places in 1445 ms of which 102 ms to minimize.
[2024-05-22 07:45:48] [INFO ] Deduced a trap composed of 5 places in 1288 ms of which 14 ms to minimize.
[2024-05-22 07:45:49] [INFO ] Deduced a trap composed of 53 places in 407 ms of which 7 ms to minimize.
[2024-05-22 07:45:49] [INFO ] Deduced a trap composed of 56 places in 363 ms of which 6 ms to minimize.
[2024-05-22 07:45:50] [INFO ] Deduced a trap composed of 53 places in 387 ms of which 7 ms to minimize.
[2024-05-22 07:45:50] [INFO ] Deduced a trap composed of 56 places in 368 ms of which 6 ms to minimize.
[2024-05-22 07:45:50] [INFO ] Deduced a trap composed of 55 places in 363 ms of which 5 ms to minimize.
SMT process timed out in 10263ms, After SMT, problems are : Problem set: 14 solved, 16 unsolved
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 47 out of 2172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 247 rules applied. Total rules applied 247 place count 2172 transition count 3563
Reduce places removed 247 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 248 rules applied. Total rules applied 495 place count 1925 transition count 3562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 496 place count 1924 transition count 3562
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 496 place count 1924 transition count 3524
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 572 place count 1886 transition count 3524
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 633 place count 1825 transition count 3402
Iterating global reduction 3 with 61 rules applied. Total rules applied 694 place count 1825 transition count 3402
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 17 rules applied. Total rules applied 711 place count 1825 transition count 3385
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 728 place count 1808 transition count 3385
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 5 with 108 rules applied. Total rules applied 836 place count 1754 transition count 3331
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 838 place count 1754 transition count 3329
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 840 place count 1752 transition count 3329
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 841 place count 1752 transition count 3328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 842 place count 1751 transition count 3328
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 845 place count 1751 transition count 3328
Applied a total of 845 rules in 1271 ms. Remains 1751 /2172 variables (removed 421) and now considering 3328/3810 (removed 482) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1272 ms. Remains : 1751/2172 places, 3328/3810 transitions.
RANDOM walk for 40000 steps (142 resets) in 910 ms. (43 steps per ms) remains 7/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 7/7 properties
// Phase 1: matrix 3328 rows 1751 cols
[2024-05-22 07:45:52] [INFO ] Computed 43 invariants in 24 ms
[2024-05-22 07:45:52] [INFO ] State equation strengthened by 3163 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1696/1729 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1729 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 19/1748 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1748 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1750 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1750 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 3328/5078 variables, 1750/1793 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5078 variables, 3163/4956 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5078 variables, 0/4956 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/5079 variables, 1/4957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5079 variables, 0/4957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/5079 variables, 0/4957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5079/5079 variables, and 4957 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3853 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1751/1751 constraints, ReadFeed: 3163/3163 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1696/1729 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 07:45:57] [INFO ] Deduced a trap composed of 2 places in 963 ms of which 9 ms to minimize.
[2024-05-22 07:45:57] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 3 ms to minimize.
[2024-05-22 07:45:58] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 4 ms to minimize.
[2024-05-22 07:45:58] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:45:58] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:45:58] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:45:58] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:45:59] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 3 ms to minimize.
[2024-05-22 07:45:59] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:45:59] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:45:59] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 4 ms to minimize.
[2024-05-22 07:45:59] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:45:59] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:45:59] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:46:00] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:46:00] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:46:00] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:46:00] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
Problem AtomicPropp50 is UNSAT
[2024-05-22 07:46:00] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:46:00] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 3 ms to minimize.
Problem AtomicPropp50 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1729 variables, 20/42 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 07:46:01] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 3 ms to minimize.
[2024-05-22 07:46:01] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:46:01] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:46:01] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:46:01] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:46:01] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:46:02] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:46:02] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 5 ms to minimize.
[2024-05-22 07:46:02] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:46:02] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:46:02] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:46:02] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1729 variables, 12/54 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 07:46:03] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1729 variables, 1/55 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 07:46:03] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 2 ms to minimize.
[2024-05-22 07:46:03] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:46:03] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:46:03] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-22 07:46:04] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:46:04] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:46:04] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:46:04] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 2 ms to minimize.
[2024-05-22 07:46:04] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
[2024-05-22 07:46:04] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:46:04] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-05-22 07:46:04] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:46:05] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 3 ms to minimize.
[2024-05-22 07:46:05] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:46:05] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:46:05] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 6 ms to minimize.
[2024-05-22 07:46:05] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1729 variables, 17/72 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 07:46:05] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
[2024-05-22 07:46:06] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1729 variables, 2/74 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 07:46:06] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:46:06] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1729 variables, 2/76 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1729 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 19/1748 variables, 19/95 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 07:46:08] [INFO ] Deduced a trap composed of 43 places in 1236 ms of which 12 ms to minimize.
[2024-05-22 07:46:09] [INFO ] Deduced a trap composed of 47 places in 1181 ms of which 11 ms to minimize.
[2024-05-22 07:46:10] [INFO ] Deduced a trap composed of 45 places in 1191 ms of which 13 ms to minimize.
[2024-05-22 07:46:11] [INFO ] Deduced a trap composed of 45 places in 1152 ms of which 11 ms to minimize.
[2024-05-22 07:46:12] [INFO ] Deduced a trap composed of 46 places in 1173 ms of which 12 ms to minimize.
[2024-05-22 07:46:14] [INFO ] Deduced a trap composed of 49 places in 1208 ms of which 11 ms to minimize.
[2024-05-22 07:46:15] [INFO ] Deduced a trap composed of 43 places in 1101 ms of which 11 ms to minimize.
[2024-05-22 07:46:16] [INFO ] Deduced a trap composed of 44 places in 1128 ms of which 11 ms to minimize.
[2024-05-22 07:46:17] [INFO ] Deduced a trap composed of 43 places in 1114 ms of which 11 ms to minimize.
[2024-05-22 07:46:18] [INFO ] Deduced a trap composed of 43 places in 1107 ms of which 10 ms to minimize.
[2024-05-22 07:46:19] [INFO ] Deduced a trap composed of 43 places in 1092 ms of which 11 ms to minimize.
[2024-05-22 07:46:20] [INFO ] Deduced a trap composed of 43 places in 1114 ms of which 11 ms to minimize.
[2024-05-22 07:46:22] [INFO ] Deduced a trap composed of 45 places in 1076 ms of which 10 ms to minimize.
[2024-05-22 07:46:23] [INFO ] Deduced a trap composed of 43 places in 1065 ms of which 11 ms to minimize.
[2024-05-22 07:46:24] [INFO ] Deduced a trap composed of 43 places in 1087 ms of which 11 ms to minimize.
[2024-05-22 07:46:25] [INFO ] Deduced a trap composed of 43 places in 1060 ms of which 10 ms to minimize.
[2024-05-22 07:46:26] [INFO ] Deduced a trap composed of 43 places in 1053 ms of which 11 ms to minimize.
[2024-05-22 07:46:27] [INFO ] Deduced a trap composed of 50 places in 1045 ms of which 11 ms to minimize.
[2024-05-22 07:46:28] [INFO ] Deduced a trap composed of 44 places in 1085 ms of which 11 ms to minimize.
[2024-05-22 07:46:29] [INFO ] Deduced a trap composed of 43 places in 1060 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1748 variables, 20/115 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 07:46:30] [INFO ] Deduced a trap composed of 43 places in 1070 ms of which 10 ms to minimize.
[2024-05-22 07:46:31] [INFO ] Deduced a trap composed of 43 places in 1074 ms of which 11 ms to minimize.
[2024-05-22 07:46:33] [INFO ] Deduced a trap composed of 43 places in 1128 ms of which 10 ms to minimize.
[2024-05-22 07:46:34] [INFO ] Deduced a trap composed of 46 places in 1064 ms of which 10 ms to minimize.
[2024-05-22 07:46:35] [INFO ] Deduced a trap composed of 50 places in 1062 ms of which 11 ms to minimize.
[2024-05-22 07:46:36] [INFO ] Deduced a trap composed of 50 places in 1073 ms of which 10 ms to minimize.
[2024-05-22 07:46:37] [INFO ] Deduced a trap composed of 47 places in 1059 ms of which 10 ms to minimize.
[2024-05-22 07:46:38] [INFO ] Deduced a trap composed of 45 places in 1052 ms of which 11 ms to minimize.
[2024-05-22 07:46:39] [INFO ] Deduced a trap composed of 43 places in 1028 ms of which 11 ms to minimize.
[2024-05-22 07:46:40] [INFO ] Deduced a trap composed of 46 places in 986 ms of which 11 ms to minimize.
[2024-05-22 07:46:41] [INFO ] Deduced a trap composed of 43 places in 1036 ms of which 10 ms to minimize.
SMT process timed out in 49061ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 29 out of 1751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1751/1751 places, 3328/3328 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1744 transition count 3314
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1744 transition count 3314
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 0 with 2 rules applied. Total rules applied 16 place count 1743 transition count 3313
Applied a total of 16 rules in 498 ms. Remains 1743 /1751 variables (removed 8) and now considering 3313/3328 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 1743/1751 places, 3313/3328 transitions.
RANDOM walk for 40000 steps (144 resets) in 746 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 117316 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 6
Probabilistic random walk after 117316 steps, saw 33818 distinct states, run finished after 3007 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 3313 rows 1743 cols
[2024-05-22 07:46:45] [INFO ] Computed 43 invariants in 23 ms
[2024-05-22 07:46:45] [INFO ] State equation strengthened by 3164 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1691/1720 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1720 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 20/1740 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1740 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/1742 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1742 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3313/5055 variables, 1742/1785 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5055 variables, 3164/4949 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5055 variables, 0/4949 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/5056 variables, 1/4950 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5056 variables, 0/4950 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/5056 variables, 0/4950 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5056/5056 variables, and 4950 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3663 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1743/1743 constraints, ReadFeed: 3164/3164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1691/1720 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 07:46:50] [INFO ] Deduced a trap composed of 2 places in 944 ms of which 9 ms to minimize.
[2024-05-22 07:46:50] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 3 ms to minimize.
[2024-05-22 07:46:50] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2024-05-22 07:46:50] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:46:51] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:46:51] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:46:51] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:46:51] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:46:51] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:46:51] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-05-22 07:46:51] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:46:51] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:46:52] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-22 07:46:52] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1720 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1720 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 20/1740 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 07:46:53] [INFO ] Deduced a trap composed of 48 places in 1199 ms of which 11 ms to minimize.
[2024-05-22 07:46:55] [INFO ] Deduced a trap composed of 50 places in 1240 ms of which 10 ms to minimize.
[2024-05-22 07:46:56] [INFO ] Deduced a trap composed of 52 places in 1195 ms of which 10 ms to minimize.
[2024-05-22 07:46:57] [INFO ] Deduced a trap composed of 43 places in 1209 ms of which 11 ms to minimize.
[2024-05-22 07:46:58] [INFO ] Deduced a trap composed of 44 places in 1158 ms of which 11 ms to minimize.
[2024-05-22 07:46:59] [INFO ] Deduced a trap composed of 43 places in 1161 ms of which 11 ms to minimize.
[2024-05-22 07:47:01] [INFO ] Deduced a trap composed of 43 places in 1154 ms of which 10 ms to minimize.
[2024-05-22 07:47:02] [INFO ] Deduced a trap composed of 43 places in 1147 ms of which 10 ms to minimize.
[2024-05-22 07:47:03] [INFO ] Deduced a trap composed of 43 places in 1125 ms of which 10 ms to minimize.
[2024-05-22 07:47:04] [INFO ] Deduced a trap composed of 48 places in 1172 ms of which 10 ms to minimize.
[2024-05-22 07:47:05] [INFO ] Deduced a trap composed of 45 places in 1143 ms of which 11 ms to minimize.
[2024-05-22 07:47:06] [INFO ] Deduced a trap composed of 43 places in 1125 ms of which 10 ms to minimize.
[2024-05-22 07:47:08] [INFO ] Deduced a trap composed of 47 places in 1127 ms of which 11 ms to minimize.
[2024-05-22 07:47:09] [INFO ] Deduced a trap composed of 43 places in 1140 ms of which 11 ms to minimize.
[2024-05-22 07:47:10] [INFO ] Deduced a trap composed of 43 places in 1137 ms of which 11 ms to minimize.
[2024-05-22 07:47:11] [INFO ] Deduced a trap composed of 43 places in 1126 ms of which 10 ms to minimize.
[2024-05-22 07:47:12] [INFO ] Deduced a trap composed of 47 places in 1140 ms of which 9 ms to minimize.
[2024-05-22 07:47:13] [INFO ] Deduced a trap composed of 43 places in 1092 ms of which 10 ms to minimize.
[2024-05-22 07:47:15] [INFO ] Deduced a trap composed of 43 places in 1104 ms of which 11 ms to minimize.
[2024-05-22 07:47:16] [INFO ] Deduced a trap composed of 43 places in 1104 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1740 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 07:47:17] [INFO ] Deduced a trap composed of 43 places in 1075 ms of which 10 ms to minimize.
[2024-05-22 07:47:18] [INFO ] Deduced a trap composed of 43 places in 1134 ms of which 11 ms to minimize.
[2024-05-22 07:47:19] [INFO ] Deduced a trap composed of 43 places in 1083 ms of which 11 ms to minimize.
[2024-05-22 07:47:20] [INFO ] Deduced a trap composed of 43 places in 1068 ms of which 10 ms to minimize.
[2024-05-22 07:47:21] [INFO ] Deduced a trap composed of 49 places in 1098 ms of which 10 ms to minimize.
[2024-05-22 07:47:22] [INFO ] Deduced a trap composed of 43 places in 1006 ms of which 11 ms to minimize.
[2024-05-22 07:47:23] [INFO ] Deduced a trap composed of 47 places in 1036 ms of which 10 ms to minimize.
[2024-05-22 07:47:24] [INFO ] Deduced a trap composed of 44 places in 990 ms of which 10 ms to minimize.
[2024-05-22 07:47:25] [INFO ] Deduced a trap composed of 43 places in 1037 ms of which 10 ms to minimize.
[2024-05-22 07:47:27] [INFO ] Deduced a trap composed of 43 places in 1036 ms of which 10 ms to minimize.
[2024-05-22 07:47:28] [INFO ] Deduced a trap composed of 43 places in 994 ms of which 10 ms to minimize.
[2024-05-22 07:47:29] [INFO ] Deduced a trap composed of 43 places in 1017 ms of which 10 ms to minimize.
[2024-05-22 07:47:30] [INFO ] Deduced a trap composed of 45 places in 1055 ms of which 9 ms to minimize.
[2024-05-22 07:47:31] [INFO ] Deduced a trap composed of 50 places in 1001 ms of which 12 ms to minimize.
[2024-05-22 07:47:32] [INFO ] Deduced a trap composed of 43 places in 985 ms of which 10 ms to minimize.
[2024-05-22 07:47:33] [INFO ] Deduced a trap composed of 43 places in 1035 ms of which 10 ms to minimize.
[2024-05-22 07:47:34] [INFO ] Deduced a trap composed of 43 places in 1019 ms of which 12 ms to minimize.
[2024-05-22 07:47:35] [INFO ] Deduced a trap composed of 48 places in 991 ms of which 10 ms to minimize.
[2024-05-22 07:47:36] [INFO ] Deduced a trap composed of 49 places in 975 ms of which 10 ms to minimize.
[2024-05-22 07:47:37] [INFO ] Deduced a trap composed of 47 places in 967 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1740 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 07:47:38] [INFO ] Deduced a trap composed of 43 places in 977 ms of which 9 ms to minimize.
[2024-05-22 07:47:39] [INFO ] Deduced a trap composed of 43 places in 1008 ms of which 10 ms to minimize.
[2024-05-22 07:47:40] [INFO ] Deduced a trap composed of 48 places in 999 ms of which 9 ms to minimize.
[2024-05-22 07:47:41] [INFO ] Deduced a trap composed of 43 places in 962 ms of which 10 ms to minimize.
[2024-05-22 07:47:42] [INFO ] Deduced a trap composed of 49 places in 986 ms of which 10 ms to minimize.
[2024-05-22 07:47:43] [INFO ] Deduced a trap composed of 45 places in 967 ms of which 10 ms to minimize.
[2024-05-22 07:47:44] [INFO ] Deduced a trap composed of 48 places in 988 ms of which 9 ms to minimize.
[2024-05-22 07:47:45] [INFO ] Deduced a trap composed of 43 places in 996 ms of which 10 ms to minimize.
[2024-05-22 07:47:46] [INFO ] Deduced a trap composed of 43 places in 920 ms of which 9 ms to minimize.
[2024-05-22 07:47:47] [INFO ] Deduced a trap composed of 44 places in 937 ms of which 9 ms to minimize.
[2024-05-22 07:47:48] [INFO ] Deduced a trap composed of 45 places in 937 ms of which 10 ms to minimize.
[2024-05-22 07:47:49] [INFO ] Deduced a trap composed of 45 places in 886 ms of which 10 ms to minimize.
[2024-05-22 07:47:50] [INFO ] Deduced a trap composed of 45 places in 906 ms of which 10 ms to minimize.
[2024-05-22 07:47:51] [INFO ] Deduced a trap composed of 43 places in 859 ms of which 9 ms to minimize.
[2024-05-22 07:47:51] [INFO ] Deduced a trap composed of 43 places in 911 ms of which 10 ms to minimize.
[2024-05-22 07:47:52] [INFO ] Deduced a trap composed of 43 places in 785 ms of which 9 ms to minimize.
[2024-05-22 07:47:53] [INFO ] Deduced a trap composed of 43 places in 793 ms of which 9 ms to minimize.
[2024-05-22 07:47:54] [INFO ] Deduced a trap composed of 43 places in 816 ms of which 9 ms to minimize.
[2024-05-22 07:47:55] [INFO ] Deduced a trap composed of 43 places in 832 ms of which 10 ms to minimize.
[2024-05-22 07:47:56] [INFO ] Deduced a trap composed of 46 places in 797 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1740 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 07:47:57] [INFO ] Deduced a trap composed of 43 places in 885 ms of which 10 ms to minimize.
[2024-05-22 07:47:57] [INFO ] Deduced a trap composed of 44 places in 852 ms of which 9 ms to minimize.
[2024-05-22 07:47:58] [INFO ] Deduced a trap composed of 43 places in 872 ms of which 10 ms to minimize.
[2024-05-22 07:47:59] [INFO ] Deduced a trap composed of 43 places in 864 ms of which 10 ms to minimize.
[2024-05-22 07:48:00] [INFO ] Deduced a trap composed of 43 places in 851 ms of which 10 ms to minimize.
[2024-05-22 07:48:01] [INFO ] Deduced a trap composed of 43 places in 837 ms of which 10 ms to minimize.
[2024-05-22 07:48:02] [INFO ] Deduced a trap composed of 43 places in 837 ms of which 10 ms to minimize.
[2024-05-22 07:48:03] [INFO ] Deduced a trap composed of 43 places in 843 ms of which 10 ms to minimize.
[2024-05-22 07:48:04] [INFO ] Deduced a trap composed of 47 places in 825 ms of which 9 ms to minimize.
[2024-05-22 07:48:04] [INFO ] Deduced a trap composed of 43 places in 814 ms of which 9 ms to minimize.
SMT process timed out in 79415ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 29 out of 1743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1743/1743 places, 3313/3313 transitions.
Applied a total of 0 rules in 146 ms. Remains 1743 /1743 variables (removed 0) and now considering 3313/3313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 1743/1743 places, 3313/3313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1743/1743 places, 3313/3313 transitions.
Applied a total of 0 rules in 120 ms. Remains 1743 /1743 variables (removed 0) and now considering 3313/3313 (removed 0) transitions.
[2024-05-22 07:48:05] [INFO ] Invariant cache hit.
[2024-05-22 07:48:06] [INFO ] Implicit Places using invariants in 1285 ms returned [89, 120]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1309 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1741/1743 places, 3313/3313 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 1739 transition count 3311
Applied a total of 4 rules in 253 ms. Remains 1739 /1741 variables (removed 2) and now considering 3311/3313 (removed 2) transitions.
// Phase 1: matrix 3311 rows 1739 cols
[2024-05-22 07:48:06] [INFO ] Computed 41 invariants in 25 ms
[2024-05-22 07:48:07] [INFO ] Implicit Places using invariants in 984 ms returned []
[2024-05-22 07:48:07] [INFO ] Invariant cache hit.
[2024-05-22 07:48:08] [INFO ] State equation strengthened by 3161 read => feed constraints.
[2024-05-22 07:48:27] [INFO ] Implicit Places using invariants and state equation in 19600 ms returned []
Implicit Place search using SMT with State Equation took 20600 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1739/1743 places, 3311/3313 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 22294 ms. Remains : 1739/1743 places, 3311/3313 transitions.
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
[2024-05-22 07:48:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 07:48:27] [INFO ] Flatten gal took : 186 ms
[2024-05-22 07:48:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CANConstruction-PT-040-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 07:48:27] [INFO ] Flatten gal took : 227 ms
[2024-05-22 07:48:28] [INFO ] Input system was already deterministic with 3810 transitions.
Support contains 129 out of 2172 places (down from 139) after GAL structural reductions.
Computed a total of 127 stabilizing places and 166 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 85 place count 2087 transition count 3643
Iterating global reduction 0 with 85 rules applied. Total rules applied 170 place count 2087 transition count 3643
Applied a total of 170 rules in 353 ms. Remains 2087 /2172 variables (removed 85) and now considering 3643/3810 (removed 167) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 2087/2172 places, 3643/3810 transitions.
[2024-05-22 07:48:28] [INFO ] Flatten gal took : 80 ms
[2024-05-22 07:48:28] [INFO ] Flatten gal took : 87 ms
[2024-05-22 07:48:28] [INFO ] Input system was already deterministic with 3643 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 84 place count 2088 transition count 3646
Iterating global reduction 0 with 84 rules applied. Total rules applied 168 place count 2088 transition count 3646
Applied a total of 168 rules in 259 ms. Remains 2088 /2172 variables (removed 84) and now considering 3646/3810 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 2088/2172 places, 3646/3810 transitions.
[2024-05-22 07:48:29] [INFO ] Flatten gal took : 85 ms
[2024-05-22 07:48:29] [INFO ] Flatten gal took : 100 ms
[2024-05-22 07:48:29] [INFO ] Input system was already deterministic with 3646 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 84 place count 2088 transition count 3646
Iterating global reduction 0 with 84 rules applied. Total rules applied 168 place count 2088 transition count 3646
Applied a total of 168 rules in 273 ms. Remains 2088 /2172 variables (removed 84) and now considering 3646/3810 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 2088/2172 places, 3646/3810 transitions.
[2024-05-22 07:48:30] [INFO ] Flatten gal took : 77 ms
[2024-05-22 07:48:30] [INFO ] Flatten gal took : 88 ms
[2024-05-22 07:48:30] [INFO ] Input system was already deterministic with 3646 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 2092 transition count 3654
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 2092 transition count 3654
Applied a total of 160 rules in 245 ms. Remains 2092 /2172 variables (removed 80) and now considering 3654/3810 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 2092/2172 places, 3654/3810 transitions.
[2024-05-22 07:48:30] [INFO ] Flatten gal took : 72 ms
[2024-05-22 07:48:30] [INFO ] Flatten gal took : 110 ms
[2024-05-22 07:48:30] [INFO ] Input system was already deterministic with 3654 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 2108 transition count 3686
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 2108 transition count 3686
Applied a total of 128 rules in 285 ms. Remains 2108 /2172 variables (removed 64) and now considering 3686/3810 (removed 124) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 2108/2172 places, 3686/3810 transitions.
[2024-05-22 07:48:31] [INFO ] Flatten gal took : 70 ms
[2024-05-22 07:48:31] [INFO ] Flatten gal took : 75 ms
[2024-05-22 07:48:31] [INFO ] Input system was already deterministic with 3686 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 83 place count 2089 transition count 3648
Iterating global reduction 0 with 83 rules applied. Total rules applied 166 place count 2089 transition count 3648
Applied a total of 166 rules in 274 ms. Remains 2089 /2172 variables (removed 83) and now considering 3648/3810 (removed 162) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 2089/2172 places, 3648/3810 transitions.
[2024-05-22 07:48:31] [INFO ] Flatten gal took : 67 ms
[2024-05-22 07:48:31] [INFO ] Flatten gal took : 74 ms
[2024-05-22 07:48:32] [INFO ] Input system was already deterministic with 3648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 81 place count 2091 transition count 3651
Iterating global reduction 0 with 81 rules applied. Total rules applied 162 place count 2091 transition count 3651
Applied a total of 162 rules in 293 ms. Remains 2091 /2172 variables (removed 81) and now considering 3651/3810 (removed 159) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 2091/2172 places, 3651/3810 transitions.
[2024-05-22 07:48:32] [INFO ] Flatten gal took : 65 ms
[2024-05-22 07:48:32] [INFO ] Flatten gal took : 73 ms
[2024-05-22 07:48:32] [INFO ] Input system was already deterministic with 3651 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2172 transition count 3559
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 1921 transition count 3559
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 502 place count 1921 transition count 3521
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 578 place count 1883 transition count 3521
Discarding 82 places :
Symmetric choice reduction at 2 with 82 rule applications. Total rules 660 place count 1801 transition count 3357
Iterating global reduction 2 with 82 rules applied. Total rules applied 742 place count 1801 transition count 3357
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 2 with 37 rules applied. Total rules applied 779 place count 1801 transition count 3320
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 816 place count 1764 transition count 3320
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 888 place count 1728 transition count 3284
Applied a total of 888 rules in 444 ms. Remains 1728 /2172 variables (removed 444) and now considering 3284/3810 (removed 526) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 445 ms. Remains : 1728/2172 places, 3284/3810 transitions.
[2024-05-22 07:48:33] [INFO ] Flatten gal took : 69 ms
[2024-05-22 07:48:33] [INFO ] Flatten gal took : 68 ms
[2024-05-22 07:48:33] [INFO ] Input system was already deterministic with 3284 transitions.
RANDOM walk for 21452 steps (74 resets) in 369 ms. (57 steps per ms) remains 0/1 properties
FORMULA CANConstruction-PT-040-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2172 transition count 3559
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 1921 transition count 3559
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 502 place count 1921 transition count 3521
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 578 place count 1883 transition count 3521
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 657 place count 1804 transition count 3363
Iterating global reduction 2 with 79 rules applied. Total rules applied 736 place count 1804 transition count 3363
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 2 with 34 rules applied. Total rules applied 770 place count 1804 transition count 3329
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 804 place count 1770 transition count 3329
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 882 place count 1731 transition count 3290
Applied a total of 882 rules in 650 ms. Remains 1731 /2172 variables (removed 441) and now considering 3290/3810 (removed 520) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 663 ms. Remains : 1731/2172 places, 3290/3810 transitions.
[2024-05-22 07:48:34] [INFO ] Flatten gal took : 61 ms
[2024-05-22 07:48:34] [INFO ] Flatten gal took : 117 ms
[2024-05-22 07:48:34] [INFO ] Input system was already deterministic with 3290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 83 place count 2089 transition count 3648
Iterating global reduction 0 with 83 rules applied. Total rules applied 166 place count 2089 transition count 3648
Applied a total of 166 rules in 268 ms. Remains 2089 /2172 variables (removed 83) and now considering 3648/3810 (removed 162) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 2089/2172 places, 3648/3810 transitions.
[2024-05-22 07:48:34] [INFO ] Flatten gal took : 81 ms
[2024-05-22 07:48:35] [INFO ] Flatten gal took : 77 ms
[2024-05-22 07:48:35] [INFO ] Input system was already deterministic with 3648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 2092 transition count 3653
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 2092 transition count 3653
Applied a total of 160 rules in 299 ms. Remains 2092 /2172 variables (removed 80) and now considering 3653/3810 (removed 157) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 2092/2172 places, 3653/3810 transitions.
[2024-05-22 07:48:35] [INFO ] Flatten gal took : 64 ms
[2024-05-22 07:48:35] [INFO ] Flatten gal took : 72 ms
[2024-05-22 07:48:35] [INFO ] Input system was already deterministic with 3653 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 82 place count 2090 transition count 3650
Iterating global reduction 0 with 82 rules applied. Total rules applied 164 place count 2090 transition count 3650
Applied a total of 164 rules in 287 ms. Remains 2090 /2172 variables (removed 82) and now considering 3650/3810 (removed 160) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 287 ms. Remains : 2090/2172 places, 3650/3810 transitions.
[2024-05-22 07:48:36] [INFO ] Flatten gal took : 64 ms
[2024-05-22 07:48:36] [INFO ] Flatten gal took : 72 ms
[2024-05-22 07:48:36] [INFO ] Input system was already deterministic with 3650 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 85 place count 2087 transition count 3643
Iterating global reduction 0 with 85 rules applied. Total rules applied 170 place count 2087 transition count 3643
Applied a total of 170 rules in 244 ms. Remains 2087 /2172 variables (removed 85) and now considering 3643/3810 (removed 167) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 2087/2172 places, 3643/3810 transitions.
[2024-05-22 07:48:36] [INFO ] Flatten gal took : 64 ms
[2024-05-22 07:48:36] [INFO ] Flatten gal took : 71 ms
[2024-05-22 07:48:36] [INFO ] Input system was already deterministic with 3643 transitions.
[2024-05-22 07:48:37] [INFO ] Flatten gal took : 75 ms
[2024-05-22 07:48:37] [INFO ] Flatten gal took : 77 ms
[2024-05-22 07:48:37] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-22 07:48:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2172 places, 3810 transitions and 14032 arcs took 18 ms.
Total runtime 204886 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CANConstruction-PT-040
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2172
TRANSITIONS: 3810
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.066s, Sys 0.012s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.012s, 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: 1122
MODEL NAME: /home/mcc/execution/414/model
2172 places, 3810 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.
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
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-040"
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 CANConstruction-PT-040, 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 r069-tall-171620503700033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-040.tgz
mv CANConstruction-PT-040 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 ;