About the Execution of ITS-Tools for PolyORBLF-PT-S06J04T04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 139366.00 | 0.00 | 0.00 | TTFTFTTTTF?FFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446800318.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S06J04T04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446800318
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.8M May 18 16:43 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 PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716919719367
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 18:08:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 18:08:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:08:42] [INFO ] Load time of PNML (sax parser for PT used): 816 ms
[2024-05-28 18:08:42] [INFO ] Transformed 454 places.
[2024-05-28 18:08:42] [INFO ] Transformed 6994 transitions.
[2024-05-28 18:08:42] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 1164 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 244 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
RANDOM walk for 40000 steps (215 resets) in 3282 ms. (12 steps per ms) remains 9/16 properties
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (94 resets) in 1117 ms. (35 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (19 resets) in 1184 ms. (33 steps per ms) remains 9/9 properties
[2024-05-28 18:08:45] [INFO ] Flatten gal took : 721 ms
BEST_FIRST walk for 40003 steps (109 resets) in 792 ms. (50 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (95 resets) in 670 ms. (59 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 501 ms. (79 steps per ms) remains 9/9 properties
[2024-05-28 18:08:45] [INFO ] Flatten gal took : 521 ms
BEST_FIRST walk for 40003 steps (94 resets) in 743 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (76 resets) in 448 ms. (89 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (99 resets) in 429 ms. (93 steps per ms) remains 9/9 properties
[2024-05-28 18:08:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17696877636153940044.gal : 248 ms
[2024-05-28 18:08:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3159123670265989856.prop : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17696877636153940044.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3159123670265989856.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (83 resets) in 632 ms. (63 steps per ms) remains 9/9 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2024-05-28 18:08:46] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2024-05-28 18:08:46] [INFO ] Computed 50 invariants in 122 ms
[2024-05-28 18:08:46] [INFO ] State equation strengthened by 112 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality3159123670265989856.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :7 after 13
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :13 after 15
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :15 after 31
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :31 after 63
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :63 after 126
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :126 after 213
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :213 after 251
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :251 after 331
At refinement iteration 3 (OVERLAPS) 115/304 variables, 17/19 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-02 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-03 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-08 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-15 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 146/450 variables, 28/47 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/47 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/452 variables, 2/49 constraints. Problems are: Problem set: 8 solved, 1 unsolved
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :331 after 1548
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/49 constraints. Problems are: Problem set: 8 solved, 1 unsolved
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :1548 after 2416
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :2416 after 4687
Solver is answering 'unknown', stopping.
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :4687 after 9711
After SMT solving in domain Real declared 2042/2044 variables, and 501 constraints, problems are : Problem set: 8 solved, 1 unsolved in 4050 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 452/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 283/284 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/362 variables, 17/21 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/21 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/366 variables, 1/22 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 84/450 variables, 25/47 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-28 18:08:51] [INFO ] Deduced a trap composed of 85 places in 226 ms of which 30 ms to minimize.
[2024-05-28 18:08:51] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
[2024-05-28 18:08:52] [INFO ] Deduced a trap composed of 237 places in 457 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 3/50 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/452 variables, 2/52 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/52 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2042/2044 variables, and 504 constraints, problems are : Problem set: 8 solved, 1 unsolved in 2918 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 452/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 7488ms problems are : Problem set: 8 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 78 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 364 transition count 1530
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 270 place count 316 transition count 1482
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 278 place count 316 transition count 1474
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 286 place count 308 transition count 1474
Applied a total of 286 rules in 574 ms. Remains 308 /454 variables (removed 146) and now considering 1474/1614 (removed 140) transitions.
Running 1468 sub problems to find dead transitions.
[2024-05-28 18:08:54] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
// Phase 1: matrix 1450 rows 308 cols
[2024-05-28 18:08:54] [INFO ] Computed 44 invariants in 68 ms
[2024-05-28 18:08:54] [INFO ] State equation strengthened by 112 read => feed constraints.
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :9711 after 72718
SDD proceeding with computation,9 properties remain. new max is 65536
SDD size :72718 after 158977
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
[2024-05-28 18:09:29] [INFO ] Deduced a trap composed of 18 places in 366 ms of which 4 ms to minimize.
[2024-05-28 18:09:30] [INFO ] Deduced a trap composed of 35 places in 323 ms of which 4 ms to minimize.
[2024-05-28 18:09:30] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 8 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 131072
SDD size :158977 after 1.1535e+06
[2024-05-28 18:09:34] [INFO ] Deduced a trap composed of 86 places in 253 ms of which 1 ms to minimize.
[2024-05-28 18:09:34] [INFO ] Deduced a trap composed of 71 places in 263 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1758 variables, and 42 constraints, problems are : Problem set: 0 solved, 1468 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1468/1468 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1468 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
[2024-05-28 18:09:40] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
[2024-05-28 18:09:53] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/1758 variables, and 44 constraints, problems are : Problem set: 0 solved, 1468 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1468 constraints, Known Traps: 7/7 constraints]
After SMT, in 63064ms problems are : Problem set: 0 solved, 1468 unsolved
Search for dead transitions found 0 dead transitions in 63126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63752 ms. Remains : 308/454 places, 1474/1614 transitions.
RANDOM walk for 40000 steps (443 resets) in 761 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (148 resets) in 475 ms. (84 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 232283 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 232283 steps, saw 115643 distinct states, run finished after 3005 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-28 18:10:01] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 18:10:01] [INFO ] Invariant cache hit.
[2024-05-28 18:10:01] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 199/200 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 18:10:01] [INFO ] Deduced a trap composed of 60 places in 433 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 59/259 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 18:10:01] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 46/305 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,9 properties remain. new max is 262144
SDD size :1.1535e+06 after 2.28215e+06
[2024-05-28 18:10:08] [INFO ] Deduced a trap composed of 37 places in 6819 ms of which 27 ms to minimize.
[2024-05-28 18:10:09] [INFO ] Deduced a trap composed of 90 places in 487 ms of which 2 ms to minimize.
[2024-05-28 18:10:12] [INFO ] Deduced a trap composed of 50 places in 2934 ms of which 28 ms to minimize.
[2024-05-28 18:10:12] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/306 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1450/1756 variables, 306/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1756 variables, 112/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1756 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1758 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1758 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1758 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1758 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1758/1758 variables, and 470 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14134 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 308/308 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 199/200 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 59/259 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 46/305 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 18:10:15] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/306 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1450/1756 variables, 306/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1756 variables, 112/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1756 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1756 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1758 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1758 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1758 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1758 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1758/1758 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3732 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 308/308 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 17893ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 385 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1474/1474 transitions.
Applied a total of 0 rules in 43 ms. Remains 308 /308 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 308/308 places, 1474/1474 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1474/1474 transitions.
Applied a total of 0 rules in 33 ms. Remains 308 /308 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
[2024-05-28 18:10:19] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 18:10:19] [INFO ] Invariant cache hit.
[2024-05-28 18:10:20] [INFO ] Implicit Places using invariants in 867 ms returned [29, 202, 240, 280]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 887 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 304/308 places, 1474/1474 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 301 transition count 1471
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 301 transition count 1471
Applied a total of 6 rules in 52 ms. Remains 301 /304 variables (removed 3) and now considering 1471/1474 (removed 3) transitions.
[2024-05-28 18:10:20] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
// Phase 1: matrix 1447 rows 301 cols
[2024-05-28 18:10:20] [INFO ] Computed 40 invariants in 57 ms
[2024-05-28 18:10:21] [INFO ] Implicit Places using invariants in 769 ms returned []
[2024-05-28 18:10:21] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2024-05-28 18:10:21] [INFO ] Invariant cache hit.
[2024-05-28 18:10:22] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:10:29] [INFO ] Implicit Places using invariants and state equation in 7720 ms returned []
Implicit Place search using SMT with State Equation took 8496 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 301/308 places, 1471/1474 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9470 ms. Remains : 301/308 places, 1471/1474 transitions.
RANDOM walk for 40000 steps (448 resets) in 1122 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (133 resets) in 292 ms. (136 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 225761 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 225761 steps, saw 141419 distinct states, run finished after 3002 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-28 18:10:32] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2024-05-28 18:10:32] [INFO ] Invariant cache hit.
[2024-05-28 18:10:32] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 220/221 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 29/250 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/299 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 18:10:33] [INFO ] Deduced a trap composed of 50 places in 692 ms of which 1 ms to minimize.
[2024-05-28 18:10:33] [INFO ] Deduced a trap composed of 50 places in 316 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1447/1746 variables, 299/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1746 variables, 112/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1746 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/1748 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1748 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1748 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1748 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1748/1748 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3138 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 301/301 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 220/221 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/250 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/299 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1447/1746 variables, 299/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1746 variables, 112/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1746 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1746 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1748 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1748 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1748 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1748 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1748/1748 variables, and 456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2997 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 301/301 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 6160ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 230 ms.
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 1471/1471 transitions.
Applied a total of 0 rules in 37 ms. Remains 301 /301 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 301/301 places, 1471/1471 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 1471/1471 transitions.
Applied a total of 0 rules in 36 ms. Remains 301 /301 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
[2024-05-28 18:10:38] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2024-05-28 18:10:38] [INFO ] Invariant cache hit.
[2024-05-28 18:10:41] [INFO ] Implicit Places using invariants in 2163 ms returned []
[2024-05-28 18:10:41] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2024-05-28 18:10:41] [INFO ] Invariant cache hit.
[2024-05-28 18:10:42] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:10:49] [INFO ] Implicit Places using invariants and state equation in 8835 ms returned []
Implicit Place search using SMT with State Equation took 11028 ms to find 0 implicit places.
[2024-05-28 18:10:50] [INFO ] Redundant transitions in 172 ms returned []
Running 1465 sub problems to find dead transitions.
[2024-05-28 18:10:50] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2024-05-28 18:10:50] [INFO ] Invariant cache hit.
[2024-05-28 18:10:50] [INFO ] State equation strengthened by 112 read => feed constraints.
BK_STOP 1716919858733
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="PolyORBLF-PT-S06J04T04"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBLF-PT-S06J04T04, 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 r290-tajo-171654446800318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 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 '
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 ;