About the Execution of GreatSPN+red for AutonomousCar-PT-09a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1772.155 | 155582.00 | 287261.00 | 542.80 | FTTTFTFTFFTFTFFF | 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.r025-smll-171620166400346.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 AutonomousCar-PT-09a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166400346
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K 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 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 781K 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 AutonomousCar-PT-09a-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716355888099
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 05:31:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 05:31:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:31:31] [INFO ] Load time of PNML (sax parser for PT used): 549 ms
[2024-05-22 05:31:31] [INFO ] Transformed 89 places.
[2024-05-22 05:31:31] [INFO ] Transformed 1249 transitions.
[2024-05-22 05:31:31] [INFO ] Found NUPN structural information;
[2024-05-22 05:31:31] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 917 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 41 ms.
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
Support contains 64 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 904/904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 894
Applied a total of 2 rules in 63 ms. Remains 88 /89 variables (removed 1) and now considering 894/904 (removed 10) transitions.
[2024-05-22 05:31:31] [INFO ] Flow matrix only has 893 transitions (discarded 1 similar events)
// Phase 1: matrix 893 rows 88 cols
[2024-05-22 05:31:31] [INFO ] Computed 14 invariants in 38 ms
[2024-05-22 05:31:31] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-22 05:31:31] [INFO ] Flow matrix only has 893 transitions (discarded 1 similar events)
[2024-05-22 05:31:31] [INFO ] Invariant cache hit.
[2024-05-22 05:31:32] [INFO ] State equation strengthened by 318 read => feed constraints.
[2024-05-22 05:31:32] [INFO ] Implicit Places using invariants and state equation in 678 ms returned [83, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1057 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/89 places, 894/904 transitions.
Applied a total of 0 rules in 10 ms. Remains 86 /86 variables (removed 0) and now considering 894/894 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1163 ms. Remains : 86/89 places, 894/904 transitions.
Support contains 64 out of 86 places after structural reductions.
[2024-05-22 05:31:33] [INFO ] Flatten gal took : 438 ms
[2024-05-22 05:31:33] [INFO ] Flatten gal took : 195 ms
[2024-05-22 05:31:34] [INFO ] Input system was already deterministic with 894 transitions.
RANDOM walk for 40000 steps (1948 resets) in 5614 ms. (7 steps per ms) remains 66/98 properties
BEST_FIRST walk for 4004 steps (14 resets) in 51 ms. (77 steps per ms) remains 65/66 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (16 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (12 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (12 resets) in 54 ms. (72 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (15 resets) in 34 ms. (114 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (11 resets) in 36 ms. (108 steps per ms) remains 64/65 properties
BEST_FIRST walk for 4004 steps (17 resets) in 35 ms. (111 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4004 steps (10 resets) in 39 ms. (100 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (11 resets) in 28 ms. (138 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (17 resets) in 16 ms. (235 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 96 ms. (41 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (14 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 27 ms. (143 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (18 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4004 steps (13 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (15 resets) in 27 ms. (143 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (18 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (11 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (14 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (15 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4004 steps (18 resets) in 44 ms. (88 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
[2024-05-22 05:31:36] [INFO ] Flow matrix only has 893 transitions (discarded 1 similar events)
// Phase 1: matrix 893 rows 86 cols
[2024-05-22 05:31:36] [INFO ] Computed 12 invariants in 12 ms
[2024-05-22 05:31:36] [INFO ] State equation strengthened by 318 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp97 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/82 variables, 12/12 constraints. Problems are: Problem set: 11 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 11 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 889/971 variables, 82/94 constraints. Problems are: Problem set: 11 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 317/411 constraints. Problems are: Problem set: 11 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/971 variables, 0/411 constraints. Problems are: Problem set: 11 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 6/977 variables, 3/414 constraints. Problems are: Problem set: 11 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/977 variables, 0/414 constraints. Problems are: Problem set: 11 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/978 variables, 1/415 constraints. Problems are: Problem set: 11 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/978 variables, 0/415 constraints. Problems are: Problem set: 11 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 1/979 variables, 1/416 constraints. Problems are: Problem set: 11 solved, 43 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 979/979 variables, and 416 constraints, problems are : Problem set: 11 solved, 43 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 86/86 constraints, ReadFeed: 318/318 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 43 unsolved
Problem AtomicPropp68 is UNSAT
At refinement iteration 1 (OVERLAPS) 34/82 variables, 12/12 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 889/971 variables, 82/94 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 317/411 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/971 variables, 0/411 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 6/977 variables, 3/414 constraints. Problems are: Problem set: 12 solved, 42 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 977/979 variables, and 456 constraints, problems are : Problem set: 12 solved, 42 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/86 constraints, ReadFeed: 317/318 constraints, PredecessorRefiner: 42/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 11890ms problems are : Problem set: 12 solved, 42 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 894/894 transitions.
Graph (complete) has 1023 edges and 86 vertex of which 84 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.27 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 84 transition count 888
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 83 transition count 887
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 82 transition count 887
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 82 transition count 884
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 79 transition count 884
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 17 place count 76 transition count 863
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 76 transition count 863
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 75 transition count 862
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 75 transition count 859
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 37 place count 72 transition count 850
Applied a total of 37 rules in 377 ms. Remains 72 /86 variables (removed 14) and now considering 850/894 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 72/86 places, 850/894 transitions.
RANDOM walk for 40000 steps (898 resets) in 1597 ms. (25 steps per ms) remains 39/42 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (17 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (13 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (13 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (17 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (11 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (15 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (16 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (11 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
// Phase 1: matrix 850 rows 72 cols
[2024-05-22 05:31:49] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 05:31:49] [INFO ] State equation strengthened by 289 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 24/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 1/72 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 850/922 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/922 variables, 289/374 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/922 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/922 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 922/922 variables, and 374 constraints, problems are : Problem set: 0 solved, 37 unsolved in 2205 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 72/72 constraints, ReadFeed: 289/289 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 24/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 1/72 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 850/922 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/922 variables, 289/374 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/922 variables, 37/411 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/922 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 922/922 variables, and 411 constraints, problems are : Problem set: 0 solved, 37 unsolved in 18010 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 72/72 constraints, ReadFeed: 289/289 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 21141ms problems are : Problem set: 0 solved, 37 unsolved
Fused 37 Parikh solutions to 36 different solutions.
Parikh walk visited 4 properties in 34811 ms.
Support contains 45 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 850/850 transitions.
Applied a total of 0 rules in 61 ms. Remains 72 /72 variables (removed 0) and now considering 850/850 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 72/72 places, 850/850 transitions.
RANDOM walk for 40000 steps (1716 resets) in 1175 ms. (34 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (11 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (16 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (12 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (11 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (12 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 341775 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 31
Probabilistic random walk after 341775 steps, saw 58952 distinct states, run finished after 3012 ms. (steps per millisecond=113 ) properties seen :0
[2024-05-22 05:32:49] [INFO ] Invariant cache hit.
[2024-05-22 05:32:49] [INFO ] State equation strengthened by 289 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 26/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 1/72 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 850/922 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/922 variables, 289/374 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/922 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 0/922 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 922/922 variables, and 374 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1859 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 72/72 constraints, ReadFeed: 289/289 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 26/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 1/72 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 850/922 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/922 variables, 289/374 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/922 variables, 31/405 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/922 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 922/922 variables, and 405 constraints, problems are : Problem set: 0 solved, 31 unsolved in 16651 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 72/72 constraints, ReadFeed: 289/289 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 19095ms problems are : Problem set: 0 solved, 31 unsolved
Fused 31 Parikh solutions to 30 different solutions.
Parikh walk visited 6 properties in 31067 ms.
Support contains 38 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 850/850 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 72 transition count 849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 71 transition count 849
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 71 transition count 847
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 24 place count 69 transition count 829
Applied a total of 24 rules in 111 ms. Remains 69 /72 variables (removed 3) and now considering 829/850 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 69/72 places, 829/850 transitions.
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
[2024-05-22 05:33:39] [INFO ] Flatten gal took : 135 ms
[2024-05-22 05:33:39] [INFO ] Flatten gal took : 126 ms
[2024-05-22 05:33:40] [INFO ] Input system was already deterministic with 894 transitions.
Support contains 60 out of 86 places (down from 61) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 77 transition count 813
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 77 transition count 813
Applied a total of 18 rules in 11 ms. Remains 77 /86 variables (removed 9) and now considering 813/894 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 77/86 places, 813/894 transitions.
[2024-05-22 05:33:40] [INFO ] Flatten gal took : 81 ms
[2024-05-22 05:33:40] [INFO ] Flatten gal took : 84 ms
[2024-05-22 05:33:40] [INFO ] Input system was already deterministic with 813 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 86 transition count 887
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 79 transition count 885
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 77 transition count 885
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 77 transition count 883
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 75 transition count 883
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 31 place count 66 transition count 802
Iterating global reduction 3 with 9 rules applied. Total rules applied 40 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 65 transition count 801
Applied a total of 42 rules in 136 ms. Remains 65 /86 variables (removed 21) and now considering 801/894 (removed 93) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 137 ms. Remains : 65/86 places, 801/894 transitions.
[2024-05-22 05:33:40] [INFO ] Flatten gal took : 102 ms
[2024-05-22 05:33:41] [INFO ] Flatten gal took : 107 ms
[2024-05-22 05:33:41] [INFO ] Input system was already deterministic with 801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 77 transition count 813
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 77 transition count 813
Applied a total of 18 rules in 31 ms. Remains 77 /86 variables (removed 9) and now considering 813/894 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 77/86 places, 813/894 transitions.
[2024-05-22 05:33:41] [INFO ] Flatten gal took : 72 ms
[2024-05-22 05:33:41] [INFO ] Flatten gal took : 79 ms
[2024-05-22 05:33:41] [INFO ] Input system was already deterministic with 813 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 833
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 833
Applied a total of 14 rules in 9 ms. Remains 79 /86 variables (removed 7) and now considering 833/894 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 79/86 places, 833/894 transitions.
[2024-05-22 05:33:41] [INFO ] Flatten gal took : 71 ms
[2024-05-22 05:33:41] [INFO ] Flatten gal took : 77 ms
[2024-05-22 05:33:41] [INFO ] Input system was already deterministic with 833 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 78 transition count 823
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 823
Applied a total of 16 rules in 12 ms. Remains 78 /86 variables (removed 8) and now considering 823/894 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 78/86 places, 823/894 transitions.
[2024-05-22 05:33:42] [INFO ] Flatten gal took : 89 ms
[2024-05-22 05:33:42] [INFO ] Flatten gal took : 73 ms
[2024-05-22 05:33:42] [INFO ] Input system was already deterministic with 823 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 833
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 833
Applied a total of 14 rules in 8 ms. Remains 79 /86 variables (removed 7) and now considering 833/894 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 79/86 places, 833/894 transitions.
[2024-05-22 05:33:42] [INFO ] Flatten gal took : 67 ms
[2024-05-22 05:33:42] [INFO ] Flatten gal took : 71 ms
[2024-05-22 05:33:42] [INFO ] Input system was already deterministic with 833 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 833
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 833
Applied a total of 14 rules in 8 ms. Remains 79 /86 variables (removed 7) and now considering 833/894 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 79/86 places, 833/894 transitions.
[2024-05-22 05:33:42] [INFO ] Flatten gal took : 66 ms
[2024-05-22 05:33:42] [INFO ] Flatten gal took : 72 ms
[2024-05-22 05:33:42] [INFO ] Input system was already deterministic with 833 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 824
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 824
Applied a total of 14 rules in 6 ms. Remains 79 /86 variables (removed 7) and now considering 824/894 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 79/86 places, 824/894 transitions.
[2024-05-22 05:33:42] [INFO ] Flatten gal took : 91 ms
[2024-05-22 05:33:43] [INFO ] Flatten gal took : 97 ms
[2024-05-22 05:33:43] [INFO ] Input system was already deterministic with 824 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 81 transition count 853
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 81 transition count 853
Applied a total of 10 rules in 7 ms. Remains 81 /86 variables (removed 5) and now considering 853/894 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 81/86 places, 853/894 transitions.
[2024-05-22 05:33:43] [INFO ] Flatten gal took : 66 ms
[2024-05-22 05:33:43] [INFO ] Flatten gal took : 72 ms
[2024-05-22 05:33:43] [INFO ] Input system was already deterministic with 853 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 78 transition count 823
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 823
Applied a total of 16 rules in 7 ms. Remains 78 /86 variables (removed 8) and now considering 823/894 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 78/86 places, 823/894 transitions.
[2024-05-22 05:33:43] [INFO ] Flatten gal took : 65 ms
[2024-05-22 05:33:43] [INFO ] Flatten gal took : 126 ms
[2024-05-22 05:33:43] [INFO ] Input system was already deterministic with 823 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 833
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 833
Applied a total of 14 rules in 7 ms. Remains 79 /86 variables (removed 7) and now considering 833/894 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 79/86 places, 833/894 transitions.
[2024-05-22 05:33:44] [INFO ] Flatten gal took : 65 ms
[2024-05-22 05:33:44] [INFO ] Flatten gal took : 72 ms
[2024-05-22 05:33:44] [INFO ] Input system was already deterministic with 833 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 86 transition count 886
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 78 transition count 885
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 77 transition count 885
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 26 place count 69 transition count 814
Iterating global reduction 3 with 8 rules applied. Total rules applied 34 place count 69 transition count 814
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 38 place count 67 transition count 812
Applied a total of 38 rules in 168 ms. Remains 67 /86 variables (removed 19) and now considering 812/894 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 169 ms. Remains : 67/86 places, 812/894 transitions.
[2024-05-22 05:33:44] [INFO ] Flatten gal took : 142 ms
[2024-05-22 05:33:44] [INFO ] Flatten gal took : 151 ms
[2024-05-22 05:33:44] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 77 transition count 813
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 77 transition count 813
Applied a total of 18 rules in 7 ms. Remains 77 /86 variables (removed 9) and now considering 813/894 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 77/86 places, 813/894 transitions.
[2024-05-22 05:33:44] [INFO ] Flatten gal took : 65 ms
[2024-05-22 05:33:45] [INFO ] Flatten gal took : 71 ms
[2024-05-22 05:33:45] [INFO ] Input system was already deterministic with 813 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 77 transition count 813
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 77 transition count 813
Applied a total of 18 rules in 6 ms. Remains 77 /86 variables (removed 9) and now considering 813/894 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 77/86 places, 813/894 transitions.
[2024-05-22 05:33:45] [INFO ] Flatten gal took : 68 ms
[2024-05-22 05:33:45] [INFO ] Flatten gal took : 75 ms
[2024-05-22 05:33:45] [INFO ] Input system was already deterministic with 813 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 86 transition count 886
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 78 transition count 885
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 77 transition count 885
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 77 transition count 883
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 75 transition count 883
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 70 transition count 842
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 70 transition count 842
Applied a total of 32 rules in 119 ms. Remains 70 /86 variables (removed 16) and now considering 842/894 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 119 ms. Remains : 70/86 places, 842/894 transitions.
[2024-05-22 05:33:45] [INFO ] Flatten gal took : 94 ms
[2024-05-22 05:33:45] [INFO ] Flatten gal took : 125 ms
[2024-05-22 05:33:46] [INFO ] Input system was already deterministic with 842 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 894/894 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 80 transition count 843
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 80 transition count 843
Applied a total of 12 rules in 10 ms. Remains 80 /86 variables (removed 6) and now considering 843/894 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 80/86 places, 843/894 transitions.
[2024-05-22 05:33:46] [INFO ] Flatten gal took : 105 ms
[2024-05-22 05:33:46] [INFO ] Flatten gal took : 105 ms
[2024-05-22 05:33:46] [INFO ] Input system was already deterministic with 843 transitions.
[2024-05-22 05:33:46] [INFO ] Flatten gal took : 100 ms
[2024-05-22 05:33:46] [INFO ] Flatten gal took : 101 ms
[2024-05-22 05:33:46] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 17 ms.
[2024-05-22 05:33:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 86 places, 894 transitions and 12916 arcs took 23 ms.
Total runtime 136653 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running AutonomousCar-PT-09a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 86
TRANSITIONS: 894
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.078s, Sys 0.006s]
SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.007s, 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: 574
MODEL NAME: /home/mcc/execution/408/model
86 places, 894 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 AutonomousCar-PT-09a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716356043681
--------------------
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="AutonomousCar-PT-09a"
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 AutonomousCar-PT-09a, 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 r025-smll-171620166400346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09a.tgz
mv AutonomousCar-PT-09a 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 ;