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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 12 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 17:58 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 177K 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-06a-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717213308836

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:41:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 03:41:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:41:51] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-06-01 03:41:51] [INFO ] Transformed 65 places.
[2024-06-01 03:41:51] [INFO ] Transformed 417 transitions.
[2024-06-01 03:41:51] [INFO ] Found NUPN structural information;
[2024-06-01 03:41:51] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 480 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 61 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2228 resets) in 2924 ms. (13 steps per ms) remains 7/10 properties
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (248 resets) in 435 ms. (91 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (306 resets) in 510 ms. (78 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (245 resets) in 145 ms. (274 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (202 resets) in 807 ms. (49 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (247 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (218 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (276 resets) in 266 ms. (149 steps per ms) remains 7/7 properties
[2024-06-01 03:41:53] [INFO ] Flow matrix only has 257 transitions (discarded 1 similar events)
// Phase 1: matrix 257 rows 65 cols
[2024-06-01 03:41:53] [INFO ] Computed 11 invariants in 11 ms
[2024-06-01 03:41:53] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 7/65 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 256/321 variables, 65/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 146/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/322 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/322 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 288 constraints, problems are : Problem set: 0 solved, 7 unsolved in 950 ms.
Refiners :[Domain max(s): 65/65 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Problem AutonomousCar-PT-06a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 5/63 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem AutonomousCar-PT-06a-ReachabilityCardinality-2024-12 is UNSAT
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-06a-ReachabilityCardinality-2024-14 is UNSAT
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 7/65 variables, 6/69 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 7/76 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-01 03:41:55] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/77 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/77 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 256/321 variables, 65/142 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 146/288 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 4/292 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/292 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/322 variables, 1/293 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/293 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/322 variables, 0/293 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 293 constraints, problems are : Problem set: 3 solved, 4 unsolved in 1610 ms.
Refiners :[Domain max(s): 65/65 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 2838ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1769 ms.
Support contains 39 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 258/258 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 4 place count 65 transition count 254
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 63 transition count 254
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 63 transition count 251
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 24 place count 60 transition count 239
Applied a total of 24 rules in 92 ms. Remains 60 /65 variables (removed 5) and now considering 239/258 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 60/65 places, 239/258 transitions.
RANDOM walk for 40000 steps (1708 resets) in 461 ms. (86 steps per ms) remains 2/3 properties
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (336 resets) in 383 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (167 resets) in 256 ms. (155 steps per ms) remains 2/2 properties
// Phase 1: matrix 239 rows 60 cols
[2024-06-01 03:41:58] [INFO ] Computed 11 invariants in 4 ms
[2024-06-01 03:41:58] [INFO ] State equation strengthened by 134 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/60 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 03:41:59] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 239/299 variables, 60/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 134/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/299 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 266 constraints, problems are : Problem set: 0 solved, 2 unsolved in 382 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 60/60 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/60 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 239/299 variables, 60/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 134/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/299 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 268 constraints, problems are : Problem set: 0 solved, 2 unsolved in 440 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 60/60 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 879ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 832 ms.
Support contains 39 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 239/239 transitions.
Applied a total of 0 rules in 45 ms. Remains 60 /60 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 60/60 places, 239/239 transitions.
RANDOM walk for 40000 steps (1717 resets) in 478 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (335 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (162 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1214312 steps, run timeout after 3001 ms. (steps per millisecond=404 ) properties seen :0 out of 2
Probabilistic random walk after 1214312 steps, saw 187606 distinct states, run finished after 3019 ms. (steps per millisecond=402 ) properties seen :0
[2024-06-01 03:42:03] [INFO ] Invariant cache hit.
[2024-06-01 03:42:03] [INFO ] State equation strengthened by 134 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/60 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 03:42:04] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 239/299 variables, 60/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 134/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/299 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 266 constraints, problems are : Problem set: 0 solved, 2 unsolved in 629 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 60/60 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/60 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 03:42:04] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 239/299 variables, 60/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 134/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/299 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 269 constraints, problems are : Problem set: 0 solved, 2 unsolved in 917 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 60/60 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1580ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 949 ms.
Support contains 39 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 239/239 transitions.
Applied a total of 0 rules in 19 ms. Remains 60 /60 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 60/60 places, 239/239 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 239/239 transitions.
Applied a total of 0 rules in 18 ms. Remains 60 /60 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-06-01 03:42:06] [INFO ] Invariant cache hit.
[2024-06-01 03:42:06] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 03:42:06] [INFO ] Invariant cache hit.
[2024-06-01 03:42:06] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-06-01 03:42:06] [INFO ] Implicit Places using invariants and state equation in 181 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 315 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/60 places, 239/239 transitions.
Applied a total of 0 rules in 8 ms. Remains 59 /59 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 341 ms. Remains : 59/60 places, 239/239 transitions.
RANDOM walk for 40000 steps (1674 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (329 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (170 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1044030 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 2
Probabilistic random walk after 1044030 steps, saw 161829 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
// Phase 1: matrix 239 rows 59 cols
[2024-06-01 03:42:10] [INFO ] Computed 10 invariants in 4 ms
[2024-06-01 03:42:10] [INFO ] State equation strengthened by 134 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/59 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 239/298 variables, 59/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 134/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 262 constraints, problems are : Problem set: 0 solved, 2 unsolved in 262 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 134/134 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/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/59 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 03:42:10] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 2 ms to minimize.
[2024-06-01 03:42:10] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 239/298 variables, 59/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 134/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/298 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 266 constraints, problems are : Problem set: 0 solved, 2 unsolved in 971 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1272ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 950 ms.
Support contains 39 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 239/239 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 59/59 places, 239/239 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 239/239 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-06-01 03:42:12] [INFO ] Invariant cache hit.
[2024-06-01 03:42:12] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 03:42:12] [INFO ] Invariant cache hit.
[2024-06-01 03:42:12] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-06-01 03:42:12] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-06-01 03:42:12] [INFO ] Redundant transitions in 13 ms returned []
Running 238 sub problems to find dead transitions.
[2024-06-01 03:42:12] [INFO ] Invariant cache hit.
[2024-06-01 03:42:12] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 03:42:16] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 2 ms to minimize.
[2024-06-01 03:42:16] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 239/297 variables, 58/128 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 134/262 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (OVERLAPS) 1/298 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 0/298 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 264 constraints, problems are : Problem set: 0 solved, 238 unsolved in 19383 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 239/297 variables, 58/128 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 134/262 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 235/497 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 1/298 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 3/502 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 03:42:53] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/298 variables, and 503 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30029 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 3/3 constraints]
After SMT, in 50861ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 50867ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51172 ms. Remains : 59/59 places, 239/239 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 8 ms. Remains 59 /59 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 03:43:03] [INFO ] Invariant cache hit.
[2024-06-01 03:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 03:43:03] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 03:43:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 03:43:03] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 03:43:03] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 03:43:03] [INFO ] After 459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 552 ms.
[2024-06-01 03:43:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-01 03:43:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 239 transitions and 2060 arcs took 7 ms.
[2024-06-01 03:43:04] [INFO ] Flatten gal took : 173 ms
Total runtime 73143 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-06a-ReachabilityCardinality-2024-02
Could not compute solution for formula : AutonomousCar-PT-06a-ReachabilityCardinality-2024-09

BK_STOP 1717213384787

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name AutonomousCar-PT-06a-ReachabilityCardinality-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/594/inv_0_
rfs formula name AutonomousCar-PT-06a-ReachabilityCardinality-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/594/inv_1_
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-06a"
export BK_EXAMINATION="ReachabilityCardinality"
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-06a, examination is ReachabilityCardinality"
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-171620167400302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06a.tgz
mv AutonomousCar-PT-06a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;