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-171620167500351.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-09a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 781K 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-09a-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717220830000

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-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:47:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:47:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:47:12] [INFO ] Load time of PNML (sax parser for PT used): 344 ms
[2024-06-01 05:47:12] [INFO ] Transformed 89 places.
[2024-06-01 05:47:12] [INFO ] Transformed 1249 transitions.
[2024-06-01 05:47:12] [INFO ] Found NUPN structural information;
[2024-06-01 05:47:12] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 616 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
RANDOM walk for 40000 steps (1917 resets) in 5125 ms. (7 steps per ms) remains 12/16 properties
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (60 resets) in 217 ms. (183 steps per ms) remains 10/12 properties
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (116 resets) in 1307 ms. (30 steps per ms) remains 9/10 properties
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (116 resets) in 318 ms. (125 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (109 resets) in 256 ms. (155 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (109 resets) in 701 ms. (56 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (166 resets) in 608 ms. (65 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (116 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (110 resets) in 486 ms. (82 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (124 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (113 resets) in 1586 ms. (25 steps per ms) remains 9/9 properties
[2024-06-01 05:47:15] [INFO ] Flow matrix only has 903 transitions (discarded 1 similar events)
// Phase 1: matrix 903 rows 89 cols
[2024-06-01 05:47:15] [INFO ] Computed 14 invariants in 30 ms
[2024-06-01 05:47:16] [INFO ] State equation strengthened by 327 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AutonomousCar-PT-09a-ReachabilityFireability-2024-15 is UNSAT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 4/75 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 18/89 variables, 10/85 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 18/103 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 902/991 variables, 89/192 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/991 variables, 326/518 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/991 variables, 0/518 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/992 variables, 1/519 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/992 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/992 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 992/992 variables, and 519 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1817 ms.
Refiners :[Domain max(s): 89/89 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 89/89 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AutonomousCar-PT-09a-ReachabilityFireability-2024-13 is UNSAT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 4/75 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AutonomousCar-PT-09a-ReachabilityFireability-2024-01 is UNSAT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-09a-ReachabilityFireability-2024-06 is UNSAT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-09a-ReachabilityFireability-2024-10 is UNSAT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 18/89 variables, 10/85 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 18/103 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/103 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 902/991 variables, 89/192 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/991 variables, 326/518 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/991 variables, 4/522 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/991 variables, 0/522 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/992 variables, 1/523 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/992 variables, 0/523 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 992/992 variables, and 523 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5021 ms.
Refiners :[Domain max(s): 89/89 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 89/89 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 4/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 8483ms problems are : Problem set: 5 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 904/904 transitions.
Graph (complete) has 1045 edges and 89 vertex of which 87 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 87 transition count 898
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 85 transition count 895
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 13 place count 82 transition count 895
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 82 transition count 893
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 80 transition count 893
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 79 transition count 883
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 79 transition count 883
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 79 transition count 879
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 45 place count 75 transition count 861
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 46 place count 75 transition count 861
Applied a total of 46 rules in 397 ms. Remains 75 /89 variables (removed 14) and now considering 861/904 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 75/89 places, 861/904 transitions.
RANDOM walk for 40000 steps (1388 resets) in 1453 ms. (27 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (119 resets) in 393 ms. (101 steps per ms) remains 3/4 properties
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (121 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (124 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
// Phase 1: matrix 861 rows 75 cols
[2024-06-01 05:47:25] [INFO ] Computed 14 invariants in 13 ms
[2024-06-01 05:47:25] [INFO ] State equation strengthened by 300 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/75 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 861/936 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/936 variables, 300/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/936 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 936/936 variables, and 389 constraints, problems are : Problem set: 0 solved, 3 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 75/75 constraints, ReadFeed: 300/300 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/75 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 861/936 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/936 variables, 300/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/936 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 936/936 variables, and 392 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3232 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 75/75 constraints, ReadFeed: 300/300 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3982ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2586 ms.
Support contains 36 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 861/861 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 859
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 73 transition count 859
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 70 transition count 829
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 70 transition count 829
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 70 transition count 825
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 54 place count 66 transition count 789
Applied a total of 54 rules in 151 ms. Remains 66 /75 variables (removed 9) and now considering 789/861 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 66/75 places, 789/861 transitions.
RANDOM walk for 40000 steps (154 resets) in 962 ms. (41 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (108 resets) in 306 ms. (130 steps per ms) remains 2/3 properties
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (113 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
// Phase 1: matrix 789 rows 66 cols
[2024-06-01 05:47:32] [INFO ] Computed 14 invariants in 12 ms
[2024-06-01 05:47:32] [INFO ] State equation strengthened by 237 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/61 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/66 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 789/855 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 237/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/855 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/855 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 317 constraints, problems are : Problem set: 0 solved, 2 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 66/66 constraints, ReadFeed: 237/237 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/61 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/66 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:47:34] [INFO ] Deduced a trap composed of 5 places in 389 ms of which 60 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 789/855 variables, 66/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/855 variables, 237/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/855 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/855 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/855 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 855/855 variables, and 320 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3098 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 66/66 constraints, ReadFeed: 237/237 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 3888ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1694 ms.
Support contains 35 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 789/789 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 779
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 779
Applied a total of 2 rules in 78 ms. Remains 65 /66 variables (removed 1) and now considering 779/789 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 65/66 places, 779/789 transitions.
RANDOM walk for 40000 steps (132 resets) in 958 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (111 resets) in 281 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (117 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 609717 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 2
Probabilistic random walk after 609717 steps, saw 84585 distinct states, run finished after 3006 ms. (steps per millisecond=202 ) properties seen :0
// Phase 1: matrix 779 rows 65 cols
[2024-06-01 05:47:41] [INFO ] Computed 14 invariants in 11 ms
[2024-06-01 05:47:41] [INFO ] State equation strengthened by 228 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/65 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 779/844 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/844 variables, 228/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/844 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 844/844 variables, and 307 constraints, problems are : Problem set: 0 solved, 2 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 65/65 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/65 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 779/844 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/844 variables, 228/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/844 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 844/844 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2461 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 65/65 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3081ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 829 ms.
Support contains 35 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 779/779 transitions.
Applied a total of 0 rules in 57 ms. Remains 65 /65 variables (removed 0) and now considering 779/779 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 65/65 places, 779/779 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 779/779 transitions.
Applied a total of 0 rules in 38 ms. Remains 65 /65 variables (removed 0) and now considering 779/779 (removed 0) transitions.
[2024-06-01 05:47:45] [INFO ] Invariant cache hit.
[2024-06-01 05:47:45] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 05:47:45] [INFO ] Invariant cache hit.
[2024-06-01 05:47:46] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-06-01 05:47:46] [INFO ] Implicit Places using invariants and state equation in 471 ms returned [61, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 591 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/65 places, 779/779 transitions.
Applied a total of 0 rules in 65 ms. Remains 63 /63 variables (removed 0) and now considering 779/779 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 697 ms. Remains : 63/65 places, 779/779 transitions.
RANDOM walk for 40000 steps (93 resets) in 2835 ms. (14 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (113 resets) in 219 ms. (181 steps per ms) remains 1/2 properties
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 779 rows 63 cols
[2024-06-01 05:47:47] [INFO ] Computed 12 invariants in 11 ms
[2024-06-01 05:47:47] [INFO ] State equation strengthened by 228 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 777/837 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/837 variables, 227/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/842 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/842 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 842/842 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 777/837 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/837 variables, 227/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/842 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/842 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/842 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1721 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2140ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 155 ms.
Support contains 33 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 779/779 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 778
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 778
Applied a total of 2 rules in 47 ms. Remains 62 /63 variables (removed 1) and now considering 778/779 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 62/63 places, 778/779 transitions.
RANDOM walk for 40000 steps (112 resets) in 742 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (114 resets) in 338 ms. (118 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 844819 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :0 out of 1
Probabilistic random walk after 844819 steps, saw 122094 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
// Phase 1: matrix 778 rows 62 cols
[2024-06-01 05:47:53] [INFO ] Computed 12 invariants in 10 ms
[2024-06-01 05:47:53] [INFO ] State equation strengthened by 228 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/59 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 776/835 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/835 variables, 227/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/835 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/840 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/840 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/840 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 62/62 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/59 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 776/835 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/835 variables, 227/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/835 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/840 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/840 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1814 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 62/62 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2355ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2754 ms.
Support contains 33 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 778/778 transitions.
Applied a total of 0 rules in 39 ms. Remains 62 /62 variables (removed 0) and now considering 778/778 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 62/62 places, 778/778 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 778/778 transitions.
Applied a total of 0 rules in 38 ms. Remains 62 /62 variables (removed 0) and now considering 778/778 (removed 0) transitions.
[2024-06-01 05:47:58] [INFO ] Invariant cache hit.
[2024-06-01 05:47:58] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 05:47:58] [INFO ] Invariant cache hit.
[2024-06-01 05:47:58] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-06-01 05:47:58] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-06-01 05:47:58] [INFO ] Redundant transitions in 68 ms returned []
Running 777 sub problems to find dead transitions.
[2024-06-01 05:47:58] [INFO ] Invariant cache hit.
[2024-06-01 05:47:58] [INFO ] State equation strengthened by 228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 777 unsolved
[2024-06-01 05:48:27] [INFO ] Deduced a trap composed of 13 places in 523 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Problem TDEAD740 is UNSAT
At refinement iteration 4 (OVERLAPS) 778/840 variables, 62/75 constraints. Problems are: Problem set: 1 solved, 776 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 228/303 constraints. Problems are: Problem set: 1 solved, 776 unsolved
[2024-06-01 05:48:40] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/840 variables, and 304 constraints, problems are : Problem set: 1 solved, 776 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 62/62 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 777/777 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 776 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 776 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 776 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 776 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 776 unsolved
At refinement iteration 4 (OVERLAPS) 778/840 variables, 62/76 constraints. Problems are: Problem set: 1 solved, 776 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 228/304 constraints. Problems are: Problem set: 1 solved, 776 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/840 variables, and 1080 constraints, problems are : Problem set: 1 solved, 776 unsolved in 32107 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 62/62 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 776/777 constraints, Known Traps: 2/2 constraints]
After SMT, in 78367ms problems are : Problem set: 1 solved, 776 unsolved
Search for dead transitions found 1 dead transitions in 78389ms
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 : 62/62 places, 777/778 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 62 transition count 776
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 61 transition count 776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 775
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 775
Applied a total of 4 rules in 51 ms. Remains 60 /62 variables (removed 2) and now considering 775/777 (removed 2) transitions.
// Phase 1: matrix 775 rows 60 cols
[2024-06-01 05:49:17] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 05:49:17] [INFO ] Implicit Places using invariants in 65 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/62 places, 775/778 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 774
Applied a total of 2 rules in 44 ms. Remains 58 /59 variables (removed 1) and now considering 774/775 (removed 1) transitions.
// Phase 1: matrix 774 rows 58 cols
[2024-06-01 05:49:17] [INFO ] Computed 12 invariants in 4 ms
[2024-06-01 05:49:17] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 05:49:17] [INFO ] Invariant cache hit.
[2024-06-01 05:49:17] [INFO ] State equation strengthened by 226 read => feed constraints.
[2024-06-01 05:49:17] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 58/62 places, 774/778 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 79647 ms. Remains : 58/62 places, 774/778 transitions.
RANDOM walk for 40000 steps (93 resets) in 853 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (112 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 954572 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :0 out of 1
Probabilistic random walk after 954572 steps, saw 135699 distinct states, run finished after 3001 ms. (steps per millisecond=318 ) properties seen :0
[2024-06-01 05:49:21] [INFO ] Invariant cache hit.
[2024-06-01 05:49:21] [INFO ] State equation strengthened by 226 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 774/832 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/832 variables, 226/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/832 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/832 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 832/832 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 774/832 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/832 variables, 226/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/832 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/832 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 832/832 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1677 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2282ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1234 ms.
Support contains 33 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 774/774 transitions.
Applied a total of 0 rules in 46 ms. Remains 58 /58 variables (removed 0) and now considering 774/774 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 58/58 places, 774/774 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 774/774 transitions.
Applied a total of 0 rules in 46 ms. Remains 58 /58 variables (removed 0) and now considering 774/774 (removed 0) transitions.
[2024-06-01 05:49:24] [INFO ] Invariant cache hit.
[2024-06-01 05:49:24] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 05:49:24] [INFO ] Invariant cache hit.
[2024-06-01 05:49:25] [INFO ] State equation strengthened by 226 read => feed constraints.
[2024-06-01 05:49:25] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2024-06-01 05:49:25] [INFO ] Redundant transitions in 22 ms returned []
Running 773 sub problems to find dead transitions.
[2024-06-01 05:49:25] [INFO ] Invariant cache hit.
[2024-06-01 05:49:25] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 3 (OVERLAPS) 774/832 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/832 variables, 226/296 constraints. Problems are: Problem set: 0 solved, 773 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/832 variables, and 296 constraints, problems are : Problem set: 0 solved, 773 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 773/773 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 773 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 3 (OVERLAPS) 774/832 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/832 variables, 226/296 constraints. Problems are: Problem set: 0 solved, 773 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/832 variables, and 1069 constraints, problems are : Problem set: 0 solved, 773 unsolved in 31530 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 773/773 constraints, Known Traps: 0/0 constraints]
After SMT, in 76555ms problems are : Problem set: 0 solved, 773 unsolved
Search for dead transitions found 0 dead transitions in 76573ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77229 ms. Remains : 58/58 places, 774/774 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 40 ms. Remains 58 /58 variables (removed 0) and now considering 774/774 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 05:50:42] [INFO ] Invariant cache hit.
[2024-06-01 05:50:42] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 05:50:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 05:50:43] [INFO ] After 799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 05:50:43] [INFO ] After 1116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 05:50:43] [INFO ] After 1762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1939 ms.
[2024-06-01 05:50:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-01 05:50:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 58 places, 774 transitions and 12129 arcs took 30 ms.
[2024-06-01 05:50:45] [INFO ] Flatten gal took : 574 ms
Total runtime 213257 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-09a-ReachabilityFireability-2024-05

BK_STOP 1717221045632

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-09a-ReachabilityFireability-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/641/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-09a"
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-09a, 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-171620167500351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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