Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994500491.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d2m96, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994500491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14: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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749197461882

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 08:11:03] [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]
[2025-06-06 08:11:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 08:11:03] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2025-06-06 08:11:03] [INFO ] Transformed 2398 places.
[2025-06-06 08:11:03] [INFO ] Transformed 1954 transitions.
[2025-06-06 08:11:03] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1984 places in 27 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 117 places :
Symmetric choice reduction at 1 with 117 rule applications. Total rules 970 place count 272 transition count 392
Iterating global reduction 1 with 117 rules applied. Total rules applied 1087 place count 272 transition count 392
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1096 place count 272 transition count 383
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1188 place count 180 transition count 291
Iterating global reduction 2 with 92 rules applied. Total rules applied 1280 place count 180 transition count 291
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1315 place count 180 transition count 256
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1352 place count 143 transition count 206
Iterating global reduction 3 with 37 rules applied. Total rules applied 1389 place count 143 transition count 206
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 1415 place count 143 transition count 180
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1423 place count 135 transition count 167
Iterating global reduction 4 with 8 rules applied. Total rules applied 1431 place count 135 transition count 167
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1439 place count 127 transition count 159
Iterating global reduction 4 with 8 rules applied. Total rules applied 1447 place count 127 transition count 159
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1452 place count 122 transition count 153
Iterating global reduction 4 with 5 rules applied. Total rules applied 1457 place count 122 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1459 place count 122 transition count 151
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1464 place count 117 transition count 146
Iterating global reduction 5 with 5 rules applied. Total rules applied 1469 place count 117 transition count 146
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1473 place count 113 transition count 142
Iterating global reduction 5 with 4 rules applied. Total rules applied 1477 place count 113 transition count 142
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1479 place count 111 transition count 138
Iterating global reduction 5 with 2 rules applied. Total rules applied 1481 place count 111 transition count 138
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1482 place count 110 transition count 137
Iterating global reduction 5 with 1 rules applied. Total rules applied 1483 place count 110 transition count 137
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1484 place count 109 transition count 136
Iterating global reduction 5 with 1 rules applied. Total rules applied 1485 place count 109 transition count 136
Applied a total of 1485 rules in 96 ms. Remains 109 /414 variables (removed 305) and now considering 136/1954 (removed 1818) transitions.
// Phase 1: matrix 136 rows 109 cols
[2025-06-06 08:11:03] [INFO ] Computed 5 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:11:03] [INFO ] Implicit Places using invariants in 259 ms returned []
[2025-06-06 08:11:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:11:03] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-06 08:11:04] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2025-06-06 08:11:04] [INFO ] Invariant cache hit.
[2025-06-06 08:11:04] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:11:06] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:11:06] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 136/245 variables, 109/116 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 61/177 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:11:10] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 9 (OVERLAPS) 0/245 variables, 1/178 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 0/245 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 178 constraints, problems are : Problem set: 3 solved, 132 unsolved in 12334 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 4/109 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 136/245 variables, 109/117 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 61/178 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 132/310 constraints. Problems are: Problem set: 3 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:11:26] [INFO ] Deduced a trap along path composed of 10 places in 30 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/311 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 0/245 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 311 constraints, problems are : Problem set: 3 solved, 132 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 132/135 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42530ms problems are : Problem set: 3 solved, 132 unsolved
Search for dead transitions found 3 dead transitions in 42542ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/414 places, 133/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 106 transition count 133
Applied a total of 3 rules in 3 ms. Remains 106 /109 variables (removed 3) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 106 cols
[2025-06-06 08:11:46] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:11:46] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-06 08:11:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:11:46] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-06 08:11:47] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/414 places, 133/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43739 ms. Remains : 106/414 places, 133/1954 transitions.
Support contains 3 out of 106 places after structural reductions.
[2025-06-06 08:11:47] [INFO ] Flatten gal took : 32 ms
[2025-06-06 08:11:47] [INFO ] Flatten gal took : 13 ms
[2025-06-06 08:11:47] [INFO ] Input system was already deterministic with 133 transitions.
RANDOM walk for 40000 steps (8953 resets) in 1765 ms. (22 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (4106 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4080 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4212 resets) in 108 ms. (366 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 2206141 steps, run timeout after 3001 ms. (steps per millisecond=735 ) properties seen :2 out of 3
Probabilistic random walk after 2206141 steps, saw 908748 distinct states, run finished after 3005 ms. (steps per millisecond=734 ) properties seen :2
[2025-06-06 08:11:51] [INFO ] Invariant cache hit.
[2025-06-06 08:11:51] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/114 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 61/175 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 23/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/186 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/190 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 239/239 variables, and 136 constraints, problems are : Problem set: 1 solved, 0 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 26/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 348 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 133/133 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 104 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 104 transition count 120
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 104 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 103 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 103 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 103 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 102 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 102 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 102 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 101 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 101 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 100 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 100 transition count 112
Applied a total of 15 rules in 29 ms. Remains 100 /106 variables (removed 6) and now considering 112/133 (removed 21) transitions.
// Phase 1: matrix 112 rows 100 cols
[2025-06-06 08:11:51] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:11:51] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-06 08:11:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:11:51] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-06 08:11:51] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:11:51] [INFO ] Redundant transitions in 5 ms returned []
Running 111 sub problems to find dead transitions.
[2025-06-06 08:11:51] [INFO ] Invariant cache hit.
[2025-06-06 08:11:51] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 5 (OVERLAPS) 112/212 variables, 100/104 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 44/148 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 148 constraints, problems are : Problem set: 3 solved, 108 unsolved in 4458 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 2/99 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 112/211 variables, 99/103 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 44/147 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 16/163 constraints. Problems are: Problem set: 3 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:11:59] [INFO ] Deduced a trap along path composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 1/164 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 1/212 variables, 1/165 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 92/257 constraints. Problems are: Problem set: 3 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:12:06] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 1/258 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 0/258 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 16 (OVERLAPS) 0/212 variables, 0/258 constraints. Problems are: Problem set: 3 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 258 constraints, problems are : Problem set: 3 solved, 108 unsolved in 25042 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 108/111 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29553ms problems are : Problem set: 3 solved, 108 unsolved
Search for dead transitions found 3 dead transitions in 29554ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 100/106 places, 109/133 transitions.
Graph (complete) has 308 edges and 100 vertex of which 97 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 97 /100 variables (removed 3) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 97 cols
[2025-06-06 08:12:21] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:12:21] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 08:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:12:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 08:12:21] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/106 places, 109/133 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30198 ms. Remains : 97/106 places, 109/133 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05 finished in 30425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 133/133 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 104 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 104 transition count 119
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 104 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 102 transition count 116
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 102 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 102 transition count 115
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 100 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 100 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 100 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 99 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 98 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 97 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 97 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 97 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 23 place count 96 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 96 transition count 106
Applied a total of 24 rules in 29 ms. Remains 96 /106 variables (removed 10) and now considering 106/133 (removed 27) transitions.
// Phase 1: matrix 106 rows 96 cols
[2025-06-06 08:12:21] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:12:21] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 08:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:12:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-06 08:12:22] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:12:22] [INFO ] Redundant transitions in 4 ms returned []
Running 105 sub problems to find dead transitions.
[2025-06-06 08:12:22] [INFO ] Invariant cache hit.
[2025-06-06 08:12:22] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 5 (OVERLAPS) 106/202 variables, 96/100 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 42/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 142 constraints, problems are : Problem set: 3 solved, 102 unsolved in 3975 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 2/95 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 106/201 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 42/141 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 16/157 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 1/202 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 86/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:12:31] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 1/245 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 0/245 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 15 (OVERLAPS) 0/202 variables, 0/245 constraints. Problems are: Problem set: 3 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 245 constraints, problems are : Problem set: 3 solved, 102 unsolved in 16931 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 102/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20957ms problems are : Problem set: 3 solved, 102 unsolved
Search for dead transitions found 3 dead transitions in 20959ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 96/106 places, 103/133 transitions.
Graph (complete) has 295 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 93 /96 variables (removed 3) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 93 cols
[2025-06-06 08:12:43] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:12:43] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 08:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:12:43] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 08:12:43] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/106 places, 103/133 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21587 ms. Remains : 93/106 places, 103/133 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12 finished in 21642 ms.
All properties solved by simple procedures.
Total runtime 100342 ms.

BK_STOP 1749197563437

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="SieveSingleMsgMbox-PT-d2m96"
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-5832"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m96, 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 r212-tall-174901994500491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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