Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K 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 May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 18:08 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 865K 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-09b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716359434103

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 06:30:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 06:30:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:30:37] [INFO ] Load time of PNML (sax parser for PT used): 502 ms
[2024-05-22 06:30:37] [INFO ] Transformed 391 places.
[2024-05-22 06:30:37] [INFO ] Transformed 1554 transitions.
[2024-05-22 06:30:37] [INFO ] Found NUPN structural information;
[2024-05-22 06:30:37] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 900 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (332 resets) in 3074 ms. (13 steps per ms) remains 2/12 properties
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (43 resets) in 466 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
// Phase 1: matrix 1554 rows 391 cols
[2024-05-22 06:30:39] [INFO ] Computed 14 invariants in 70 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 278/298 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 278/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 93/391 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 93/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1554/1945 variables, 391/796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1945 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1945 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1945/1945 variables, and 796 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2174 ms.
Refiners :[Domain max(s): 391/391 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 391/391 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/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 278/298 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 278/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:30:42] [INFO ] Deduced a trap composed of 18 places in 1176 ms of which 54 ms to minimize.
[2024-05-22 06:30:44] [INFO ] Deduced a trap composed of 12 places in 1196 ms of which 6 ms to minimize.
[2024-05-22 06:30:45] [INFO ] Deduced a trap composed of 16 places in 960 ms of which 5 ms to minimize.
[2024-05-22 06:30:46] [INFO ] Deduced a trap composed of 15 places in 876 ms of which 3 ms to minimize.
[2024-05-22 06:30:46] [INFO ] Deduced a trap composed of 22 places in 897 ms of which 5 ms to minimize.
SMT process timed out in 7981ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 339 edges and 391 vertex of which 2 / 391 are part of one of the 1 SCC in 8 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1701 edges and 390 vertex of which 386 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.47 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 144 rules applied. Total rules applied 146 place count 386 transition count 1405
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 179 rules applied. Total rules applied 325 place count 243 transition count 1369
Reduce places removed 21 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 34 rules applied. Total rules applied 359 place count 222 transition count 1356
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 372 place count 209 transition count 1356
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 372 place count 209 transition count 1345
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 394 place count 198 transition count 1345
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 425 place count 167 transition count 1314
Iterating global reduction 4 with 31 rules applied. Total rules applied 456 place count 167 transition count 1314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 457 place count 167 transition count 1313
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 464 place count 160 transition count 1204
Iterating global reduction 5 with 7 rules applied. Total rules applied 471 place count 160 transition count 1204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 8 rules applied. Total rules applied 479 place count 160 transition count 1196
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 483 place count 156 transition count 1196
Performed 48 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 579 place count 108 transition count 1147
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 588 place count 99 transition count 976
Iterating global reduction 7 with 9 rules applied. Total rules applied 597 place count 99 transition count 976
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 601 place count 97 transition count 976
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 602 place count 97 transition count 975
Drop transitions (Redundant composition of simpler transitions.) removed 193 transitions
Redundant transition composition rules discarded 193 transitions
Iterating global reduction 8 with 193 rules applied. Total rules applied 795 place count 97 transition count 782
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 806 place count 97 transition count 771
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 817 place count 86 transition count 771
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 818 place count 86 transition count 771
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 819 place count 85 transition count 770
Applied a total of 819 rules in 1034 ms. Remains 85 /391 variables (removed 306) and now considering 770/1554 (removed 784) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1053 ms. Remains : 85/391 places, 770/1554 transitions.
RANDOM walk for 40000 steps (403 resets) in 289 ms. (137 steps per ms) remains 1/2 properties
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (122 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
// Phase 1: matrix 770 rows 85 cols
[2024-05-22 06:30:48] [INFO ] Computed 14 invariants in 13 ms
[2024-05-22 06:30:48] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/73 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 761/834 variables, 73/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/834 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/855 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/855 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/855 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/855 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/73 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:30:49] [INFO ] Deduced a trap composed of 4 places in 504 ms of which 2 ms to minimize.
[2024-05-22 06:30:49] [INFO ] Deduced a trap composed of 4 places in 518 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 761/834 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/855 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/855 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/855 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/855 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/855 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 855/855 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1998 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2404ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 176 ms.
Support contains 18 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 770/770 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 769
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 83 transition count 769
Applied a total of 4 rules in 100 ms. Remains 83 /85 variables (removed 2) and now considering 769/770 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 83/85 places, 769/770 transitions.
RANDOM walk for 40000 steps (181 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (120 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 928135 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :0 out of 1
Probabilistic random walk after 928135 steps, saw 121552 distinct states, run finished after 3007 ms. (steps per millisecond=308 ) properties seen :0
// Phase 1: matrix 769 rows 83 cols
[2024-05-22 06:30:54] [INFO ] Computed 14 invariants in 12 ms
[2024-05-22 06:30:54] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 760/831 variables, 71/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/831 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/831 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/852 variables, 12/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/852 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/852 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:30:55] [INFO ] Deduced a trap composed of 4 places in 592 ms of which 2 ms to minimize.
[2024-05-22 06:30:55] [INFO ] Deduced a trap composed of 5 places in 488 ms of which 1 ms to minimize.
[2024-05-22 06:30:56] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 760/831 variables, 71/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/831 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/831 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/852 variables, 12/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/852 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/852 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:30:57] [INFO ] Deduced a trap composed of 6 places in 726 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/852 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/852 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/852 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 852/852 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3392 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 3985ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 178 ms.
Support contains 18 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 769/769 transitions.
Applied a total of 0 rules in 64 ms. Remains 83 /83 variables (removed 0) and now considering 769/769 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 83/83 places, 769/769 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 769/769 transitions.
Applied a total of 0 rules in 64 ms. Remains 83 /83 variables (removed 0) and now considering 769/769 (removed 0) transitions.
[2024-05-22 06:30:58] [INFO ] Invariant cache hit.
[2024-05-22 06:30:58] [INFO ] Implicit Places using invariants in 600 ms returned []
[2024-05-22 06:30:58] [INFO ] Invariant cache hit.
[2024-05-22 06:30:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:30:59] [INFO ] Implicit Places using invariants and state equation in 673 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1300 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 769/769 transitions.
Applied a total of 0 rules in 70 ms. Remains 82 /82 variables (removed 0) and now considering 769/769 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1434 ms. Remains : 82/83 places, 769/769 transitions.
RANDOM walk for 40000 steps (408 resets) in 1232 ms. (32 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (121 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1085662 steps, run timeout after 3001 ms. (steps per millisecond=361 ) properties seen :0 out of 1
Probabilistic random walk after 1085662 steps, saw 139579 distinct states, run finished after 3001 ms. (steps per millisecond=361 ) properties seen :0
// Phase 1: matrix 769 rows 82 cols
[2024-05-22 06:31:03] [INFO ] Computed 13 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/67 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 760/827 variables, 67/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/851 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/851 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/851 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/851 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 82/82 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/67 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:31:04] [INFO ] Deduced a trap composed of 4 places in 594 ms of which 2 ms to minimize.
[2024-05-22 06:31:05] [INFO ] Deduced a trap composed of 4 places in 549 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 760/827 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/827 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/851 variables, 15/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/851 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/851 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:31:06] [INFO ] Deduced a trap composed of 6 places in 540 ms of which 2 ms to minimize.
[2024-05-22 06:31:06] [INFO ] Deduced a trap composed of 11 places in 458 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/851 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/851 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/851 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3397 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 3978ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 401 ms.
Support contains 18 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 769/769 transitions.
Applied a total of 0 rules in 61 ms. Remains 82 /82 variables (removed 0) and now considering 769/769 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 82/82 places, 769/769 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 769/769 transitions.
Applied a total of 0 rules in 61 ms. Remains 82 /82 variables (removed 0) and now considering 769/769 (removed 0) transitions.
[2024-05-22 06:31:07] [INFO ] Invariant cache hit.
[2024-05-22 06:31:08] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-22 06:31:08] [INFO ] Invariant cache hit.
[2024-05-22 06:31:09] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
[2024-05-22 06:31:09] [INFO ] Redundant transitions in 73 ms returned []
Running 765 sub problems to find dead transitions.
[2024-05-22 06:31:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 2 (OVERLAPS) 4/82 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 765 unsolved
[2024-05-22 06:31:33] [INFO ] Deduced a trap composed of 20 places in 782 ms of which 2 ms to minimize.
[2024-05-22 06:31:34] [INFO ] Deduced a trap composed of 4 places in 691 ms of which 2 ms to minimize.
[2024-05-22 06:31:35] [INFO ] Deduced a trap composed of 12 places in 554 ms of which 1 ms to minimize.
[2024-05-22 06:31:35] [INFO ] Deduced a trap composed of 12 places in 454 ms of which 1 ms to minimize.
[2024-05-22 06:31:36] [INFO ] Deduced a trap composed of 5 places in 506 ms of which 1 ms to minimize.
[2024-05-22 06:31:36] [INFO ] Deduced a trap composed of 5 places in 547 ms of which 2 ms to minimize.
[2024-05-22 06:31:37] [INFO ] Deduced a trap composed of 12 places in 626 ms of which 3 ms to minimize.
[2024-05-22 06:31:37] [INFO ] Deduced a trap composed of 12 places in 552 ms of which 2 ms to minimize.
[2024-05-22 06:31:38] [INFO ] Deduced a trap composed of 5 places in 492 ms of which 1 ms to minimize.
[2024-05-22 06:31:38] [INFO ] Deduced a trap composed of 14 places in 506 ms of which 1 ms to minimize.
[2024-05-22 06:31:39] [INFO ] Deduced a trap composed of 4 places in 545 ms of which 2 ms to minimize.
[2024-05-22 06:31:43] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 2 ms to minimize.
[2024-05-22 06:31:44] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 1 ms to minimize.
[2024-05-22 06:31:44] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 1 ms to minimize.
[2024-05-22 06:31:44] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 1 ms to minimize.
[2024-05-22 06:31:44] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2024-05-22 06:31:45] [INFO ] Deduced a trap composed of 11 places in 406 ms of which 1 ms to minimize.
[2024-05-22 06:31:45] [INFO ] Deduced a trap composed of 6 places in 547 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 765 unsolved
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 12 places in 448 ms of which 3 ms to minimize.
[2024-05-22 06:31:53] [INFO ] Deduced a trap composed of 14 places in 283 ms of which 4 ms to minimize.
SMT process timed out in 44161ms, After SMT, problems are : Problem set: 0 solved, 765 unsolved
Search for dead transitions found 0 dead transitions in 44183ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45641 ms. Remains : 82/82 places, 769/769 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 35 ms. Remains 82 /82 variables (removed 0) and now considering 769/769 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 06:31:53] [INFO ] Invariant cache hit.
[2024-05-22 06:31:53] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 06:31:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 06:31:54] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 06:31:54] [INFO ] Deduced a trap composed of 6 places in 474 ms of which 2 ms to minimize.
[2024-05-22 06:31:55] [INFO ] Deduced a trap composed of 4 places in 533 ms of which 1 ms to minimize.
[2024-05-22 06:31:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1092 ms
TRAPS : Iteration 1
[2024-05-22 06:31:55] [INFO ] After 1940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 06:31:55] [INFO ] After 2145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2264 ms.
[2024-05-22 06:31:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-22 06:31:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 769 transitions and 11917 arcs took 23 ms.
[2024-05-22 06:31:56] [INFO ] Flatten gal took : 635 ms
Total runtime 79986 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-09b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 82
TRANSITIONS: 769
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.069s, Sys 0.007s]


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


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

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

Process ID: 718
MODEL NAME: /home/mcc/execution/416/model
82 places, 769 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716359520323

--------------------
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

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-09b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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