fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r025-smll-171620166400330
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for AutonomousCar-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5939.615 194349.00 304032.00 456.20 FTTFTTTFTFFFFTFF 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-171620166400330.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-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166400330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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 448K 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-08a-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716352950381

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-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 04:42:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 04:42:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:42:32] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-05-22 04:42:32] [INFO ] Transformed 81 places.
[2024-05-22 04:42:32] [INFO ] Transformed 849 transitions.
[2024-05-22 04:42:32] [INFO ] Found NUPN structural information;
[2024-05-22 04:42:32] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 393 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 35 ms.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
Support contains 69 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 80 transition count 573
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 573
Applied a total of 2 rules in 56 ms. Remains 80 /81 variables (removed 1) and now considering 573/574 (removed 1) transitions.
// Phase 1: matrix 573 rows 80 cols
[2024-05-22 04:42:32] [INFO ] Computed 12 invariants in 34 ms
[2024-05-22 04:42:33] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-22 04:42:33] [INFO ] Invariant cache hit.
[2024-05-22 04:42:33] [INFO ] State equation strengthened by 259 read => feed constraints.
[2024-05-22 04:42:33] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Running 572 sub problems to find dead transitions.
[2024-05-22 04:42:33] [INFO ] Invariant cache hit.
[2024-05-22 04:42:33] [INFO ] State equation strengthened by 259 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-22 04:42:44] [INFO ] Deduced a trap composed of 21 places in 465 ms of which 66 ms to minimize.
[2024-05-22 04:42:44] [INFO ] Deduced a trap composed of 5 places in 367 ms of which 2 ms to minimize.
[2024-05-22 04:42:46] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 2 ms to minimize.
[2024-05-22 04:42:48] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-22 04:42:48] [INFO ] Deduced a trap composed of 22 places in 346 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (OVERLAPS) 572/652 variables, 80/97 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/652 variables, 258/355 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/652 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 8 (OVERLAPS) 1/653 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-22 04:43:08] [INFO ] Deduced a trap composed of 14 places in 306 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/653 variables, and 357 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 80/80 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (OVERLAPS) 572/652 variables, 80/98 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/652 variables, 258/356 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/652 variables, 572/928 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 652/653 variables, and 928 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 80/80 constraints, ReadFeed: 258/259 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 6/6 constraints]
After SMT, in 66788ms problems are : Problem set: 0 solved, 572 unsolved
Search for dead transitions found 0 dead transitions in 66849ms
Starting structural reductions in LTL mode, iteration 1 : 80/81 places, 573/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67668 ms. Remains : 80/81 places, 573/574 transitions.
Support contains 69 out of 80 places after structural reductions.
[2024-05-22 04:43:40] [INFO ] Flatten gal took : 216 ms
[2024-05-22 04:43:41] [INFO ] Flatten gal took : 127 ms
[2024-05-22 04:43:41] [INFO ] Input system was already deterministic with 573 transitions.
RANDOM walk for 40000 steps (2084 resets) in 4185 ms. (9 steps per ms) remains 56/125 properties
BEST_FIRST walk for 4004 steps (19 resets) in 46 ms. (85 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (13 resets) in 28 ms. (138 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (13 resets) in 31 ms. (125 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (11 resets) in 26 ms. (148 steps per ms) remains 53/56 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (12 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (16 resets) in 33 ms. (117 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4004 steps (15 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (14 resets) in 248 ms. (16 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (19 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (18 resets) in 21 ms. (182 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (18 resets) in 30 ms. (129 steps per ms) remains 47/49 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (15 resets) in 20 ms. (190 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (18 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (13 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (13 resets) in 44 ms. (88 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (13 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (18 resets) in 25 ms. (154 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (15 resets) in 51 ms. (77 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (12 resets) in 42 ms. (93 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (12 resets) in 34 ms. (114 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (18 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
[2024-05-22 04:43:43] [INFO ] Invariant cache hit.
[2024-05-22 04:43:43] [INFO ] State equation strengthened by 259 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp118 is UNSAT
Problem AtomicPropp121 is UNSAT
At refinement iteration 1 (OVERLAPS) 28/78 variables, 11/11 constraints. Problems are: Problem set: 7 solved, 33 unsolved
[2024-05-22 04:43:44] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 2/80 variables, 1/13 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 572/652 variables, 80/93 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/652 variables, 258/351 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 0/351 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 1/653 variables, 1/352 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 0/352 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 0/653 variables, 0/352 constraints. Problems are: Problem set: 7 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 653/653 variables, and 352 constraints, problems are : Problem set: 7 solved, 33 unsolved in 2725 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 80/80 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 7 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 33/78 variables, 11/11 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 2/80 variables, 1/13 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 572/652 variables, 80/93 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/652 variables, 258/351 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 33/384 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/652 variables, 0/384 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 1/653 variables, 1/385 constraints. Problems are: Problem set: 7 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/653 variables, and 385 constraints, problems are : Problem set: 7 solved, 33 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 80/80 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 33/40 constraints, Known Traps: 1/1 constraints]
After SMT, in 8451ms problems are : Problem set: 7 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 573/573 transitions.
Graph (complete) has 853 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 79 transition count 569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 78 transition count 569
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 78 transition count 567
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 76 transition count 567
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 2 with 2 rules applied. Total rules applied 11 place count 75 transition count 566
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 75 transition count 562
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 19 place count 71 transition count 562
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 71 transition count 562
Applied a total of 20 rules in 233 ms. Remains 71 /80 variables (removed 9) and now considering 562/573 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 71/80 places, 562/573 transitions.
RANDOM walk for 40000 steps (1650 resets) in 1001 ms. (39 steps per ms) remains 30/33 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (13 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (13 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (13 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (14 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (11 resets) in 28 ms. (138 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (13 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (14 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (18 resets) in 19 ms. (200 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (13 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
// Phase 1: matrix 562 rows 71 cols
[2024-05-22 04:43:52] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 04:43:52] [INFO ] State equation strengthened by 259 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 29/66 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 5/71 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 562/633 variables, 71/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/633 variables, 259/343 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/633 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 633/633 variables, and 343 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 71/71 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 29/66 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 5/71 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 562/633 variables, 71/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/633 variables, 259/343 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 27/370 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/633 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/633 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 633/633 variables, and 370 constraints, problems are : Problem set: 0 solved, 27 unsolved in 9492 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 71/71 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 11084ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 2874 ms.
Support contains 37 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 562/562 transitions.
Applied a total of 0 rules in 34 ms. Remains 71 /71 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 71/71 places, 562/562 transitions.
RANDOM walk for 40000 steps (1249 resets) in 934 ms. (42 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (16 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (14 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (13 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (16 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (16 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (14 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 290503 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 26
Probabilistic random walk after 290503 steps, saw 50650 distinct states, run finished after 3011 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-22 04:44:09] [INFO ] Invariant cache hit.
[2024-05-22 04:44:09] [INFO ] State equation strengthened by 259 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 38/66 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 5/71 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 04:44:10] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 562/633 variables, 71/85 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 259/344 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/633 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 0/633 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 633/633 variables, and 344 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 71/71 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 38/66 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 5/71 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 562/633 variables, 71/85 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 259/344 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/633 variables, 26/370 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/633 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/633 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 633/633 variables, and 370 constraints, problems are : Problem set: 0 solved, 26 unsolved in 7094 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 71/71 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints]
After SMT, in 8704ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 25 different solutions.
Parikh walk visited 2 properties in 24183 ms.
Support contains 28 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 562/562 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 561
Applied a total of 2 rules in 50 ms. Remains 70 /71 variables (removed 1) and now considering 561/562 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 70/71 places, 561/562 transitions.
RANDOM walk for 40000 steps (1686 resets) in 990 ms. (40 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4004 steps (14 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (12 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (13 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (15 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 307666 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 22
Probabilistic random walk after 307666 steps, saw 54141 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
// Phase 1: matrix 561 rows 70 cols
[2024-05-22 04:44:46] [INFO ] Computed 13 invariants in 5 ms
[2024-05-22 04:44:46] [INFO ] State equation strengthened by 259 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 38/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 5/70 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-22 04:44:47] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 561/631 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 259/343 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/631 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 343 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1265 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 70/70 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 38/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 5/70 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 561/631 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 259/343 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 22/365 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/631 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 631/631 variables, and 365 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5222 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 70/70 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 1/1 constraints]
After SMT, in 6716ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 2825 ms.
Support contains 27 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 561/561 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 70 transition count 560
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 69 transition count 552
Applied a total of 10 rules in 74 ms. Remains 69 /70 variables (removed 1) and now considering 552/561 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 69/70 places, 552/561 transitions.
RANDOM walk for 40000 steps (1478 resets) in 755 ms. (52 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (13 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (16 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (14 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (16 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (11 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 328802 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :3 out of 22
Probabilistic random walk after 328802 steps, saw 56976 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :3
// Phase 1: matrix 552 rows 69 cols
[2024-05-22 04:44:59] [INFO ] Computed 13 invariants in 4 ms
[2024-05-22 04:44:59] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 33/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-22 04:44:59] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 552/621 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 251/334 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/621 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/621 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 621/621 variables, and 334 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1153 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 69/69 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 33/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 552/621 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 251/334 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/621 variables, 19/353 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/621 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/621 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 621/621 variables, and 353 constraints, problems are : Problem set: 0 solved, 19 unsolved in 4721 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 69/69 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
After SMT, in 6078ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 1411 ms.
Support contains 25 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 552/552 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 68 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 543
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 68 transition count 542
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 12 place count 67 transition count 534
Applied a total of 12 rules in 88 ms. Remains 67 /69 variables (removed 2) and now considering 534/552 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 67/69 places, 534/552 transitions.
RANDOM walk for 40000 steps (643 resets) in 725 ms. (55 steps per ms) remains 16/19 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (17 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
// Phase 1: matrix 534 rows 67 cols
[2024-05-22 04:45:07] [INFO ] Computed 13 invariants in 4 ms
[2024-05-22 04:45:07] [INFO ] State equation strengthened by 235 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 35/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 9/67 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 534/601 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 235/315 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/601 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 315 constraints, problems are : Problem set: 0 solved, 16 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 67/67 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 35/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 9/67 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 534/601 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 235/315 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 16/331 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/601 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 331 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4689 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 67/67 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 5616ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 1104 ms.
Support contains 23 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 534/534 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 532
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 65 transition count 524
Applied a total of 12 rules in 58 ms. Remains 65 /67 variables (removed 2) and now considering 524/534 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 65/67 places, 524/534 transitions.
RANDOM walk for 40000 steps (379 resets) in 692 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (12 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (17 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 355701 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :4 out of 16
Probabilistic random walk after 355701 steps, saw 58207 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :4
// Phase 1: matrix 524 rows 65 cols
[2024-05-22 04:45:17] [INFO ] Computed 13 invariants in 5 ms
[2024-05-22 04:45:17] [INFO ] State equation strengthened by 227 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 30/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 14/65 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 524/589 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 227/305 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/589 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/589 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 305 constraints, problems are : Problem set: 0 solved, 12 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 227/227 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 30/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 14/65 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 524/589 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 227/305 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/589 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/589 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/589 variables, and 317 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2476 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 227/227 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 3289ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 4 properties in 10407 ms.
Support contains 17 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 524/524 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 64 transition count 523
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 60 transition count 487
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 60 transition count 487
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 60 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 59 transition count 486
Applied a total of 12 rules in 70 ms. Remains 59 /65 variables (removed 6) and now considering 486/524 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 59/65 places, 486/524 transitions.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2024-05-22 04:45:31] [INFO ] Flatten gal took : 68 ms
[2024-05-22 04:45:31] [INFO ] Flatten gal took : 71 ms
[2024-05-22 04:45:31] [INFO ] Input system was already deterministic with 573 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 77 transition count 546
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 77 transition count 546
Applied a total of 6 rules in 5 ms. Remains 77 /80 variables (removed 3) and now considering 546/573 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 77/80 places, 546/573 transitions.
[2024-05-22 04:45:31] [INFO ] Flatten gal took : 57 ms
[2024-05-22 04:45:31] [INFO ] Flatten gal took : 58 ms
[2024-05-22 04:45:31] [INFO ] Input system was already deterministic with 546 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 75 transition count 528
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 75 transition count 528
Applied a total of 10 rules in 4 ms. Remains 75 /80 variables (removed 5) and now considering 528/573 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 75/80 places, 528/573 transitions.
[2024-05-22 04:45:31] [INFO ] Flatten gal took : 51 ms
[2024-05-22 04:45:31] [INFO ] Flatten gal took : 51 ms
[2024-05-22 04:45:32] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 537
Applied a total of 8 rules in 4 ms. Remains 76 /80 variables (removed 4) and now considering 537/573 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 76/80 places, 537/573 transitions.
[2024-05-22 04:45:32] [INFO ] Flatten gal took : 46 ms
[2024-05-22 04:45:32] [INFO ] Flatten gal took : 51 ms
[2024-05-22 04:45:32] [INFO ] Input system was already deterministic with 537 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 501
Applied a total of 16 rules in 4 ms. Remains 72 /80 variables (removed 8) and now considering 501/573 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 72/80 places, 501/573 transitions.
[2024-05-22 04:45:32] [INFO ] Flatten gal took : 40 ms
[2024-05-22 04:45:32] [INFO ] Flatten gal took : 46 ms
[2024-05-22 04:45:32] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 75 transition count 528
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 75 transition count 528
Applied a total of 10 rules in 4 ms. Remains 75 /80 variables (removed 5) and now considering 528/573 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 75/80 places, 528/573 transitions.
[2024-05-22 04:45:32] [INFO ] Flatten gal took : 42 ms
[2024-05-22 04:45:32] [INFO ] Flatten gal took : 47 ms
[2024-05-22 04:45:32] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 510
Applied a total of 14 rules in 4 ms. Remains 73 /80 variables (removed 7) and now considering 510/573 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 73/80 places, 510/573 transitions.
[2024-05-22 04:45:32] [INFO ] Flatten gal took : 55 ms
[2024-05-22 04:45:32] [INFO ] Flatten gal took : 53 ms
[2024-05-22 04:45:32] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 519
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 519
Applied a total of 12 rules in 5 ms. Remains 74 /80 variables (removed 6) and now considering 519/573 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 74/80 places, 519/573 transitions.
[2024-05-22 04:45:32] [INFO ] Flatten gal took : 37 ms
[2024-05-22 04:45:32] [INFO ] Flatten gal took : 40 ms
[2024-05-22 04:45:33] [INFO ] Input system was already deterministic with 519 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 80 transition count 567
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 74 transition count 567
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 74 transition count 566
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 73 transition count 566
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 67 transition count 512
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 67 transition count 512
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 2 with 2 rules applied. Total rules applied 28 place count 66 transition count 511
Applied a total of 28 rules in 139 ms. Remains 66 /80 variables (removed 14) and now considering 511/573 (removed 62) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 139 ms. Remains : 66/80 places, 511/573 transitions.
[2024-05-22 04:45:33] [INFO ] Flatten gal took : 37 ms
[2024-05-22 04:45:33] [INFO ] Flatten gal took : 39 ms
[2024-05-22 04:45:33] [INFO ] Input system was already deterministic with 511 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 519
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 519
Applied a total of 12 rules in 4 ms. Remains 74 /80 variables (removed 6) and now considering 519/573 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 74/80 places, 519/573 transitions.
[2024-05-22 04:45:33] [INFO ] Flatten gal took : 35 ms
[2024-05-22 04:45:33] [INFO ] Flatten gal took : 39 ms
[2024-05-22 04:45:33] [INFO ] Input system was already deterministic with 519 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 510
Applied a total of 14 rules in 5 ms. Remains 73 /80 variables (removed 7) and now considering 510/573 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 73/80 places, 510/573 transitions.
[2024-05-22 04:45:33] [INFO ] Flatten gal took : 49 ms
[2024-05-22 04:45:33] [INFO ] Flatten gal took : 53 ms
[2024-05-22 04:45:33] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 573/573 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 80 transition count 566
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 73 transition count 565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 72 transition count 565
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 72 transition count 564
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 18 place count 71 transition count 564
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 26 place count 63 transition count 492
Iterating global reduction 3 with 8 rules applied. Total rules applied 34 place count 63 transition count 492
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 36 place count 62 transition count 491
Applied a total of 36 rules in 60 ms. Remains 62 /80 variables (removed 18) and now considering 491/573 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 62/80 places, 491/573 transitions.
[2024-05-22 04:45:33] [INFO ] Flatten gal took : 32 ms
[2024-05-22 04:45:33] [INFO ] Flatten gal took : 35 ms
[2024-05-22 04:45:33] [INFO ] Input system was already deterministic with 491 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 501
Applied a total of 16 rules in 5 ms. Remains 72 /80 variables (removed 8) and now considering 501/573 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 72/80 places, 501/573 transitions.
[2024-05-22 04:45:33] [INFO ] Flatten gal took : 32 ms
[2024-05-22 04:45:34] [INFO ] Flatten gal took : 35 ms
[2024-05-22 04:45:34] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 537
Applied a total of 8 rules in 4 ms. Remains 76 /80 variables (removed 4) and now considering 537/573 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 76/80 places, 537/573 transitions.
[2024-05-22 04:45:34] [INFO ] Flatten gal took : 33 ms
[2024-05-22 04:45:34] [INFO ] Flatten gal took : 36 ms
[2024-05-22 04:45:34] [INFO ] Input system was already deterministic with 537 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 537
Applied a total of 8 rules in 5 ms. Remains 76 /80 variables (removed 4) and now considering 537/573 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 76/80 places, 537/573 transitions.
[2024-05-22 04:45:34] [INFO ] Flatten gal took : 35 ms
[2024-05-22 04:45:34] [INFO ] Flatten gal took : 36 ms
[2024-05-22 04:45:34] [INFO ] Input system was already deterministic with 537 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 77 transition count 546
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 77 transition count 546
Applied a total of 6 rules in 4 ms. Remains 77 /80 variables (removed 3) and now considering 546/573 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 77/80 places, 546/573 transitions.
[2024-05-22 04:45:34] [INFO ] Flatten gal took : 35 ms
[2024-05-22 04:45:34] [INFO ] Flatten gal took : 38 ms
[2024-05-22 04:45:34] [INFO ] Input system was already deterministic with 546 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 78 transition count 555
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 78 transition count 555
Applied a total of 4 rules in 4 ms. Remains 78 /80 variables (removed 2) and now considering 555/573 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 78/80 places, 555/573 transitions.
[2024-05-22 04:45:34] [INFO ] Flatten gal took : 35 ms
[2024-05-22 04:45:34] [INFO ] Flatten gal took : 38 ms
[2024-05-22 04:45:34] [INFO ] Input system was already deterministic with 555 transitions.
[2024-05-22 04:45:34] [INFO ] Flatten gal took : 40 ms
[2024-05-22 04:45:34] [INFO ] Flatten gal took : 41 ms
[2024-05-22 04:45:34] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 14 ms.
[2024-05-22 04:45:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 80 places, 573 transitions and 6806 arcs took 17 ms.
Total runtime 182772 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-08a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 80
TRANSITIONS: 573
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.036s, Sys 0.007s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.004s]


----------------------------------------------------------------------
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: 637
MODEL NAME: /home/mcc/execution/412/model
80 places, 573 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-08a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-08a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716353144730

--------------------
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-08a"
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-08a, 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-171620166400330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08a.tgz
mv AutonomousCar-PT-08a 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;