Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r025-smll-171620166500362.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is AutonomousCar-PT-10a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166500362
=====================================================================

--------------------
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 1716361496815

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:04:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:04:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:05:00] [INFO ] Load time of PNML (sax parser for PT used): 655 ms
[2024-05-22 07:05:00] [INFO ] Transformed 97 places.
[2024-05-22 07:05:00] [INFO ] Transformed 1921 transitions.
[2024-05-22 07:05:00] [INFO ] Found NUPN structural information;
[2024-05-22 07:05:00] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 1002 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 57 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 70 ms. Remains 96 /97 variables (removed 1) and now considering 1497/1498 (removed 1) transitions.
// Phase 1: matrix 1497 rows 96 cols
[2024-05-22 07:05:01] [INFO ] Computed 14 invariants in 67 ms
[2024-05-22 07:05:01] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-22 07:05:01] [INFO ] Invariant cache hit.
[2024-05-22 07:05:02] [INFO ] State equation strengthened by 403 read => feed constraints.
[2024-05-22 07:05:02] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned [92, 94]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1563 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 10 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 1672 ms. Remains : 94/97 places, 1497/1498 transitions.
Support contains 64 out of 94 places after structural reductions.
[2024-05-22 07:05:03] [INFO ] Flatten gal took : 532 ms
[2024-05-22 07:05:03] [INFO ] Flatten gal took : 312 ms
[2024-05-22 07:05:04] [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 (1792 resets) in 7269 ms. (5 steps per ms) remains 63/85 properties
BEST_FIRST walk for 4004 steps (13 resets) in 79 ms. (50 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4004 steps (12 resets) in 52 ms. (75 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (14 resets) in 77 ms. (51 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (12 resets) in 53 ms. (74 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4002 steps (14 resets) in 39 ms. (100 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (14 resets) in 55 ms. (71 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (14 resets) in 31 ms. (125 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4004 steps (16 resets) in 25 ms. (154 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (12 resets) in 57 ms. (69 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (14 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4003 steps (10 resets) in 23 ms. (166 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4003 steps (13 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (13 resets) in 37 ms. (105 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (11 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (10 resets) in 25 ms. (154 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4001 steps (14 resets) in 44 ms. (88 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (11 resets) in 105 ms. (37 steps per ms) remains 55/57 properties
BEST_FIRST walk for 4003 steps (13 resets) in 30 ms. (129 steps per ms) remains 53/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (11 resets) in 47 ms. (83 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (12 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (11 resets) in 186 ms. (21 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4004 steps (12 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (13 resets) in 52 ms. (75 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (11 resets) in 129 ms. (30 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (9 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (13 resets) in 53 ms. (74 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (13 resets) in 49 ms. (80 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4004 steps (12 resets) in 48 ms. (81 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (12 resets) in 52 ms. (75 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (12 resets) in 101 ms. (39 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (12 resets) in 48 ms. (81 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (10 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (13 resets) in 65 ms. (60 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (15 resets) in 44 ms. (88 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (14 resets) in 57 ms. (69 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (9 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (11 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (13 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (15 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (12 resets) in 31 ms. (125 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (13 resets) in 27 ms. (143 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4004 steps (14 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (12 resets) in 48 ms. (81 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (15 resets) in 25 ms. (154 steps per ms) remains 48/48 properties
// Phase 1: matrix 1497 rows 94 cols
[2024-05-22 07:05:07] [INFO ] Computed 12 invariants in 27 ms
[2024-05-22 07:05:08] [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, 48 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, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1490/1576 variables, 86/98 constraints. Problems are: Problem set: 4 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1576 variables, 402/500 constraints. Problems are: Problem set: 4 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1576 variables, 0/500 constraints. Problems are: Problem set: 4 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 13/1589 variables, 7/507 constraints. Problems are: Problem set: 4 solved, 44 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1589/1591 variables, and 507 constraints, problems are : Problem set: 4 solved, 44 unsolved in 5031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 93/94 constraints, ReadFeed: 402/403 constraints, PredecessorRefiner: 48/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 44 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, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 1490/1576 variables, 86/98 constraints. Problems are: Problem set: 6 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1576 variables, 402/500 constraints. Problems are: Problem set: 6 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1576 variables, 0/500 constraints. Problems are: Problem set: 6 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 13/1589 variables, 7/507 constraints. Problems are: Problem set: 6 solved, 42 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1589/1591 variables, and 507 constraints, problems are : Problem set: 6 solved, 42 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 93/94 constraints, ReadFeed: 402/403 constraints, PredecessorRefiner: 44/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11727ms problems are : Problem set: 6 solved, 42 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.55 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 3 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 771 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 773 ms. Remains : 70/94 places, 1360/1497 transitions.
RANDOM walk for 40000 steps (355 resets) in 1625 ms. (24 steps per ms) remains 39/42 properties
BEST_FIRST walk for 4004 steps (11 resets) in 33 ms. (117 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (11 resets) in 22 ms. (174 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (10 resets) in 27 ms. (143 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (14 resets) in 24 ms. (160 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4004 steps (13 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 22 ms. (174 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (9 resets) in 30 ms. (129 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (14 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (14 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (14 resets) in 22 ms. (174 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (13 resets) in 23 ms. (166 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (13 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (11 resets) in 39 ms. (100 steps per ms) remains 25/26 properties
// Phase 1: matrix 1360 rows 70 cols
[2024-05-22 07:05:21] [INFO ] Computed 14 invariants in 14 ms
[2024-05-22 07:05:21] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 27/69 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1360/1430 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1430 variables, 291/375 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1430 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/1430 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1430/1430 variables, and 375 constraints, problems are : Problem set: 0 solved, 25 unsolved in 2797 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 25/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 27/69 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1360/1430 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1430 variables, 291/375 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1430 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/1430 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1430/1430 variables, and 375 constraints, problems are : Problem set: 0 solved, 25 unsolved in 4781 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 25/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8230ms problems are : Problem set: 0 solved, 25 unsolved
Parikh walk visited 2 properties in 2658 ms.
Support contains 42 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1360/1360 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 70 transition count 1359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 69 transition count 1359
Applied a total of 2 rules in 350 ms. Remains 69 /70 variables (removed 1) and now considering 1359/1360 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 69/70 places, 1359/1360 transitions.
RANDOM walk for 40000 steps (414 resets) in 2506 ms. (15 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (11 resets) in 24 ms. (160 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (13 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (13 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (13 resets) in 48 ms. (81 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 30 ms. (129 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
// Phase 1: matrix 1359 rows 69 cols
[2024-05-22 07:05:33] [INFO ] Computed 14 invariants in 14 ms
[2024-05-22 07:05:33] [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, 18 unsolved
At refinement iteration 1 (OVERLAPS) 28/68 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1359/1428 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1428 variables, 291/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1428 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/1428 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1428 variables, and 374 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1890 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 69/69 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 18/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 28/68 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1359/1428 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1428 variables, 291/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1428 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/1428 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1428/1428 variables, and 374 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2527 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 69/69 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 18/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4826ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 3440 ms.
Support contains 40 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 1359/1359 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 69 transition count 1358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 1358
Applied a total of 2 rules in 186 ms. Remains 68 /69 variables (removed 1) and now considering 1358/1359 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 68/69 places, 1358/1359 transitions.
RANDOM walk for 40000 steps (292 resets) in 1762 ms. (22 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (13 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
// Phase 1: matrix 1358 rows 68 cols
[2024-05-22 07:05:42] [INFO ] Computed 14 invariants in 12 ms
[2024-05-22 07:05:42] [INFO ] State equation strengthened by 291 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, 14 unsolved
At refinement iteration 1 (OVERLAPS) 28/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1358/1426 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1426 variables, 291/373 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1426 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/1426 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1426/1426 variables, and 373 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1588 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 14/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 28/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1358/1426 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1426 variables, 291/373 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1426 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/1426 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1426/1426 variables, and 373 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1928 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 14/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3857ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 3 properties in 17889 ms.
Support contains 34 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1358/1358 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 67 transition count 1347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 1347
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 66 transition count 1346
Applied a total of 4 rules in 134 ms. Remains 66 /68 variables (removed 2) and now considering 1346/1358 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 66/68 places, 1346/1358 transitions.
RANDOM walk for 40000 steps (261 resets) in 1380 ms. (28 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (123 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (99 resets) in 102 ms. (388 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (89 resets) in 96 ms. (412 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (26 resets) in 126 ms. (314 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (98 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (96 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (106 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (91 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
// Phase 1: matrix 1346 rows 66 cols
[2024-05-22 07:06:05] [INFO ] Computed 14 invariants in 9 ms
[2024-05-22 07:06:05] [INFO ] State equation strengthened by 281 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 43/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1346/1412 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1412 variables, 281/361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1412 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1412 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1412/1412 variables, and 361 constraints, problems are : Problem set: 0 solved, 6 unsolved in 929 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 66/66 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 43/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1346/1412 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1412 variables, 281/361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1412 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1412 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1412/1412 variables, and 361 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1209 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 66/66 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2320ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 3396 ms.
Support contains 22 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 1346/1346 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 66 transition count 1343
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 36 place count 63 transition count 1313
Applied a total of 36 rules in 187 ms. Remains 63 /66 variables (removed 3) and now considering 1313/1346 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 63/66 places, 1313/1346 transitions.
RANDOM walk for 40000 steps (26 resets) in 1736 ms. (23 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (101 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (19 resets) in 195 ms. (204 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (85 resets) in 103 ms. (384 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (96 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (44 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (100 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
// Phase 1: matrix 1313 rows 63 cols
[2024-05-22 07:06:12] [INFO ] Computed 14 invariants in 10 ms
[2024-05-22 07:06:12] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/63 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1313/1376 variables, 63/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1376 variables, 251/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1376 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1376 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1376/1376 variables, and 328 constraints, problems are : Problem set: 0 solved, 4 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 63/63 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/63 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1313/1376 variables, 63/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1376 variables, 251/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1376 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1376 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1376/1376 variables, and 328 constraints, problems are : Problem set: 0 solved, 4 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 63/63 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1949ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2227 ms.
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1313/1313 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 61 transition count 1311
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 61 transition count 1310
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 16 place count 60 transition count 1300
Applied a total of 16 rules in 225 ms. Remains 60 /63 variables (removed 3) and now considering 1300/1313 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 60/63 places, 1300/1313 transitions.
RANDOM walk for 40000 steps (13 resets) in 1707 ms. (23 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (145 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (106 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (28 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (105 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 419646 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 4
Probabilistic random walk after 419646 steps, saw 62305 distinct states, run finished after 3018 ms. (steps per millisecond=139 ) properties seen :0
// Phase 1: matrix 1300 rows 60 cols
[2024-05-22 07:06:20] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 07:06:20] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 21/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/60 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1300/1360 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 241/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1360 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1360 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1360/1360 variables, and 315 constraints, problems are : Problem set: 0 solved, 4 unsolved in 716 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 21/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/60 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1300/1360 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 241/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1360 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1360 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1360/1360 variables, and 315 constraints, problems are : Problem set: 0 solved, 4 unsolved in 892 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1728ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 4943 ms.
Support contains 10 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1300/1300 transitions.
Applied a total of 0 rules in 93 ms. Remains 60 /60 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 60/60 places, 1300/1300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1300/1300 transitions.
Applied a total of 0 rules in 91 ms. Remains 60 /60 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2024-05-22 07:06:26] [INFO ] Invariant cache hit.
[2024-05-22 07:06:27] [INFO ] Implicit Places using invariants in 975 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 987 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/60 places, 1300/1300 transitions.
Applied a total of 0 rules in 92 ms. Remains 59 /59 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1170 ms. Remains : 59/60 places, 1300/1300 transitions.
RANDOM walk for 40000 steps (18 resets) in 1451 ms. (27 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (141 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (103 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (28 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (108 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 414140 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 4
Probabilistic random walk after 414140 steps, saw 61670 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
// Phase 1: matrix 1300 rows 59 cols
[2024-05-22 07:06:31] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 07:06:31] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 21/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 28/59 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1300/1359 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1359 variables, 241/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1359 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1359 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1359/1359 variables, and 313 constraints, problems are : Problem set: 0 solved, 4 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 59/59 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 21/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 28/59 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1300/1359 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1359 variables, 241/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1359 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1359 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1359/1359 variables, and 313 constraints, problems are : Problem set: 0 solved, 4 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 59/59 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1693ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 4409 ms.
Support contains 10 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1300/1300 transitions.
Applied a total of 0 rules in 89 ms. Remains 59 /59 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 59/59 places, 1300/1300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1300/1300 transitions.
Applied a total of 0 rules in 88 ms. Remains 59 /59 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2024-05-22 07:06:37] [INFO ] Invariant cache hit.
[2024-05-22 07:06:38] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-05-22 07:06:38] [INFO ] Invariant cache hit.
[2024-05-22 07:06:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-22 07:06:39] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2024-05-22 07:06:40] [INFO ] Redundant transitions in 114 ms returned []
Running 1299 sub problems to find dead transitions.
[2024-05-22 07:06:40] [INFO ] Invariant cache hit.
[2024-05-22 07:06:40] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1299 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1299 unsolved
[2024-05-22 07:07:22] [INFO ] Deduced a trap composed of 23 places in 1656 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 59/1359 variables, and 14 constraints, problems are : Problem set: 0 solved, 1299 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/59 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 1299/34 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1299 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1299 unsolved
At refinement iteration 4 (OVERLAPS) 1300/1359 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 1299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1359 variables, 241/314 constraints. Problems are: Problem set: 0 solved, 1299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1359 variables, 34/348 constraints. Problems are: Problem set: 0 solved, 1299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1359/1359 variables, and 348 constraints, problems are : Problem set: 0 solved, 1299 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 59/59 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1299/34 constraints, Known Traps: 1/1 constraints]
After SMT, in 85360ms problems are : Problem set: 0 solved, 1299 unsolved
Search for dead transitions found 0 dead transitions in 85385ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87608 ms. Remains : 59/59 places, 1300/1300 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-05-22 07:08:05] [INFO ] Flatten gal took : 312 ms
[2024-05-22 07:08:06] [INFO ] Flatten gal took : 433 ms
[2024-05-22 07:08:06] [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 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 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 261 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 262 ms. Remains : 71/94 places, 1374/1497 transitions.
[2024-05-22 07:08:07] [INFO ] Flatten gal took : 211 ms
[2024-05-22 07:08:07] [INFO ] Flatten gal took : 213 ms
[2024-05-22 07:08:08] [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 284 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 285 ms. Remains : 71/94 places, 1374/1497 transitions.
[2024-05-22 07:08:08] [INFO ] Flatten gal took : 192 ms
[2024-05-22 07:08:08] [INFO ] Flatten gal took : 216 ms
[2024-05-22 07:08:09] [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 1 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 1 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 199 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 201 ms. Remains : 73/94 places, 1386/1497 transitions.
[2024-05-22 07:08:09] [INFO ] Flatten gal took : 192 ms
[2024-05-22 07:08:09] [INFO ] Flatten gal took : 201 ms
[2024-05-22 07:08:10] [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-05-22 07:08:10] [INFO ] Flatten gal took : 142 ms
[2024-05-22 07:08:10] [INFO ] Flatten gal took : 172 ms
[2024-05-22 07:08:10] [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 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 249 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 249 ms. Remains : 71/94 places, 1374/1497 transitions.
[2024-05-22 07:08:11] [INFO ] Flatten gal took : 203 ms
[2024-05-22 07:08:11] [INFO ] Flatten gal took : 185 ms
[2024-05-22 07:08:11] [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 10 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 10 ms. Remains : 85/94 places, 1398/1497 transitions.
[2024-05-22 07:08:11] [INFO ] Flatten gal took : 132 ms
[2024-05-22 07:08:12] [INFO ] Flatten gal took : 140 ms
[2024-05-22 07:08:12] [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 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-05-22 07:08:12] [INFO ] Flatten gal took : 138 ms
[2024-05-22 07:08:12] [INFO ] Flatten gal took : 142 ms
[2024-05-22 07:08:12] [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 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-05-22 07:08:13] [INFO ] Flatten gal took : 132 ms
[2024-05-22 07:08:13] [INFO ] Flatten gal took : 141 ms
[2024-05-22 07:08:13] [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 10 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 10 ms. Remains : 86/94 places, 1409/1497 transitions.
[2024-05-22 07:08:13] [INFO ] Flatten gal took : 195 ms
[2024-05-22 07:08:13] [INFO ] Flatten gal took : 142 ms
[2024-05-22 07:08:14] [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 9 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 10 ms. Remains : 84/94 places, 1387/1497 transitions.
[2024-05-22 07:08:14] [INFO ] Flatten gal took : 131 ms
[2024-05-22 07:08:14] [INFO ] Flatten gal took : 142 ms
[2024-05-22 07:08: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 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 16 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 16 ms. Remains : 85/94 places, 1398/1497 transitions.
[2024-05-22 07:08:15] [INFO ] Flatten gal took : 155 ms
[2024-05-22 07:08:15] [INFO ] Flatten gal took : 141 ms
[2024-05-22 07:08:15] [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 10 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 10 ms. Remains : 87/94 places, 1420/1497 transitions.
[2024-05-22 07:08:15] [INFO ] Flatten gal took : 135 ms
[2024-05-22 07:08:15] [INFO ] Flatten gal took : 211 ms
[2024-05-22 07:08:16] [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 10 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 10 ms. Remains : 85/94 places, 1398/1497 transitions.
[2024-05-22 07:08:16] [INFO ] Flatten gal took : 133 ms
[2024-05-22 07:08:16] [INFO ] Flatten gal took : 142 ms
[2024-05-22 07:08:16] [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 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-05-22 07:08:16] [INFO ] Flatten gal took : 130 ms
[2024-05-22 07:08:16] [INFO ] Flatten gal took : 142 ms
[2024-05-22 07:08:17] [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 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 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 160 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 160 ms. Remains : 74/94 places, 1397/1497 transitions.
[2024-05-22 07:08:17] [INFO ] Flatten gal took : 186 ms
[2024-05-22 07:08:17] [INFO ] Flatten gal took : 187 ms
[2024-05-22 07:08:18] [INFO ] Input system was already deterministic with 1397 transitions.
[2024-05-22 07:08:18] [INFO ] Flatten gal took : 145 ms
[2024-05-22 07:08:18] [INFO ] Flatten gal took : 150 ms
[2024-05-22 07:08:18] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 19 ms.
[2024-05-22 07:08:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 94 places, 1497 transitions and 25897 arcs took 40 ms.
Total runtime 198982 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-10a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 94
TRANSITIONS: 1497
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.156s, Sys 0.008s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.012s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 642
MODEL NAME: /home/mcc/execution/414/model
94 places, 1497 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-10a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716361728518

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-10a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is AutonomousCar-PT-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 r025-smll-171620166500362"
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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;