About the Execution of LTSMin+red for AutonomousCar-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3095.771 | 148911.00 | 216113.00 | 459.00 | ????????T??????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167500362.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 ltsminxred
Input is AutonomousCar-PT-10a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500362
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 17:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 17:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:53 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 1.5M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-10a-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717224892367
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:54:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:54:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:54:54] [INFO ] Load time of PNML (sax parser for PT used): 390 ms
[2024-06-01 06:54:54] [INFO ] Transformed 97 places.
[2024-06-01 06:54:54] [INFO ] Transformed 1921 transitions.
[2024-06-01 06:54:54] [INFO ] Found NUPN structural information;
[2024-06-01 06:54:54] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 603 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
Support contains 64 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 96 transition count 1497
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 1497
Applied a total of 2 rules in 60 ms. Remains 96 /97 variables (removed 1) and now considering 1497/1498 (removed 1) transitions.
// Phase 1: matrix 1497 rows 96 cols
[2024-06-01 06:54:55] [INFO ] Computed 14 invariants in 59 ms
[2024-06-01 06:54:55] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-06-01 06:54:55] [INFO ] Invariant cache hit.
[2024-06-01 06:54:56] [INFO ] State equation strengthened by 403 read => feed constraints.
[2024-06-01 06:54:56] [INFO ] Implicit Places using invariants and state equation in 811 ms returned [92, 94]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1286 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/97 places, 1497/1498 transitions.
Applied a total of 0 rules in 9 ms. Remains 94 /94 variables (removed 0) and now considering 1497/1497 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1382 ms. Remains : 94/97 places, 1497/1498 transitions.
Support contains 64 out of 94 places after structural reductions.
[2024-06-01 06:54:57] [INFO ] Flatten gal took : 519 ms
[2024-06-01 06:54:57] [INFO ] Flatten gal took : 295 ms
[2024-06-01 06:54:58] [INFO ] Input system was already deterministic with 1497 transitions.
Reduction of identical properties reduced properties to check from 86 to 85
RANDOM walk for 40000 steps (1816 resets) in 4850 ms. (8 steps per ms) remains 61/85 properties
BEST_FIRST walk for 4004 steps (13 resets) in 83 ms. (47 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4003 steps (9 resets) in 50 ms. (78 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4004 steps (15 resets) in 44 ms. (88 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (14 resets) in 44 ms. (88 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (14 resets) in 41 ms. (95 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4004 steps (14 resets) in 34 ms. (114 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (12 resets) in 34 ms. (114 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4004 steps (14 resets) in 25 ms. (154 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (14 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (14 resets) in 50 ms. (78 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (14 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (15 resets) in 25 ms. (153 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (13 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (14 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (12 resets) in 57 ms. (69 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4002 steps (9 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (15 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (12 resets) in 130 ms. (30 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (15 resets) in 33 ms. (117 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (13 resets) in 118 ms. (33 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (12 resets) in 46 ms. (85 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (13 resets) in 47 ms. (83 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (14 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
// Phase 1: matrix 1497 rows 94 cols
[2024-06-01 06:55:00] [INFO ] Computed 12 invariants in 19 ms
[2024-06-01 06:55:00] [INFO ] State equation strengthened by 403 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, 52 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 1 (OVERLAPS) 36/86 variables, 12/12 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1490/1576 variables, 86/98 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1576 variables, 402/500 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1576 variables, 0/500 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 13/1589 variables, 7/507 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1589 variables, 0/507 constraints. Problems are: Problem set: 4 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/1590 variables, 1/508 constraints. Problems are: Problem set: 4 solved, 48 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1590/1591 variables, and 508 constraints, problems are : Problem set: 4 solved, 48 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 94/94 constraints, ReadFeed: 402/403 constraints, PredecessorRefiner: 52/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 48 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp42 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/86 variables, 12/12 constraints. Problems are: Problem set: 6 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 1490/1576 variables, 86/98 constraints. Problems are: Problem set: 6 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1576 variables, 402/500 constraints. Problems are: Problem set: 6 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1576 variables, 0/500 constraints. Problems are: Problem set: 6 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 13/1589 variables, 7/507 constraints. Problems are: Problem set: 6 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1589 variables, 0/507 constraints. Problems are: Problem set: 6 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/1590 variables, 1/508 constraints. Problems are: Problem set: 6 solved, 46 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1590/1591 variables, and 508 constraints, problems are : Problem set: 6 solved, 46 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 94/94 constraints, ReadFeed: 402/403 constraints, PredecessorRefiner: 48/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11619ms problems are : Problem set: 6 solved, 46 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Graph (complete) has 1246 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.36 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 93 transition count 1488
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 88 transition count 1486
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 86 transition count 1486
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 18 place count 86 transition count 1483
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 83 transition count 1483
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 31 place count 76 transition count 1416
Iterating global reduction 3 with 7 rules applied. Total rules applied 38 place count 76 transition count 1416
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 44 place count 76 transition count 1410
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 100 place count 70 transition count 1360
Applied a total of 100 rules in 508 ms. Remains 70 /94 variables (removed 24) and now considering 1360/1497 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 70/94 places, 1360/1497 transitions.
RANDOM walk for 40000 steps (135 resets) in 1633 ms. (24 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (12 resets) in 31 ms. (125 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (11 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (16 resets) in 21 ms. (181 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 40/42 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (12 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (15 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4003 steps (15 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (14 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (13 resets) in 21 ms. (181 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4003 steps (13 resets) in 21 ms. (181 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 27/28 properties
// Phase 1: matrix 1360 rows 70 cols
[2024-06-01 06:55:13] [INFO ] Computed 14 invariants in 13 ms
[2024-06-01 06:55:13] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 29/69 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1360/1430 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1430 variables, 291/375 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1430 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/1430 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1430/1430 variables, and 375 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2295 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 27/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 29/69 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1360/1430 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1430 variables, 291/375 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1430 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/1430 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1430/1430 variables, and 375 constraints, problems are : Problem set: 0 solved, 27 unsolved in 3380 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 27/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6373ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 2 properties in 5237 ms.
Support contains 40 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1360/1360 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 69 transition count 1349
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 69 transition count 1349
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 68 transition count 1348
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 68 transition count 1347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 67 transition count 1347
Applied a total of 6 rules in 271 ms. Remains 67 /70 variables (removed 3) and now considering 1347/1360 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 67/70 places, 1347/1360 transitions.
RANDOM walk for 40000 steps (265 resets) in 1804 ms. (22 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (13 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (14 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
// Phase 1: matrix 1347 rows 67 cols
[2024-06-01 06:55:25] [INFO ] Computed 14 invariants in 13 ms
[2024-06-01 06:55:25] [INFO ] State equation strengthened by 281 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 27/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1347/1414 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 281/362 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/1414 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1414/1414 variables, and 362 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1711 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 67/67 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 20/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 27/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1347/1414 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 281/362 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/1414 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1414/1414 variables, and 362 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2662 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 67/67 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 20/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4791ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 0 properties in 1638 ms.
Support contains 39 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1347/1347 transitions.
Applied a total of 0 rules in 85 ms. Remains 67 /67 variables (removed 0) and now considering 1347/1347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 67/67 places, 1347/1347 transitions.
RANDOM walk for 40000 steps (333 resets) in 1528 ms. (26 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 21 ms. (182 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 23 ms. (166 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
[2024-06-01 06:55:33] [INFO ] Invariant cache hit.
[2024-06-01 06:55:33] [INFO ] State equation strengthened by 281 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, 13 unsolved
At refinement iteration 1 (OVERLAPS) 29/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1347/1414 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 281/362 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/1414 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1414/1414 variables, and 362 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 67/67 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 29/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1347/1414 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 281/362 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/1414 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1414/1414 variables, and 362 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1878 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 67/67 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3347ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 1 properties in 7135 ms.
Support contains 34 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1347/1347 transitions.
Applied a total of 0 rules in 86 ms. Remains 67 /67 variables (removed 0) and now considering 1347/1347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 67/67 places, 1347/1347 transitions.
RANDOM walk for 40000 steps (207 resets) in 1303 ms. (30 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (115 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (51 resets) in 135 ms. (294 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (98 resets) in 104 ms. (380 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (81 resets) in 145 ms. (274 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (103 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (85 resets) in 131 ms. (303 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (91 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (110 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (94 resets) in 102 ms. (388 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (102 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (94 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
[2024-06-01 06:55:44] [INFO ] Invariant cache hit.
[2024-06-01 06:55:44] [INFO ] State equation strengthened by 281 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 28/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 27/67 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1347/1414 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 281/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1414 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1414/1414 variables, and 362 constraints, problems are : Problem set: 0 solved, 5 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 67/67 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 28/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 27/67 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1347/1414 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 281/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1414 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1414/1414 variables, and 362 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 67/67 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1949ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 3509 ms.
Support contains 12 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1347/1347 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 1345
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 1341
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 42 place count 61 transition count 1311
Applied a total of 42 rules in 245 ms. Remains 61 /67 variables (removed 6) and now considering 1311/1347 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 61/67 places, 1311/1347 transitions.
RANDOM walk for 40000 steps (12 resets) in 1104 ms. (36 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (107 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (63 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (90 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (53 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (100 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 426764 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 5
Probabilistic random walk after 426764 steps, saw 64297 distinct states, run finished after 3008 ms. (steps per millisecond=141 ) properties seen :0
// Phase 1: matrix 1311 rows 61 cols
[2024-06-01 06:55:53] [INFO ] Computed 14 invariants in 10 ms
[2024-06-01 06:55:53] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 24/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 25/61 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1311/1372 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1372 variables, 251/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1372 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1372 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1372/1372 variables, and 326 constraints, problems are : Problem set: 0 solved, 5 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 24/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 25/61 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1311/1372 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1372 variables, 251/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1372 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1372 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1372/1372 variables, and 326 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1913ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2725 ms.
Support contains 12 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1311/1311 transitions.
Applied a total of 0 rules in 94 ms. Remains 61 /61 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 61/61 places, 1311/1311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1311/1311 transitions.
Applied a total of 0 rules in 93 ms. Remains 61 /61 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
[2024-06-01 06:55:58] [INFO ] Invariant cache hit.
[2024-06-01 06:55:59] [INFO ] Implicit Places using invariants in 705 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 709 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 1311/1311 transitions.
Applied a total of 0 rules in 92 ms. Remains 60 /60 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 895 ms. Remains : 60/61 places, 1311/1311 transitions.
RANDOM walk for 40000 steps (29 resets) in 1360 ms. (29 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (110 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (64 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (94 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (50 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (94 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 423816 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 5
Probabilistic random walk after 423816 steps, saw 63840 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
// Phase 1: matrix 1311 rows 60 cols
[2024-06-01 06:56:02] [INFO ] Computed 13 invariants in 12 ms
[2024-06-01 06:56:02] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 24/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/60 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1311/1371 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1371 variables, 251/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1371 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1371 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1371/1371 variables, and 324 constraints, problems are : Problem set: 0 solved, 5 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 24/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/60 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1311/1371 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1371 variables, 251/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1371 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1371 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1371/1371 variables, and 324 constraints, problems are : Problem set: 0 solved, 5 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1861ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 5667 ms.
Support contains 12 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1311/1311 transitions.
Applied a total of 0 rules in 93 ms. Remains 60 /60 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 60/60 places, 1311/1311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1311/1311 transitions.
Applied a total of 0 rules in 92 ms. Remains 60 /60 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
[2024-06-01 06:56:10] [INFO ] Invariant cache hit.
[2024-06-01 06:56:11] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-06-01 06:56:11] [INFO ] Invariant cache hit.
[2024-06-01 06:56:11] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-06-01 06:56:12] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
[2024-06-01 06:56:12] [INFO ] Redundant transitions in 115 ms returned []
Running 1310 sub problems to find dead transitions.
[2024-06-01 06:56:12] [INFO ] Invariant cache hit.
[2024-06-01 06:56:12] [INFO ] State equation strengthened by 251 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1310 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1310 unsolved
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 23 places in 1076 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1310 unsolved
SMT process timed out in 55476ms, After SMT, problems are : Problem set: 0 solved, 1310 unsolved
Search for dead transitions found 0 dead transitions in 55501ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57596 ms. Remains : 60/60 places, 1311/1311 transitions.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-10a-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:57:08] [INFO ] Flatten gal took : 210 ms
[2024-06-01 06:57:08] [INFO ] Flatten gal took : 194 ms
[2024-06-01 06:57:08] [INFO ] Input system was already deterministic with 1497 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 94 transition count 1487
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 84 transition count 1487
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 84 transition count 1485
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 82 transition count 1485
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 34 place count 72 transition count 1375
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 72 transition count 1375
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 46 place count 71 transition count 1374
Applied a total of 46 rules in 310 ms. Remains 71 /94 variables (removed 23) and now considering 1374/1497 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 312 ms. Remains : 71/94 places, 1374/1497 transitions.
[2024-06-01 06:57:09] [INFO ] Flatten gal took : 223 ms
[2024-06-01 06:57:09] [INFO ] Flatten gal took : 225 ms
[2024-06-01 06:57:10] [INFO ] Input system was already deterministic with 1374 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 94 transition count 1487
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 84 transition count 1487
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 84 transition count 1485
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 24 place count 82 transition count 1485
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 34 place count 72 transition count 1375
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 72 transition count 1375
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 46 place count 71 transition count 1374
Applied a total of 46 rules in 324 ms. Remains 71 /94 variables (removed 23) and now considering 1374/1497 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 325 ms. Remains : 71/94 places, 1374/1497 transitions.
[2024-06-01 06:57:10] [INFO ] Flatten gal took : 235 ms
[2024-06-01 06:57:10] [INFO ] Flatten gal took : 207 ms
[2024-06-01 06:57:11] [INFO ] Input system was already deterministic with 1374 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 94 transition count 1488
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 85 transition count 1488
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 85 transition count 1486
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 83 transition count 1486
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 31 place count 74 transition count 1387
Iterating global reduction 2 with 9 rules applied. Total rules applied 40 place count 74 transition count 1387
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 42 place count 73 transition count 1386
Applied a total of 42 rules in 181 ms. Remains 73 /94 variables (removed 21) and now considering 1386/1497 (removed 111) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 182 ms. Remains : 73/94 places, 1386/1497 transitions.
[2024-06-01 06:57:11] [INFO ] Flatten gal took : 200 ms
[2024-06-01 06:57:11] [INFO ] Flatten gal took : 259 ms
[2024-06-01 06:57:12] [INFO ] Input system was already deterministic with 1386 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 89 transition count 1442
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 89 transition count 1442
Applied a total of 10 rules in 13 ms. Remains 89 /94 variables (removed 5) and now considering 1442/1497 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 89/94 places, 1442/1497 transitions.
[2024-06-01 06:57:12] [INFO ] Flatten gal took : 146 ms
[2024-06-01 06:57:12] [INFO ] Flatten gal took : 157 ms
[2024-06-01 06:57:12] [INFO ] Input system was already deterministic with 1442 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 94 transition count 1487
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 84 transition count 1487
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 84 transition count 1485
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 82 transition count 1485
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 34 place count 72 transition count 1375
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 72 transition count 1375
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 46 place count 71 transition count 1374
Applied a total of 46 rules in 180 ms. Remains 71 /94 variables (removed 23) and now considering 1374/1497 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 181 ms. Remains : 71/94 places, 1374/1497 transitions.
[2024-06-01 06:57:13] [INFO ] Flatten gal took : 198 ms
[2024-06-01 06:57:13] [INFO ] Flatten gal took : 208 ms
[2024-06-01 06:57:13] [INFO ] Input system was already deterministic with 1374 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 85 transition count 1398
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 85 transition count 1398
Applied a total of 18 rules in 11 ms. Remains 85 /94 variables (removed 9) and now considering 1398/1497 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 85/94 places, 1398/1497 transitions.
[2024-06-01 06:57:13] [INFO ] Flatten gal took : 142 ms
[2024-06-01 06:57:14] [INFO ] Flatten gal took : 151 ms
[2024-06-01 06:57:14] [INFO ] Input system was already deterministic with 1398 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 84 transition count 1387
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 84 transition count 1387
Applied a total of 20 rules in 13 ms. Remains 84 /94 variables (removed 10) and now considering 1387/1497 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 84/94 places, 1387/1497 transitions.
[2024-06-01 06:57:14] [INFO ] Flatten gal took : 161 ms
[2024-06-01 06:57:14] [INFO ] Flatten gal took : 151 ms
[2024-06-01 06:57:14] [INFO ] Input system was already deterministic with 1387 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 86 transition count 1409
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 86 transition count 1409
Applied a total of 16 rules in 12 ms. Remains 86 /94 variables (removed 8) and now considering 1409/1497 (removed 88) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 86/94 places, 1409/1497 transitions.
[2024-06-01 06:57:15] [INFO ] Flatten gal took : 142 ms
[2024-06-01 06:57:15] [INFO ] Flatten gal took : 198 ms
[2024-06-01 06:57:15] [INFO ] Input system was already deterministic with 1409 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 86 transition count 1409
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 86 transition count 1409
Applied a total of 16 rules in 11 ms. Remains 86 /94 variables (removed 8) and now considering 1409/1497 (removed 88) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 86/94 places, 1409/1497 transitions.
[2024-06-01 06:57:15] [INFO ] Flatten gal took : 143 ms
[2024-06-01 06:57:15] [INFO ] Flatten gal took : 152 ms
[2024-06-01 06:57:16] [INFO ] Input system was already deterministic with 1409 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 84 transition count 1387
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 84 transition count 1387
Applied a total of 20 rules in 10 ms. Remains 84 /94 variables (removed 10) and now considering 1387/1497 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 84/94 places, 1387/1497 transitions.
[2024-06-01 06:57:16] [INFO ] Flatten gal took : 141 ms
[2024-06-01 06:57:16] [INFO ] Flatten gal took : 151 ms
[2024-06-01 06:57:16] [INFO ] Input system was already deterministic with 1387 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 85 transition count 1398
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 85 transition count 1398
Applied a total of 18 rules in 14 ms. Remains 85 /94 variables (removed 9) and now considering 1398/1497 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 85/94 places, 1398/1497 transitions.
[2024-06-01 06:57:16] [INFO ] Flatten gal took : 141 ms
[2024-06-01 06:57:17] [INFO ] Flatten gal took : 194 ms
[2024-06-01 06:57:17] [INFO ] Input system was already deterministic with 1398 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 87 transition count 1420
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 87 transition count 1420
Applied a total of 14 rules in 11 ms. Remains 87 /94 variables (removed 7) and now considering 1420/1497 (removed 77) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 87/94 places, 1420/1497 transitions.
[2024-06-01 06:57:17] [INFO ] Flatten gal took : 143 ms
[2024-06-01 06:57:17] [INFO ] Flatten gal took : 153 ms
[2024-06-01 06:57:18] [INFO ] Input system was already deterministic with 1420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 85 transition count 1398
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 85 transition count 1398
Applied a total of 18 rules in 13 ms. Remains 85 /94 variables (removed 9) and now considering 1398/1497 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 85/94 places, 1398/1497 transitions.
[2024-06-01 06:57:18] [INFO ] Flatten gal took : 166 ms
[2024-06-01 06:57:18] [INFO ] Flatten gal took : 178 ms
[2024-06-01 06:57:18] [INFO ] Input system was already deterministic with 1398 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 85 transition count 1398
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 85 transition count 1398
Applied a total of 18 rules in 14 ms. Remains 85 /94 variables (removed 9) and now considering 1398/1497 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 85/94 places, 1398/1497 transitions.
[2024-06-01 06:57:19] [INFO ] Flatten gal took : 141 ms
[2024-06-01 06:57:19] [INFO ] Flatten gal took : 151 ms
[2024-06-01 06:57:19] [INFO ] Input system was already deterministic with 1398 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 1497/1497 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 94 transition count 1487
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 84 transition count 1487
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 84 transition count 1485
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 24 place count 82 transition count 1485
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 74 transition count 1397
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 74 transition count 1397
Applied a total of 40 rules in 155 ms. Remains 74 /94 variables (removed 20) and now considering 1397/1497 (removed 100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 155 ms. Remains : 74/94 places, 1397/1497 transitions.
[2024-06-01 06:57:19] [INFO ] Flatten gal took : 196 ms
[2024-06-01 06:57:20] [INFO ] Flatten gal took : 208 ms
[2024-06-01 06:57:20] [INFO ] Input system was already deterministic with 1397 transitions.
[2024-06-01 06:57:20] [INFO ] Flatten gal took : 157 ms
[2024-06-01 06:57:20] [INFO ] Flatten gal took : 158 ms
[2024-06-01 06:57:20] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 13 ms.
[2024-06-01 06:57:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 94 places, 1497 transitions and 25897 arcs took 37 ms.
Total runtime 146756 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2024-00
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2024-01
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2024-02
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2024-03
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2024-04
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2024-05
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2024-06
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2024-07
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2024-09
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2024-10
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2024-11
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2023-12
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2023-13
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2023-14
Could not compute solution for formula : AutonomousCar-PT-10a-CTLFireability-2023-15
BK_STOP 1717225041278
--------------------
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
mcc2024
ctl formula name AutonomousCar-PT-10a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/595/ctl_0_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/595/ctl_1_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/595/ctl_2_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/595/ctl_3_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/595/ctl_4_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/595/ctl_5_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/595/ctl_6_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/595/ctl_7_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/595/ctl_8_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/595/ctl_9_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/595/ctl_10_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/595/ctl_11_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/595/ctl_12_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/595/ctl_13_
ctl formula name AutonomousCar-PT-10a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/595/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-10a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-10a, 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 r468-smll-171620167500362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-10a.tgz
mv AutonomousCar-PT-10a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;