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-171620166300314.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-07a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166300314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K 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.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 12 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 18:11 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 276K 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-07a-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716349509297

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-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 03:45:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 03:45:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:45:12] [INFO ] Load time of PNML (sax parser for PT used): 275 ms
[2024-05-22 03:45:12] [INFO ] Transformed 73 places.
[2024-05-22 03:45:12] [INFO ] Transformed 593 transitions.
[2024-05-22 03:45:12] [INFO ] Found NUPN structural information;
[2024-05-22 03:45:12] [INFO ] Parsed PT model containing 73 places and 593 transitions and 5357 arcs in 656 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
Support contains 58 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 72 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 379
Applied a total of 2 rules in 61 ms. Remains 72 /73 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 72 cols
[2024-05-22 03:45:12] [INFO ] Computed 11 invariants in 53 ms
[2024-05-22 03:45:13] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-22 03:45:13] [INFO ] Invariant cache hit.
[2024-05-22 03:45:13] [INFO ] State equation strengthened by 199 read => feed constraints.
[2024-05-22 03:45:13] [INFO ] Implicit Places using invariants and state equation in 511 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1014 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/73 places, 379/380 transitions.
Applied a total of 0 rules in 7 ms. Remains 71 /71 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1125 ms. Remains : 71/73 places, 379/380 transitions.
Support contains 58 out of 71 places after structural reductions.
[2024-05-22 03:45:14] [INFO ] Flatten gal took : 223 ms
[2024-05-22 03:45:14] [INFO ] Flatten gal took : 131 ms
[2024-05-22 03:45:14] [INFO ] Input system was already deterministic with 379 transitions.
RANDOM walk for 40000 steps (2176 resets) in 4431 ms. (9 steps per ms) remains 25/81 properties
BEST_FIRST walk for 4004 steps (18 resets) in 65 ms. (60 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (17 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (14 resets) in 56 ms. (70 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (21 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (14 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (16 resets) in 48 ms. (81 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (17 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (16 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (16 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (16 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (17 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (17 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (18 resets) in 72 ms. (54 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (18 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (20 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (14 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (17 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 41 ms. (95 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (14 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
// Phase 1: matrix 379 rows 71 cols
[2024-05-22 03:45:16] [INFO ] Computed 10 invariants in 6 ms
[2024-05-22 03:45:16] [INFO ] State equation strengthened by 199 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/70 variables, 10/10 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 378/448 variables, 70/80 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 198/278 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/278 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/449 variables, 1/279 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 0/279 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/450 variables, 1/280 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/280 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/450 variables, 0/280 constraints. Problems are: Problem set: 5 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 280 constraints, problems are : Problem set: 5 solved, 17 unsolved in 2580 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 71/71 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 52/70 variables, 10/10 constraints. Problems are: Problem set: 5 solved, 17 unsolved
[2024-05-22 03:45:19] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 378/448 variables, 70/81 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 198/279 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 17/296 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/296 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/449 variables, 1/297 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/297 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/450 variables, 1/298 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/298 constraints. Problems are: Problem set: 5 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 298 constraints, problems are : Problem set: 5 solved, 17 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 71/71 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 17/22 constraints, Known Traps: 1/1 constraints]
After SMT, in 8162ms problems are : Problem set: 5 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 379/379 transitions.
Graph (complete) has 676 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 70 transition count 373
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 67 transition count 373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 67 transition count 372
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 66 transition count 372
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 14 place count 63 transition count 348
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 63 transition count 348
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 60 transition count 345
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 60 transition count 340
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 40 place count 55 transition count 333
Applied a total of 40 rules in 302 ms. Remains 55 /71 variables (removed 16) and now considering 333/379 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 55/71 places, 333/379 transitions.
RANDOM walk for 40000 steps (2411 resets) in 1196 ms. (33 steps per ms) remains 11/17 properties
BEST_FIRST walk for 40004 steps (219 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (166 resets) in 84 ms. (470 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (187 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (203 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (185 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (197 resets) in 74 ms. (533 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (168 resets) in 59 ms. (666 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (221 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (189 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
// Phase 1: matrix 333 rows 55 cols
[2024-05-22 03:45:25] [INFO ] Computed 11 invariants in 3 ms
[2024-05-22 03:45:25] [INFO ] State equation strengthened by 171 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 39/52 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 332/386 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 170/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/388 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/388 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 237 constraints, problems are : Problem set: 0 solved, 8 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 39/52 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 332/386 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 170/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/388 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/388 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 245 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1830 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 2705ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 968 ms.
Support contains 12 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 333/333 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 53 transition count 317
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 53 transition count 317
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 53 transition count 314
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 17 place count 50 transition count 307
Applied a total of 17 rules in 60 ms. Remains 50 /55 variables (removed 5) and now considering 307/333 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 50/55 places, 307/333 transitions.
RANDOM walk for 40000 steps (2020 resets) in 428 ms. (93 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (200 resets) in 57 ms. (689 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (205 resets) in 54 ms. (727 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (212 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (182 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
// Phase 1: matrix 307 rows 50 cols
[2024-05-22 03:45:29] [INFO ] Computed 11 invariants in 3 ms
[2024-05-22 03:45:29] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/49 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 306/355 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 149/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/357 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/357 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/49 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 306/355 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 149/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/357 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/357 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 357/357 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 691 ms.
Support contains 7 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 307/307 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 299
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 49 transition count 296
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 29 place count 46 transition count 275
Applied a total of 29 rules in 57 ms. Remains 46 /50 variables (removed 4) and now considering 275/307 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 46/50 places, 275/307 transitions.
RANDOM walk for 40000 steps (798 resets) in 503 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (126 resets) in 108 ms. (367 steps per ms) remains 1/2 properties
BEST_FIRST walk for 27228 steps (78 resets) in 72 ms. (372 steps per ms) remains 0/1 properties
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-07a-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 03:45:32] [INFO ] Flatten gal took : 93 ms
[2024-05-22 03:45:32] [INFO ] Flatten gal took : 85 ms
[2024-05-22 03:45:32] [INFO ] Input system was already deterministic with 379 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 68 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 68 transition count 355
Applied a total of 6 rules in 8 ms. Remains 68 /71 variables (removed 3) and now considering 355/379 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 68/71 places, 355/379 transitions.
[2024-05-22 03:45:32] [INFO ] Flatten gal took : 52 ms
[2024-05-22 03:45:32] [INFO ] Flatten gal took : 55 ms
[2024-05-22 03:45:32] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 331
Applied a total of 12 rules in 11 ms. Remains 65 /71 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 65/71 places, 331/379 transitions.
[2024-05-22 03:45:32] [INFO ] Flatten gal took : 43 ms
[2024-05-22 03:45:32] [INFO ] Flatten gal took : 44 ms
[2024-05-22 03:45:32] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 339
Applied a total of 10 rules in 6 ms. Remains 66 /71 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 66/71 places, 339/379 transitions.
[2024-05-22 03:45:32] [INFO ] Flatten gal took : 42 ms
[2024-05-22 03:45:33] [INFO ] Flatten gal took : 45 ms
[2024-05-22 03:45:33] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 71 transition count 371
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 63 transition count 371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 63 transition count 370
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 18 place count 62 transition count 370
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 56 transition count 322
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 56 transition count 322
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 2 with 4 rules applied. Total rules applied 34 place count 54 transition count 320
Applied a total of 34 rules in 108 ms. Remains 54 /71 variables (removed 17) and now considering 320/379 (removed 59) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 108 ms. Remains : 54/71 places, 320/379 transitions.
[2024-05-22 03:45:33] [INFO ] Flatten gal took : 31 ms
[2024-05-22 03:45:33] [INFO ] Flatten gal took : 31 ms
[2024-05-22 03:45:33] [INFO ] Input system was already deterministic with 320 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 339
Applied a total of 10 rules in 4 ms. Remains 66 /71 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 66/71 places, 339/379 transitions.
[2024-05-22 03:45:33] [INFO ] Flatten gal took : 32 ms
[2024-05-22 03:45:33] [INFO ] Flatten gal took : 34 ms
[2024-05-22 03:45:33] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 323
Applied a total of 14 rules in 4 ms. Remains 64 /71 variables (removed 7) and now considering 323/379 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/71 places, 323/379 transitions.
[2024-05-22 03:45:33] [INFO ] Flatten gal took : 30 ms
[2024-05-22 03:45:33] [INFO ] Flatten gal took : 29 ms
[2024-05-22 03:45:33] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 339
Applied a total of 10 rules in 4 ms. Remains 66 /71 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 66/71 places, 339/379 transitions.
[2024-05-22 03:45:33] [INFO ] Flatten gal took : 24 ms
[2024-05-22 03:45:33] [INFO ] Flatten gal took : 25 ms
[2024-05-22 03:45:33] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 323
Applied a total of 14 rules in 4 ms. Remains 64 /71 variables (removed 7) and now considering 323/379 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/71 places, 323/379 transitions.
[2024-05-22 03:45:33] [INFO ] Flatten gal took : 22 ms
[2024-05-22 03:45:33] [INFO ] Flatten gal took : 23 ms
[2024-05-22 03:45:33] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 339
Applied a total of 10 rules in 3 ms. Remains 66 /71 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 66/71 places, 339/379 transitions.
[2024-05-22 03:45:33] [INFO ] Flatten gal took : 23 ms
[2024-05-22 03:45:33] [INFO ] Flatten gal took : 25 ms
[2024-05-22 03:45:34] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 379/379 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 5 rules applied. Total rules applied 5 place count 71 transition count 374
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 66 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 65 transition count 373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 65 transition count 372
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 64 transition count 372
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 21 place count 57 transition count 316
Iterating global reduction 3 with 7 rules applied. Total rules applied 28 place count 57 transition count 316
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 56 transition count 315
Applied a total of 30 rules in 47 ms. Remains 56 /71 variables (removed 15) and now considering 315/379 (removed 64) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 56/71 places, 315/379 transitions.
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 25 ms
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 27 ms
[2024-05-22 03:45:34] [INFO ] Input system was already deterministic with 315 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 377
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 69 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 68 transition count 376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 68 transition count 375
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 67 transition count 375
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 14 place count 61 transition count 327
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 61 transition count 327
Applied a total of 20 rules in 36 ms. Remains 61 /71 variables (removed 10) and now considering 327/379 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 61/71 places, 327/379 transitions.
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 22 ms
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 24 ms
[2024-05-22 03:45:34] [INFO ] Input system was already deterministic with 327 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 339
Applied a total of 10 rules in 3 ms. Remains 66 /71 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 66/71 places, 339/379 transitions.
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 22 ms
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 24 ms
[2024-05-22 03:45:34] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 331
Applied a total of 12 rules in 4 ms. Remains 65 /71 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 65/71 places, 331/379 transitions.
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 22 ms
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 24 ms
[2024-05-22 03:45:34] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 339
Applied a total of 10 rules in 3 ms. Remains 66 /71 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 66/71 places, 339/379 transitions.
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 22 ms
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 24 ms
[2024-05-22 03:45:34] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 68 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 68 transition count 355
Applied a total of 6 rules in 4 ms. Remains 68 /71 variables (removed 3) and now considering 355/379 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 68/71 places, 355/379 transitions.
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 21 ms
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 22 ms
[2024-05-22 03:45:34] [INFO ] Input system was already deterministic with 355 transitions.
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 26 ms
[2024-05-22 03:45:34] [INFO ] Flatten gal took : 26 ms
[2024-05-22 03:45:34] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 11 ms.
[2024-05-22 03:45:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 71 places, 379 transitions and 3750 arcs took 13 ms.
Total runtime 23094 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-07a

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: 71
TRANSITIONS: 379
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.020s, Sys 0.004s]


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


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

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

Process ID: 577
MODEL NAME: /home/mcc/execution/414/model
71 places, 379 transitions.

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

BK_STOP 1716349539270

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

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-07a.tgz
mv AutonomousCar-PT-07a 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 ;