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.r553-tall-171734901200230.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FireWire-PT-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901200230
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 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 FireWire-PT-08-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717354598107

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:56:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:56:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:56:39] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 18:56:39] [INFO ] Transformed 127 places.
[2024-06-02 18:56:39] [INFO ] Transformed 397 transitions.
[2024-06-02 18:56:39] [INFO ] Found NUPN structural information;
[2024-06-02 18:56:39] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2259 resets) in 1943 ms. (20 steps per ms) remains 10/11 properties
FORMULA FireWire-PT-08-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (579 resets) in 279 ms. (142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (587 resets) in 215 ms. (185 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (558 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (583 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (535 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (615 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (555 resets) in 152 ms. (261 steps per ms) remains 8/10 properties
FORMULA FireWire-PT-08-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (586 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (555 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (625 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
[2024-06-02 18:56:40] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
// Phase 1: matrix 312 rows 127 cols
[2024-06-02 18:56:40] [INFO ] Computed 8 invariants in 19 ms
[2024-06-02 18:56:40] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 54/127 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 54/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 311/438 variables, 127/262 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 44/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/439 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/439 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 307 constraints, problems are : Problem set: 0 solved, 8 unsolved in 725 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 54/127 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 54/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:56:41] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 14 ms to minimize.
[2024-06-02 18:56:41] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:56:42] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:56:42] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:56:42] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:56:42] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
Problem FireWire-PT-08-ReachabilityCardinality-2024-13 is UNSAT
FORMULA FireWire-PT-08-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 6/141 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 311/438 variables, 127/268 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 44/312 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 7/319 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/319 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/439 variables, 1/320 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/439 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 320 constraints, problems are : Problem set: 1 solved, 7 unsolved in 1927 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 2791ms problems are : Problem set: 1 solved, 7 unsolved
Parikh walk visited 0 properties in 6923 ms.
Support contains 72 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 344/344 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 126 transition count 339
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 126 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 126 transition count 338
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 125 transition count 340
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 125 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 17 place count 125 transition count 331
Applied a total of 17 rules in 57 ms. Remains 125 /127 variables (removed 2) and now considering 331/344 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 125/127 places, 331/344 transitions.
RANDOM walk for 40000 steps (2215 resets) in 401 ms. (99 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (596 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (568 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (578 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (566 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (579 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (489 resets) in 33 ms. (1176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (637 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 816762 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :2 out of 7
Probabilistic random walk after 816762 steps, saw 179361 distinct states, run finished after 3004 ms. (steps per millisecond=271 ) properties seen :2
FORMULA FireWire-PT-08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-08-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 18:56:53] [INFO ] Flow matrix only has 307 transitions (discarded 24 similar events)
// Phase 1: matrix 307 rows 125 cols
[2024-06-02 18:56:53] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 18:56:53] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 73/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 307/430 variables, 123/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/432 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 179 constraints, problems are : Problem set: 0 solved, 5 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 73/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 307/430 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 46/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/432 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:56:55] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/432 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/432 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 191 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints]
After SMT, in 1819ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1379 ms.
Support contains 50 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 331/331 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 326
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 123 transition count 325
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 122 transition count 324
Applied a total of 7 rules in 18 ms. Remains 122 /125 variables (removed 3) and now considering 324/331 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 122/125 places, 324/331 transitions.
RANDOM walk for 40000 steps (2244 resets) in 112 ms. (353 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (557 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (534 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (450 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (513 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (615 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 803951 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :0 out of 5
Probabilistic random walk after 803951 steps, saw 172498 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
[2024-06-02 18:57:00] [INFO ] Flow matrix only has 300 transitions (discarded 24 similar events)
// Phase 1: matrix 300 rows 122 cols
[2024-06-02 18:57:00] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:57:00] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 70/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 300/420 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/422 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 175 constraints, problems are : Problem set: 0 solved, 5 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 70/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:57:00] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:57:00] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:57:00] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:57:01] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:57:01] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:57:01] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:57:01] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:57:01] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:57:01] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:57:01] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 300/420 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 45/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/422 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/422 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 190 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1431 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 1749ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 813 ms.
Support contains 50 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 324/324 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 122/122 places, 324/324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 324/324 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 324/324 (removed 0) transitions.
[2024-06-02 18:57:02] [INFO ] Flow matrix only has 300 transitions (discarded 24 similar events)
[2024-06-02 18:57:02] [INFO ] Invariant cache hit.
[2024-06-02 18:57:03] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 18:57:03] [INFO ] Flow matrix only has 300 transitions (discarded 24 similar events)
[2024-06-02 18:57:03] [INFO ] Invariant cache hit.
[2024-06-02 18:57:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 18:57:03] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-06-02 18:57:03] [INFO ] Redundant transitions in 18 ms returned []
Running 323 sub problems to find dead transitions.
[2024-06-02 18:57:03] [INFO ] Flow matrix only has 300 transitions (discarded 24 similar events)
[2024-06-02 18:57:03] [INFO ] Invariant cache hit.
[2024-06-02 18:57:03] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 18:57:05] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:57:05] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:57:05] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:57:05] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:57:05] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:57:06] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:57:06] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 300/422 variables, 122/137 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 0/422 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 182 constraints, problems are : Problem set: 0 solved, 323 unsolved in 8894 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 300/422 variables, 122/137 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 323/505 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 18:57:20] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 9 (OVERLAPS) 0/422 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 506 constraints, problems are : Problem set: 0 solved, 323 unsolved in 28423 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 8/8 constraints]
After SMT, in 37579ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 37588ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37857 ms. Remains : 122/122 places, 324/324 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 42 edges and 122 vertex of which 12 / 122 are part of one of the 4 SCC in 2 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 76 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 3 place count 113 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 28 place count 113 transition count 222
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 113 transition count 221
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 112 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 111 transition count 220
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 37 place count 111 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 111 transition count 219
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 110 transition count 218
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 110 transition count 218
Applied a total of 40 rules in 38 ms. Remains 110 /122 variables (removed 12) and now considering 218/324 (removed 106) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 218 rows 110 cols
[2024-06-02 18:57:40] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:57:40] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 18:57:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:57:41] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-02 18:57:41] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:57:41] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:57:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2024-06-02 18:57:41] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
TRAPS : Iteration 1
[2024-06-02 18:57:41] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 4 ms to minimize.
[2024-06-02 18:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
TRAPS : Iteration 2
[2024-06-02 18:57:41] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
TRAPS : Iteration 3
[2024-06-02 18:57:41] [INFO ] After 858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-02 18:57:41] [INFO ] After 999ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 1107 ms.
[2024-06-02 18:57:41] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-02 18:57:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 122 places, 324 transitions and 1205 arcs took 5 ms.
[2024-06-02 18:57:42] [INFO ] Flatten gal took : 57 ms
Total runtime 62918 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FireWire-PT-08-ReachabilityCardinality-2024-02
Could not compute solution for formula : FireWire-PT-08-ReachabilityCardinality-2024-04
Could not compute solution for formula : FireWire-PT-08-ReachabilityCardinality-2024-07
Could not compute solution for formula : FireWire-PT-08-ReachabilityCardinality-2024-10
Could not compute solution for formula : FireWire-PT-08-ReachabilityCardinality-2024-14

BK_STOP 1717354662443

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name FireWire-PT-08-ReachabilityCardinality-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/661/inv_0_
rfs formula name FireWire-PT-08-ReachabilityCardinality-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/661/inv_1_
rfs formula name FireWire-PT-08-ReachabilityCardinality-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/661/inv_2_
rfs formula name FireWire-PT-08-ReachabilityCardinality-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/661/inv_3_
rfs formula name FireWire-PT-08-ReachabilityCardinality-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/661/inv_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-08"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-08, 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 r553-tall-171734901200230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-08.tgz
mv FireWire-PT-08 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;