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.r224-tall-171649613000531.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 itstools
Input is Medical-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649613000531
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 13 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 14:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 14:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 Medical-PT-06-LTLCardinality-00
FORMULA_NAME Medical-PT-06-LTLCardinality-01
FORMULA_NAME Medical-PT-06-LTLCardinality-02
FORMULA_NAME Medical-PT-06-LTLCardinality-03
FORMULA_NAME Medical-PT-06-LTLCardinality-04
FORMULA_NAME Medical-PT-06-LTLCardinality-05
FORMULA_NAME Medical-PT-06-LTLCardinality-06
FORMULA_NAME Medical-PT-06-LTLCardinality-07
FORMULA_NAME Medical-PT-06-LTLCardinality-08
FORMULA_NAME Medical-PT-06-LTLCardinality-09
FORMULA_NAME Medical-PT-06-LTLCardinality-10
FORMULA_NAME Medical-PT-06-LTLCardinality-11
FORMULA_NAME Medical-PT-06-LTLCardinality-12
FORMULA_NAME Medical-PT-06-LTLCardinality-13
FORMULA_NAME Medical-PT-06-LTLCardinality-14
FORMULA_NAME Medical-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716606500171

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-25 03:08:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 03:08:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 03:08:21] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2024-05-25 03:08:21] [INFO ] Transformed 312 places.
[2024-05-25 03:08:21] [INFO ] Transformed 5431 transitions.
[2024-05-25 03:08:21] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 242 places in 22 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Medical-PT-06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 227
Applied a total of 2 rules in 16 ms. Remains 67 /69 variables (removed 2) and now considering 227/227 (removed 0) transitions.
[2024-05-25 03:08:21] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 67 cols
[2024-05-25 03:08:22] [INFO ] Computed 8 invariants in 12 ms
[2024-05-25 03:08:22] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-25 03:08:22] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-25 03:08:22] [INFO ] Invariant cache hit.
[2024-05-25 03:08:22] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-25 03:08:22] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-05-25 03:08:22] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-25 03:08:22] [INFO ] Invariant cache hit.
[2024-05-25 03:08:22] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-25 03:08:23] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 8 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 220 unsolved
[2024-05-25 03:08:24] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-25 03:08:24] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
[2024-05-25 03:08:24] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 3/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 182/247 variables, 65/77 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 56/133 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/133 constraints. Problems are: Problem set: 6 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/249 variables, 2/135 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/135 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/135 constraints. Problems are: Problem set: 6 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 135 constraints, problems are : Problem set: 6 solved, 216 unsolved in 6068 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 6 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/8 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/10 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 182/247 variables, 65/77 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 56/133 constraints. Problems are: Problem set: 6 solved, 216 unsolved
Problem TDEAD8 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 133/266 constraints. Problems are: Problem set: 9 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/266 constraints. Problems are: Problem set: 9 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 2/249 variables, 2/268 constraints. Problems are: Problem set: 9 solved, 213 unsolved
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 83/351 constraints. Problems are: Problem set: 14 solved, 208 unsolved
[2024-05-25 03:08:32] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
[2024-05-25 03:08:33] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD170 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 2/353 constraints. Problems are: Problem set: 18 solved, 204 unsolved
[2024-05-25 03:08:34] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 1/354 constraints. Problems are: Problem set: 18 solved, 204 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/354 constraints. Problems are: Problem set: 18 solved, 204 unsolved
At refinement iteration 15 (OVERLAPS) 0/249 variables, 0/354 constraints. Problems are: Problem set: 18 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 354 constraints, problems are : Problem set: 18 solved, 204 unsolved in 11074 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 216/222 constraints, Known Traps: 7/7 constraints]
After SMT, in 17391ms problems are : Problem set: 18 solved, 204 unsolved
Search for dead transitions found 18 dead transitions in 17411ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 209/227 transitions.
Reduce places removed 6 places and 43 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 166
Reduce places removed 4 places and 31 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 57 transition count 135
Reduce places removed 2 places and 14 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 55 transition count 121
Reduce places removed 3 places and 19 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 15 place count 52 transition count 102
Applied a total of 15 rules in 4 ms. Remains 52 /67 variables (removed 15) and now considering 102/209 (removed 107) transitions.
[2024-05-25 03:08:39] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
// Phase 1: matrix 90 rows 52 cols
[2024-05-25 03:08:39] [INFO ] Computed 8 invariants in 3 ms
[2024-05-25 03:08:39] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-25 03:08:39] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
[2024-05-25 03:08:39] [INFO ] Invariant cache hit.
[2024-05-25 03:08:39] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-25 03:08:39] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 52/69 places, 102/227 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17971 ms. Remains : 52/69 places, 102/227 transitions.
Support contains 1 out of 52 places after structural reductions.
[2024-05-25 03:08:40] [INFO ] Flatten gal took : 34 ms
[2024-05-25 03:08:40] [INFO ] Flatten gal took : 14 ms
[2024-05-25 03:08:40] [INFO ] Input system was already deterministic with 102 transitions.
RANDOM walk for 40000 steps (268 resets) in 1025 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (54 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1897463 steps, run timeout after 3001 ms. (steps per millisecond=632 ) properties seen :0 out of 1
Probabilistic random walk after 1897463 steps, saw 1055089 distinct states, run finished after 3005 ms. (steps per millisecond=631 ) properties seen :0
[2024-05-25 03:08:43] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
[2024-05-25 03:08:43] [INFO ] Invariant cache hit.
[2024-05-25 03:08:43] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 55/63 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/67 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 51/118 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/118 variables, 29/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/118 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/140 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/140 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/140 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/140 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/142 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/142 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/142 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 43/43 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 55/63 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/67 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 51/118 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/118 variables, 29/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/118 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/118 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/140 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/140 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/140 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/140 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/142 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/142 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/142 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 102/102 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 52 transition count 99
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 49 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 48 transition count 99
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 48 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 46 transition count 97
Applied a total of 12 rules in 17 ms. Remains 46 /52 variables (removed 6) and now considering 97/102 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 46/52 places, 97/102 transitions.
RANDOM walk for 40011 steps (8 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1923731 steps, run timeout after 3001 ms. (steps per millisecond=641 ) properties seen :0 out of 1
Probabilistic random walk after 1923731 steps, saw 1115566 distinct states, run finished after 3001 ms. (steps per millisecond=641 ) properties seen :0
[2024-05-25 03:08:46] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
// Phase 1: matrix 84 rows 46 cols
[2024-05-25 03:08:46] [INFO ] Computed 8 invariants in 3 ms
[2024-05-25 03:08:46] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 69/77 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/78 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/122 variables, 29/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 11/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/130 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/130 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/130 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/130 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/130 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 44/44 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 69/77 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/78 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/122 variables, 29/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 11/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/122 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/130 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/130 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/130 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/130 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/130 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 46/46 places, 97/97 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-25 03:08:47] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
[2024-05-25 03:08:47] [INFO ] Invariant cache hit.
[2024-05-25 03:08:47] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-25 03:08:47] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
[2024-05-25 03:08:47] [INFO ] Invariant cache hit.
[2024-05-25 03:08:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-25 03:08:47] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-25 03:08:47] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-25 03:08:47] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
[2024-05-25 03:08:47] [INFO ] Invariant cache hit.
[2024-05-25 03:08:47] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 03:08:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-25 03:08:47] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 84/130 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 44/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 100 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1390 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 84/130 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 44/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 96/196 constraints. Problems are: Problem set: 8 solved, 88 unsolved
[2024-05-25 03:08:49] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-25 03:08:49] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-25 03:08:49] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-25 03:08:49] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 4/200 constraints. Problems are: Problem set: 8 solved, 88 unsolved
[2024-05-25 03:08:49] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/201 constraints. Problems are: Problem set: 9 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/201 constraints. Problems are: Problem set: 9 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/201 constraints. Problems are: Problem set: 9 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 201 constraints, problems are : Problem set: 9 solved, 87 unsolved in 2085 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 7/7 constraints]
After SMT, in 3511ms problems are : Problem set: 9 solved, 87 unsolved
Search for dead transitions found 9 dead transitions in 3513ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 46/46 places, 88/97 transitions.
Reduce places removed 4 places and 13 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 75
Reduce places removed 2 places and 8 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 40 transition count 67
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 39 transition count 65
Reduce places removed 0 places and 5 transitions.
Graph (complete) has 127 edges and 39 vertex of which 1 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 60 output transitions
Drop transitions (Output transitions of discarded places.) removed 60 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 8 place count 1 transition count 0
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 8 rules in 10 ms. Remains 1 /46 variables (removed 45) and now considering 0/88 (removed 88) transitions.
[2024-05-25 03:08:50] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 03:08:50] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-25 03:08:50] [INFO ] Invariant cache hit.
[2024-05-25 03:08:50] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/46 places, 0/97 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3700 ms. Remains : 1/46 places, 0/97 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
FORMULA Medical-PT-06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 22 stable transitions
All properties solved by simple procedures.
Total runtime 29404 ms.

BK_STOP 1716606530779

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="Medical-PT-06"
export BK_EXAMINATION="LTLCardinality"
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 Medical-PT-06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-171649613000531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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