Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 18:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 18:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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-10b-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717229715279

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:15:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:15:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:15:18] [INFO ] Load time of PNML (sax parser for PT used): 636 ms
[2024-06-01 08:15:18] [INFO ] Transformed 425 places.
[2024-06-01 08:15:18] [INFO ] Transformed 2252 transitions.
[2024-06-01 08:15:18] [INFO ] Found NUPN structural information;
[2024-06-01 08:15:18] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 954 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (305 resets) in 4248 ms. (9 steps per ms) remains 13/16 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (53 resets) in 676 ms. (59 steps per ms) remains 12/13 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (42 resets) in 253 ms. (157 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (41 resets) in 242 ms. (164 steps per ms) remains 11/12 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (49 resets) in 339 ms. (117 steps per ms) remains 10/11 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (52 resets) in 342 ms. (116 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (55 resets) in 234 ms. (170 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (57 resets) in 392 ms. (101 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (53 resets) in 245 ms. (162 steps per ms) remains 9/10 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (56 resets) in 1346 ms. (29 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (58 resets) in 307 ms. (129 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (54 resets) in 734 ms. (54 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (36 resets) in 314 ms. (126 steps per ms) remains 8/9 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (53 resets) in 147 ms. (270 steps per ms) remains 7/8 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2252 rows 425 cols
[2024-06-01 08:15:21] [INFO ] Computed 15 invariants in 57 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AutonomousCar-PT-10b-ReachabilityFireability-2024-08 is UNSAT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-10b-ReachabilityFireability-2024-11 is UNSAT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 355/414 variables, 14/73 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 355/428 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/428 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 11/425 variables, 1/429 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 11/440 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/440 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2252/2677 variables, 425/865 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2677 variables, 0/865 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/2677 variables, 0/865 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2677/2677 variables, and 865 constraints, problems are : Problem set: 2 solved, 5 unsolved in 2464 ms.
Refiners :[Domain max(s): 425/425 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 425/425 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/40 variables, 40/40 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AutonomousCar-PT-10b-ReachabilityFireability-2024-06 is UNSAT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-10b-ReachabilityFireability-2024-09 is UNSAT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 374/414 variables, 14/54 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 374/428 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/428 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/425 variables, 1/429 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 11/440 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/440 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2252/2677 variables, 425/865 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2677 variables, 0/865 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2677 variables, 0/865 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2677/2677 variables, and 865 constraints, problems are : Problem set: 4 solved, 3 unsolved in 2159 ms.
Refiners :[Domain max(s): 425/425 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5559ms problems are : Problem set: 4 solved, 3 unsolved
Parikh walk visited 0 properties in 1494 ms.
Support contains 19 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Graph (trivial) has 352 edges and 425 vertex of which 4 / 425 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1994 edges and 423 vertex of which 416 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.52 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 175 rules applied. Total rules applied 177 place count 416 transition count 2068
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 229 rules applied. Total rules applied 406 place count 243 transition count 2012
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 438 place count 211 transition count 2012
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 438 place count 211 transition count 1992
Deduced a syphon composed of 20 places in 9 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 478 place count 191 transition count 1992
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 516 place count 153 transition count 1954
Iterating global reduction 3 with 38 rules applied. Total rules applied 554 place count 153 transition count 1954
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 401 transitions.
Iterating post reduction 3 with 401 rules applied. Total rules applied 955 place count 153 transition count 1553
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 965 place count 143 transition count 1462
Iterating global reduction 4 with 10 rules applied. Total rules applied 975 place count 143 transition count 1462
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 18 rules applied. Total rules applied 993 place count 143 transition count 1444
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1002 place count 134 transition count 1444
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 1072 place count 99 transition count 1409
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1074 place count 97 transition count 1387
Iterating global reduction 6 with 2 rules applied. Total rules applied 1076 place count 97 transition count 1387
Free-agglomeration rule applied 19 times.
Iterating global reduction 6 with 19 rules applied. Total rules applied 1095 place count 97 transition count 1368
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1114 place count 78 transition count 1368
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 1123 place count 78 transition count 1368
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1124 place count 77 transition count 1367
Applied a total of 1124 rules in 1127 ms. Remains 77 /425 variables (removed 348) and now considering 1367/2252 (removed 885) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1146 ms. Remains : 77/425 places, 1367/2252 transitions.
RANDOM walk for 40000 steps (173 resets) in 1438 ms. (27 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 182 ms. (218 steps per ms) remains 2/3 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (147 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (144 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
// Phase 1: matrix 1367 rows 77 cols
[2024-06-01 08:15:30] [INFO ] Computed 15 invariants in 24 ms
[2024-06-01 08:15:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/59 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1363/1422 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1422 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/1444 variables, 18/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1444 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1444 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1444 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1444/1444 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1063 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/59 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1363/1422 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1422 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/1444 variables, 18/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1444 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1444 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1444 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1444/1444 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2250ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 233 ms.
Support contains 15 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 1367/1367 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 77 transition count 1366
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 75 transition count 1366
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 75 transition count 1365
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 15 place count 74 transition count 1355
Applied a total of 15 rules in 289 ms. Remains 74 /77 variables (removed 3) and now considering 1355/1367 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 74/77 places, 1355/1367 transitions.
RANDOM walk for 40000 steps (88 resets) in 1801 ms. (22 steps per ms) remains 1/2 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (156 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
// Phase 1: matrix 1355 rows 74 cols
[2024-06-01 08:15:34] [INFO ] Computed 14 invariants in 11 ms
[2024-06-01 08:15:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/58 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1352/1410 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1410 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/1429 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1429 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1429 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1429 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1429 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1429/1429 variables, and 89 constraints, problems are : Problem set: 0 solved, 1 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/58 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1352/1410 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1410 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/1429 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1429 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1429 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1429 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1429 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1429/1429 variables, and 89 constraints, problems are : Problem set: 0 solved, 1 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1441ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 11 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 1355/1355 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 1354
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 70 transition count 1351
Applied a total of 8 rules in 178 ms. Remains 70 /74 variables (removed 4) and now considering 1351/1355 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 70/74 places, 1351/1355 transitions.
RANDOM walk for 40000 steps (95 resets) in 1526 ms. (26 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (168 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 571343 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 1
Probabilistic random walk after 571343 steps, saw 77326 distinct states, run finished after 3006 ms. (steps per millisecond=190 ) properties seen :0
// Phase 1: matrix 1351 rows 70 cols
[2024-06-01 08:15:39] [INFO ] Computed 14 invariants in 8 ms
[2024-06-01 08:15:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/54 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1348/1402 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1402 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/1421 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1421 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1421 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1421 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1421 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1421/1421 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/54 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1348/1402 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1402 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/1421 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1421 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1421 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1421 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1421 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1421/1421 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1227ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 11 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1351/1351 transitions.
Applied a total of 0 rules in 123 ms. Remains 70 /70 variables (removed 0) and now considering 1351/1351 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 70/70 places, 1351/1351 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1351/1351 transitions.
Applied a total of 0 rules in 123 ms. Remains 70 /70 variables (removed 0) and now considering 1351/1351 (removed 0) transitions.
[2024-06-01 08:15:40] [INFO ] Invariant cache hit.
[2024-06-01 08:15:41] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-06-01 08:15:41] [INFO ] Invariant cache hit.
[2024-06-01 08:15:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 08:15:42] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned [65, 69]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1787 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 68/70 places, 1350/1351 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 1349
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 67 transition count 1348
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 66 transition count 1348
Applied a total of 4 rules in 298 ms. Remains 66 /68 variables (removed 2) and now considering 1348/1350 (removed 2) transitions.
// Phase 1: matrix 1348 rows 66 cols
[2024-06-01 08:15:42] [INFO ] Computed 12 invariants in 13 ms
[2024-06-01 08:15:43] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-06-01 08:15:43] [INFO ] Invariant cache hit.
[2024-06-01 08:15:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 08:15:44] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 66/70 places, 1348/1351 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3684 ms. Remains : 66/70 places, 1348/1351 transitions.
RANDOM walk for 40000 steps (8 resets) in 2459 ms. (16 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (168 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 537726 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 537726 steps, saw 76665 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
[2024-06-01 08:15:47] [INFO ] Invariant cache hit.
[2024-06-01 08:15:47] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1348/1401 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1401 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1401 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/1414 variables, 13/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1414 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1414 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1414/1414 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, ReadFeed: 2/2 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1348/1401 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1401 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1401 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/1414 variables, 13/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1414 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1414 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1414/1414 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1712ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 11 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 1348/1348 transitions.
Applied a total of 0 rules in 125 ms. Remains 66 /66 variables (removed 0) and now considering 1348/1348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 66/66 places, 1348/1348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 1348/1348 transitions.
Applied a total of 0 rules in 123 ms. Remains 66 /66 variables (removed 0) and now considering 1348/1348 (removed 0) transitions.
[2024-06-01 08:15:49] [INFO ] Invariant cache hit.
[2024-06-01 08:15:50] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-06-01 08:15:50] [INFO ] Invariant cache hit.
[2024-06-01 08:15:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 08:15:51] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1689 ms to find 0 implicit places.
[2024-06-01 08:15:51] [INFO ] Redundant transitions in 216 ms returned []
Running 1344 sub problems to find dead transitions.
[2024-06-01 08:15:51] [INFO ] Invariant cache hit.
[2024-06-01 08:15:51] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
[2024-06-01 08:16:40] [INFO ] Deduced a trap composed of 6 places in 1204 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 66/1414 variables, and 13 constraints, problems are : Problem set: 0 solved, 1344 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/66 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1344/37 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 66/1414 variables, and 13 constraints, problems are : Problem set: 0 solved, 1344 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/66 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1307/37 constraints, Known Traps: 1/1 constraints]
After SMT, in 86574ms problems are : Problem set: 0 solved, 1344 unsolved
Search for dead transitions found 0 dead transitions in 86617ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88690 ms. Remains : 66/66 places, 1348/1348 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 958 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 1347
Applied a total of 2 rules in 140 ms. Remains 65 /66 variables (removed 1) and now considering 1347/1348 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1347 rows 65 cols
[2024-06-01 08:17:18] [INFO ] Computed 12 invariants in 10 ms
[2024-06-01 08:17:18] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-01 08:17:19] [INFO ] After 786ms SMT Verify possible using After timeout in real domain returned unsat :0 sat :1
[2024-06-01 08:17:19] [INFO ] After 857ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1068 ms.
[2024-06-01 08:17:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-06-01 08:17:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 66 places, 1348 transitions and 24309 arcs took 47 ms.
[2024-06-01 08:17:20] [INFO ] Flatten gal took : 723 ms
Total runtime 123392 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : AutonomousCar-PT-10b-ReachabilityFireability-2024-04

BK_STOP 1717229841176

--------------------
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
mcc2024
rfs formula name AutonomousCar-PT-10b-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/589/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-10b, 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 r468-smll-171620167600375"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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