About the Execution of GreatSPN+red for AutonomousCar-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3367.224 | 218486.00 | 283080.00 | 761.10 | TTFTTTFFFTFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r025-smll-171620166500367.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166500367
=====================================================================
--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716362728946
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
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:25:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:25:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:25:32] [INFO ] Load time of PNML (sax parser for PT used): 706 ms
[2024-05-22 07:25:32] [INFO ] Transformed 97 places.
[2024-05-22 07:25:32] [INFO ] Transformed 1921 transitions.
[2024-05-22 07:25:32] [INFO ] Found NUPN structural information;
[2024-05-22 07:25:32] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 1004 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
RANDOM walk for 40000 steps (1829 resets) in 6588 ms. (6 steps per ms) remains 14/16 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (109 resets) in 1654 ms. (24 steps per ms) remains 13/14 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (125 resets) in 345 ms. (115 steps per ms) remains 12/13 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (62 resets) in 1684 ms. (23 steps per ms) remains 11/12 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (97 resets) in 225 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (90 resets) in 340 ms. (117 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (99 resets) in 420 ms. (95 steps per ms) remains 10/11 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (43 resets) in 862 ms. (46 steps per ms) remains 9/10 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (133 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (64 resets) in 565 ms. (70 steps per ms) remains 8/9 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (107 resets) in 151 ms. (263 steps per ms) remains 7/8 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (110 resets) in 404 ms. (98 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (100 resets) in 285 ms. (139 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (99 resets) in 480 ms. (83 steps per ms) remains 7/7 properties
[2024-05-22 07:25:36] [INFO ] Flow matrix only has 1497 transitions (discarded 1 similar events)
// Phase 1: matrix 1497 rows 97 cols
[2024-05-22 07:25:36] [INFO ] Computed 15 invariants in 47 ms
[2024-05-22 07:25:37] [INFO ] State equation strengthened by 403 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AutonomousCar-PT-10a-ReachabilityFireability-2024-08 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-10a-ReachabilityFireability-2024-13 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 31/91 variables, 13/73 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 31/104 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/97 variables, 2/106 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 6/112 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1496/1593 variables, 97/209 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1593 variables, 402/611 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1593 variables, 0/611 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/1594 variables, 1/612 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1594/1594 variables, and 612 constraints, problems are : Problem set: 2 solved, 5 unsolved in 2564 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AutonomousCar-PT-10a-ReachabilityFireability-2024-04 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-10a-ReachabilityFireability-2024-05 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-10a-ReachabilityFireability-2024-12 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 32/91 variables, 13/72 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 32/104 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/104 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/97 variables, 2/106 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 6/112 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/112 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1496/1593 variables, 97/209 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1593 variables, 402/611 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1593 variables, 0/611 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/1594 variables, 1/612 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1594/1594 variables, and 612 constraints, problems are : Problem set: 5 solved, 2 unsolved in 1819 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5705ms problems are : Problem set: 5 solved, 2 unsolved
Parikh walk visited 0 properties in 2815 ms.
Support contains 40 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Graph (complete) has 1257 edges and 97 vertex of which 95 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.34 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 95 transition count 1488
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 89 transition count 1486
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 87 transition count 1486
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 87 transition count 1484
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 85 transition count 1484
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 29 place count 79 transition count 1418
Iterating global reduction 3 with 6 rules applied. Total rules applied 35 place count 79 transition count 1418
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 78 transition count 1417
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 45 place count 78 transition count 1409
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 68 rules applied. Total rules applied 113 place count 70 transition count 1349
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 70 transition count 1349
Applied a total of 114 rules in 661 ms. Remains 70 /97 variables (removed 27) and now considering 1349/1498 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 676 ms. Remains : 70/97 places, 1349/1498 transitions.
RANDOM walk for 40000 steps (115 resets) in 1371 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (96 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (102 resets) in 624 ms. (64 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 302473 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 2
Probabilistic random walk after 302473 steps, saw 49937 distinct states, run finished after 3008 ms. (steps per millisecond=100 ) properties seen :0
// Phase 1: matrix 1349 rows 70 cols
[2024-05-22 07:25:49] [INFO ] Computed 15 invariants in 30 ms
[2024-05-22 07:25:49] [INFO ] State equation strengthened by 283 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/70 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1349/1419 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 283/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1419 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1419 variables, and 368 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 70/70 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/70 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1349/1419 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 283/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1419 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1419/1419 variables, and 368 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 70/70 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2577ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2723 ms.
Support contains 40 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1349/1349 transitions.
Applied a total of 0 rules in 93 ms. Remains 70 /70 variables (removed 0) and now considering 1349/1349 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 70/70 places, 1349/1349 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1349/1349 transitions.
Applied a total of 0 rules in 100 ms. Remains 70 /70 variables (removed 0) and now considering 1349/1349 (removed 0) transitions.
[2024-05-22 07:25:55] [INFO ] Invariant cache hit.
[2024-05-22 07:25:55] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-22 07:25:55] [INFO ] Invariant cache hit.
[2024-05-22 07:25:56] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-22 07:25:56] [INFO ] Implicit Places using invariants and state equation in 790 ms returned [66, 68]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 893 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 68/70 places, 1349/1349 transitions.
Applied a total of 0 rules in 154 ms. Remains 68 /68 variables (removed 0) and now considering 1349/1349 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1149 ms. Remains : 68/70 places, 1349/1349 transitions.
RANDOM walk for 40000 steps (213 resets) in 3178 ms. (12 steps per ms) remains 1/2 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (99 resets) in 467 ms. (85 steps per ms) remains 1/1 properties
// Phase 1: matrix 1349 rows 68 cols
[2024-05-22 07:25:57] [INFO ] Computed 13 invariants in 13 ms
[2024-05-22 07:25:57] [INFO ] State equation strengthened by 283 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1347/1412 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1412 variables, 282/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1412 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/1417 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1417 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1417 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1417 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1417/1417 variables, and 364 constraints, problems are : Problem set: 0 solved, 1 unsolved in 869 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 68/68 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1347/1412 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1412 variables, 282/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1412 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/1417 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1417 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1417 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1417 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1417/1417 variables, and 364 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 68/68 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2015ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 699 ms.
Support contains 39 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1349/1349 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 67 transition count 1338
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 1338
Applied a total of 2 rules in 113 ms. Remains 67 /68 variables (removed 1) and now considering 1338/1349 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 67/68 places, 1338/1349 transitions.
RANDOM walk for 40000 steps (40 resets) in 1897 ms. (21 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (97 resets) in 566 ms. (70 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 397480 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 1
Probabilistic random walk after 397480 steps, saw 64445 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
// Phase 1: matrix 1338 rows 67 cols
[2024-05-22 07:26:03] [INFO ] Computed 13 invariants in 16 ms
[2024-05-22 07:26:03] [INFO ] State equation strengthened by 273 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1336/1400 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1400 variables, 272/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1400 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/1405 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1405 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1405 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1405 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1405/1405 variables, and 353 constraints, problems are : Problem set: 0 solved, 1 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 67/67 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1336/1400 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1400 variables, 272/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1400 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/1405 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1405 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1405 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1405 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1405/1405 variables, and 353 constraints, problems are : Problem set: 0 solved, 1 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 67/67 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1515ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 444 ms.
Support contains 39 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1338/1338 transitions.
Applied a total of 0 rules in 86 ms. Remains 67 /67 variables (removed 0) and now considering 1338/1338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 67/67 places, 1338/1338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1338/1338 transitions.
Applied a total of 0 rules in 85 ms. Remains 67 /67 variables (removed 0) and now considering 1338/1338 (removed 0) transitions.
[2024-05-22 07:26:06] [INFO ] Invariant cache hit.
[2024-05-22 07:26:06] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 07:26:06] [INFO ] Invariant cache hit.
[2024-05-22 07:26:06] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-22 07:26:06] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2024-05-22 07:26:06] [INFO ] Redundant transitions in 123 ms returned []
Running 1337 sub problems to find dead transitions.
[2024-05-22 07:26:06] [INFO ] Invariant cache hit.
[2024-05-22 07:26:06] [INFO ] State equation strengthened by 273 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1337 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1337 unsolved
[2024-05-22 07:26:56] [INFO ] Deduced a trap composed of 5 places in 1608 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 67/1405 variables, and 14 constraints, problems are : Problem set: 0 solved, 1337 unsolved in 30143 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/67 constraints, ReadFeed: 0/273 constraints, PredecessorRefiner: 1337/41 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1337 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1337 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1337 unsolved
Problem TDEAD1337 is UNSAT
At refinement iteration 4 (OVERLAPS) 1338/1405 variables, 67/81 constraints. Problems are: Problem set: 1 solved, 1336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1405 variables, 273/354 constraints. Problems are: Problem set: 1 solved, 1336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1405/1405 variables, and 394 constraints, problems are : Problem set: 1 solved, 1336 unsolved in 30142 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 67/67 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 1336/41 constraints, Known Traps: 1/1 constraints]
After SMT, in 82954ms problems are : Problem set: 1 solved, 1336 unsolved
Search for dead transitions found 1 dead transitions in 82980ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 67/67 places, 1337/1338 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 67 transition count 1336
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 2 place count 66 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 1335
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 1335
Applied a total of 4 rules in 193 ms. Remains 65 /67 variables (removed 2) and now considering 1335/1337 (removed 2) transitions.
// Phase 1: matrix 1335 rows 65 cols
[2024-05-22 07:27:29] [INFO ] Computed 14 invariants in 18 ms
[2024-05-22 07:27:30] [INFO ] Implicit Places using invariants in 103 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 64/67 places, 1335/1338 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 1334
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 1334
Applied a total of 2 rules in 164 ms. Remains 63 /64 variables (removed 1) and now considering 1334/1335 (removed 1) transitions.
// Phase 1: matrix 1334 rows 63 cols
[2024-05-22 07:27:30] [INFO ] Computed 13 invariants in 16 ms
[2024-05-22 07:27:30] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 07:27:30] [INFO ] Invariant cache hit.
[2024-05-22 07:27:31] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-22 07:27:31] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 63/67 places, 1334/1338 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 85175 ms. Remains : 63/67 places, 1334/1338 transitions.
RANDOM walk for 40000 steps (100 resets) in 1631 ms. (24 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (95 resets) in 675 ms. (59 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 420246 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 1
Probabilistic random walk after 420246 steps, saw 65734 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2024-05-22 07:27:34] [INFO ] Invariant cache hit.
[2024-05-22 07:27:34] [INFO ] State equation strengthened by 271 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/63 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1334/1397 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1397 variables, 271/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1397 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/1397 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1397/1397 variables, and 347 constraints, problems are : Problem set: 0 solved, 1 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 63/63 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/63 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1334/1397 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1397 variables, 271/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1397 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/1397 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1397/1397 variables, and 347 constraints, problems are : Problem set: 0 solved, 1 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 63/63 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1769ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 637 ms.
Support contains 39 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1334/1334 transitions.
Applied a total of 0 rules in 85 ms. Remains 63 /63 variables (removed 0) and now considering 1334/1334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 63/63 places, 1334/1334 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1334/1334 transitions.
Applied a total of 0 rules in 85 ms. Remains 63 /63 variables (removed 0) and now considering 1334/1334 (removed 0) transitions.
[2024-05-22 07:27:37] [INFO ] Invariant cache hit.
[2024-05-22 07:27:37] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 07:27:37] [INFO ] Invariant cache hit.
[2024-05-22 07:27:38] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-22 07:27:38] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2024-05-22 07:27:38] [INFO ] Redundant transitions in 159 ms returned []
Running 1333 sub problems to find dead transitions.
[2024-05-22 07:27:38] [INFO ] Invariant cache hit.
[2024-05-22 07:27:38] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1333 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1333 unsolved
[2024-05-22 07:28:27] [INFO ] Deduced a trap composed of 23 places in 1732 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 63/1397 variables, and 14 constraints, problems are : Problem set: 0 solved, 1333 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/63 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1333/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1333 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1333 unsolved
At refinement iteration 4 (OVERLAPS) 1334/1397 variables, 63/77 constraints. Problems are: Problem set: 0 solved, 1333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1397 variables, 271/348 constraints. Problems are: Problem set: 0 solved, 1333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1397/1397 variables, and 386 constraints, problems are : Problem set: 0 solved, 1333 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 63/63 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1333/38 constraints, Known Traps: 1/1 constraints]
After SMT, in 83185ms problems are : Problem set: 0 solved, 1333 unsolved
Search for dead transitions found 0 dead transitions in 83213ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84300 ms. Remains : 63/63 places, 1334/1334 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 129 ms. Remains 63 /63 variables (removed 0) and now considering 1334/1334 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 07:29:01] [INFO ] Invariant cache hit.
[2024-05-22 07:29:01] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:29:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-22 07:29:02] [INFO ] After 720ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :1
[2024-05-22 07:29:02] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1127 ms.
[2024-05-22 07:29:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-05-22 07:29:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 1334 transitions and 24784 arcs took 48 ms.
[2024-05-22 07:29:03] [INFO ] Flatten gal took : 694 ms
Total runtime 212556 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: 63
TRANSITIONS: 1334
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.255s, Sys 0.013s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.022s, 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: 657
MODEL NAME: /home/mcc/execution/414/model
63 places, 1334 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.
Building monolithic NSF...
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716362947432
--------------------
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 ReachabilityFireability -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="ReachabilityFireability"
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 ReachabilityFireability"
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-171620166500367"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;