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.r334-tall-171679079500075.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 RingSingleMessageInMbox-PT-d1m020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079500075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 23:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 23:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716795955239

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-27 07:45:56] [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-27 07:45:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:45:56] [INFO ] Load time of PNML (sax parser for PT used): 443 ms
[2024-05-27 07:45:56] [INFO ] Transformed 6690 places.
[2024-05-27 07:45:57] [INFO ] Transformed 11934 transitions.
[2024-05-27 07:45:57] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 615 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 4305 places in 56 ms
Reduce places removed 4305 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1106 places :
Symmetric choice reduction at 1 with 1106 rule applications. Total rules 1225 place count 1262 transition count 2422
Iterating global reduction 1 with 1106 rules applied. Total rules applied 2331 place count 1262 transition count 2422
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 2403 place count 1262 transition count 2350
Discarding 937 places :
Symmetric choice reduction at 2 with 937 rule applications. Total rules 3340 place count 325 transition count 1413
Iterating global reduction 2 with 937 rules applied. Total rules applied 4277 place count 325 transition count 1413
Ensure Unique test removed 890 transitions
Reduce isomorphic transitions removed 890 transitions.
Iterating post reduction 2 with 890 rules applied. Total rules applied 5167 place count 325 transition count 523
Discarding 129 places :
Symmetric choice reduction at 3 with 129 rule applications. Total rules 5296 place count 196 transition count 394
Iterating global reduction 3 with 129 rules applied. Total rules applied 5425 place count 196 transition count 394
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 3 with 97 rules applied. Total rules applied 5522 place count 196 transition count 297
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 5530 place count 188 transition count 289
Iterating global reduction 4 with 8 rules applied. Total rules applied 5538 place count 188 transition count 289
Applied a total of 5538 rules in 366 ms. Remains 188 /2385 variables (removed 2197) and now considering 289/11934 (removed 11645) transitions.
// Phase 1: matrix 289 rows 188 cols
[2024-05-27 07:45:57] [INFO ] Computed 3 invariants in 23 ms
[2024-05-27 07:45:57] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-27 07:45:57] [INFO ] Invariant cache hit.
[2024-05-27 07:45:58] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-27 07:45:58] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-27 07:45:58] [INFO ] Invariant cache hit.
[2024-05-27 07:45:58] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
At refinement iteration 4 (OVERLAPS) 289/477 variables, 188/191 constraints. Problems are: Problem set: 24 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 112/303 constraints. Problems are: Problem set: 24 solved, 264 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/303 constraints. Problems are: Problem set: 24 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/477 variables, 0/303 constraints. Problems are: Problem set: 24 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 303 constraints, problems are : Problem set: 24 solved, 264 unsolved in 10300 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 17/180 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 8/188 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 289/477 variables, 188/191 constraints. Problems are: Problem set: 24 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 112/303 constraints. Problems are: Problem set: 24 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 264/567 constraints. Problems are: Problem set: 24 solved, 264 unsolved
[2024-05-27 07:46:16] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 21 ms to minimize.
[2024-05-27 07:46:17] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-27 07:46:17] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 2 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
[2024-05-27 07:46:19] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
[2024-05-27 07:46:20] [INFO ] Deduced a trap composed of 106 places in 62 ms of which 1 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
[2024-05-27 07:46:20] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 6/573 constraints. Problems are: Problem set: 46 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/573 constraints. Problems are: Problem set: 46 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 0/477 variables, 0/573 constraints. Problems are: Problem set: 46 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 573 constraints, problems are : Problem set: 46 solved, 242 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 264/288 constraints, Known Traps: 6/6 constraints]
After SMT, in 41107ms problems are : Problem set: 46 solved, 242 unsolved
Search for dead transitions found 46 dead transitions in 41126ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 188/2385 places, 243/11934 transitions.
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 147 transition count 226
Applied a total of 58 rules in 3 ms. Remains 147 /188 variables (removed 41) and now considering 226/243 (removed 17) transitions.
// Phase 1: matrix 226 rows 147 cols
[2024-05-27 07:46:39] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:46:39] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-27 07:46:39] [INFO ] Invariant cache hit.
[2024-05-27 07:46:39] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-27 07:46:40] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/2385 places, 226/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42693 ms. Remains : 147/2385 places, 226/11934 transitions.
Support contains 8 out of 147 places after structural reductions.
[2024-05-27 07:46:40] [INFO ] Flatten gal took : 46 ms
[2024-05-27 07:46:40] [INFO ] Flatten gal took : 20 ms
[2024-05-27 07:46:40] [INFO ] Input system was already deterministic with 226 transitions.
RANDOM walk for 40000 steps (6745 resets) in 1921 ms. (20 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40001 steps (1728 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
[2024-05-27 07:46:40] [INFO ] Invariant cache hit.
[2024-05-27 07:46:40] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 139/142 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 59/201 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 28/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/206 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 373/373 variables, and 164 constraints, problems are : Problem set: 1 solved, 0 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 15/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 57 stable transitions
Graph (complete) has 528 edges and 147 vertex of which 145 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 226/226 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 146 transition count 225
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 140 transition count 219
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 140 transition count 219
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 19 place count 140 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 138 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 138 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 138 transition count 199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 137 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 137 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 136 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 136 transition count 185
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 32 place count 132 transition count 181
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 132 transition count 181
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 44 place count 132 transition count 173
Applied a total of 44 rules in 16 ms. Remains 132 /147 variables (removed 15) and now considering 173/226 (removed 53) transitions.
// Phase 1: matrix 173 rows 132 cols
[2024-05-27 07:46:41] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:46:41] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-27 07:46:41] [INFO ] Invariant cache hit.
[2024-05-27 07:46:41] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-27 07:46:41] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-27 07:46:41] [INFO ] Invariant cache hit.
[2024-05-27 07:46:41] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 173/305 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 198 constraints, problems are : Problem set: 0 solved, 172 unsolved in 4701 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 173/305 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 172/370 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 0/305 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 370 constraints, problems are : Problem set: 0 solved, 172 unsolved in 9406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
After SMT, in 14360ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 14364ms
Starting structural reductions in LTL mode, iteration 1 : 132/147 places, 173/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14668 ms. Remains : 132/147 places, 173/226 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 287 ms.
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Computed a total of 7 stabilizing places and 35 stable transitions
Graph (complete) has 449 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 35 stable transitions
Detected a total of 7/132 stabilizing places and 35/173 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLCardinality-01 finished in 15486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 226/226 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 146 transition count 225
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 143 transition count 222
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 143 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 11 place count 143 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 142 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 142 transition count 206
Applied a total of 13 rules in 6 ms. Remains 142 /147 variables (removed 5) and now considering 206/226 (removed 20) transitions.
// Phase 1: matrix 206 rows 142 cols
[2024-05-27 07:46:56] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:46:56] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 07:46:56] [INFO ] Invariant cache hit.
[2024-05-27 07:46:56] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-27 07:46:56] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-05-27 07:46:56] [INFO ] Invariant cache hit.
[2024-05-27 07:46:56] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/348 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 88/232 constraints. Problems are: Problem set: 0 solved, 205 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 232 constraints, problems are : Problem set: 0 solved, 205 unsolved in 5995 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/348 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 88/232 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 205/437 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/348 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 437 constraints, problems are : Problem set: 0 solved, 205 unsolved in 11996 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 18261ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 18265ms
Starting structural reductions in LTL mode, iteration 1 : 142/147 places, 206/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18622 ms. Remains : 142/147 places, 206/226 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 260 steps with 47 reset in 3 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLCardinality-07 finished in 18803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 226/226 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 141 transition count 220
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 141 transition count 220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 141 transition count 215
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 138 transition count 188
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 138 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 138 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 137 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 137 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 137 transition count 185
Applied a total of 27 rules in 28 ms. Remains 137 /147 variables (removed 10) and now considering 185/226 (removed 41) transitions.
// Phase 1: matrix 185 rows 137 cols
[2024-05-27 07:47:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:47:15] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-27 07:47:15] [INFO ] Invariant cache hit.
[2024-05-27 07:47:15] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 07:47:15] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-27 07:47:15] [INFO ] Redundant transitions in 8 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-27 07:47:15] [INFO ] Invariant cache hit.
[2024-05-27 07:47:15] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/321 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 71/209 constraints. Problems are: Problem set: 0 solved, 184 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 1/322 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 210 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7743 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/321 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 71/209 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 39/248 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 1/322 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 145/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 0/322 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 394 constraints, problems are : Problem set: 0 solved, 184 unsolved in 13063 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 21052ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 21054ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/147 places, 185/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21409 ms. Remains : 137/147 places, 185/226 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLCardinality-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLCardinality-13 finished in 21479 ms.
All properties solved by simple procedures.
Total runtime 100351 ms.

BK_STOP 1716796056835

--------------------
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:
++ 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.202405141337.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="RingSingleMessageInMbox-PT-d1m020"
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 RingSingleMessageInMbox-PT-d1m020, 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 r334-tall-171679079500075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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