fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037990300619
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BART-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1840.852 78248.00 97326.00 472.10 FFFFFFFTFFFTFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037990300619.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-PT-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990300619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 43M
-rw-r--r-- 1 mcc users 2.2M Jun 13 08:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Jun 13 08:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7M Jun 13 08:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 22M Jun 13 08:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 20 13:27 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 20 13:27 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 8 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jun 8 09:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Jun 8 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 8 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 8 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 8 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 20 13:27 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 20 13:27 instance
-rw-r--r-- 1 mcc users 6 Mar 20 13:27 iscolored
-rw-r--r-- 1 mcc users 4.8M Mar 20 13:27 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 BART-PT-020-CTLCardinality-00
FORMULA_NAME BART-PT-020-CTLCardinality-01
FORMULA_NAME BART-PT-020-CTLCardinality-02
FORMULA_NAME BART-PT-020-CTLCardinality-03
FORMULA_NAME BART-PT-020-CTLCardinality-04
FORMULA_NAME BART-PT-020-CTLCardinality-05
FORMULA_NAME BART-PT-020-CTLCardinality-06
FORMULA_NAME BART-PT-020-CTLCardinality-07
FORMULA_NAME BART-PT-020-CTLCardinality-08
FORMULA_NAME BART-PT-020-CTLCardinality-09
FORMULA_NAME BART-PT-020-CTLCardinality-10
FORMULA_NAME BART-PT-020-CTLCardinality-11
FORMULA_NAME BART-PT-020-CTLCardinality-12
FORMULA_NAME BART-PT-020-CTLCardinality-13
FORMULA_NAME BART-PT-020-CTLCardinality-14
FORMULA_NAME BART-PT-020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1623578704766

Running Version 0
[2021-06-13 10:05:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-13 10:05:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-13 10:05:06] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2021-06-13 10:05:06] [INFO ] Transformed 2850 places.
[2021-06-13 10:05:06] [INFO ] Transformed 4040 transitions.
[2021-06-13 10:05:06] [INFO ] Found NUPN structural information;
[2021-06-13 10:05:06] [INFO ] Parsed PT model containing 2850 places and 4040 transitions in 382 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 972 ms.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-020-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 466 out of 2640 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 440 places :
Symmetric choice reduction at 0 with 440 rule applications. Total rules 440 place count 2200 transition count 3600
Iterating global reduction 0 with 440 rules applied. Total rules applied 880 place count 2200 transition count 3600
Discarding 283 places :
Symmetric choice reduction at 0 with 283 rule applications. Total rules 1163 place count 1917 transition count 3317
Iterating global reduction 0 with 283 rules applied. Total rules applied 1446 place count 1917 transition count 3317
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 1487 place count 1876 transition count 3276
Iterating global reduction 0 with 41 rules applied. Total rules applied 1528 place count 1876 transition count 3276
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 1554 place count 1850 transition count 3250
Iterating global reduction 0 with 26 rules applied. Total rules applied 1580 place count 1850 transition count 3250
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 1602 place count 1828 transition count 3228
Iterating global reduction 0 with 22 rules applied. Total rules applied 1624 place count 1828 transition count 3228
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 1639 place count 1813 transition count 3213
Iterating global reduction 0 with 15 rules applied. Total rules applied 1654 place count 1813 transition count 3213
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1664 place count 1803 transition count 3203
Iterating global reduction 0 with 10 rules applied. Total rules applied 1674 place count 1803 transition count 3203
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 1681 place count 1796 transition count 3196
Iterating global reduction 0 with 7 rules applied. Total rules applied 1688 place count 1796 transition count 3196
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 1693 place count 1791 transition count 3191
Iterating global reduction 0 with 5 rules applied. Total rules applied 1698 place count 1791 transition count 3191
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1700 place count 1789 transition count 3189
Iterating global reduction 0 with 2 rules applied. Total rules applied 1702 place count 1789 transition count 3189
Applied a total of 1702 rules in 1136 ms. Remains 1789 /2640 variables (removed 851) and now considering 3189/4040 (removed 851) transitions.
// Phase 1: matrix 3189 rows 1789 cols
[2021-06-13 10:05:09] [INFO ] Computed 20 place invariants in 42 ms
[2021-06-13 10:05:09] [INFO ] Implicit Places using invariants in 362 ms returned []
// Phase 1: matrix 3189 rows 1789 cols
[2021-06-13 10:05:09] [INFO ] Computed 20 place invariants in 20 ms
[2021-06-13 10:05:10] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
// Phase 1: matrix 3189 rows 1789 cols
[2021-06-13 10:05:10] [INFO ] Computed 20 place invariants in 24 ms
[2021-06-13 10:05:11] [INFO ] Dead Transitions using invariants and state equation in 1264 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1789/2640 places, 3189/4040 transitions.
[2021-06-13 10:05:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-06-13 10:05:12] [INFO ] Flatten gal took : 171 ms
[2021-06-13 10:05:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BART-PT-020-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-13 10:05:12] [INFO ] Flatten gal took : 108 ms
[2021-06-13 10:05:12] [INFO ] Input system was already deterministic with 3189 transitions.
FORMULA BART-PT-020-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1049 ms. (steps per millisecond=95 ) properties (out of 47) seen :18
Running SMT prover for 29 properties.
// Phase 1: matrix 3189 rows 1789 cols
[2021-06-13 10:05:13] [INFO ] Computed 20 place invariants in 17 ms
[2021-06-13 10:05:14] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2021-06-13 10:05:14] [INFO ] SMT Verify possible in real domain returnedunsat :13 sat :0 real:16
[2021-06-13 10:05:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2021-06-13 10:05:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-13 10:05:16] [INFO ] [Nat]Absence check using state equation in 901 ms returned unsat :15 sat :14
Attempting to minimize the solution found.
Minimization took 87 ms.
[2021-06-13 10:05:16] [INFO ] SMT Verify possible in nat domain returned unsat :15 sat :14
Successfully simplified 28 atomic propositions for a total of 8 simplifications.
[2021-06-13 10:05:16] [INFO ] Initial state test concluded for 2 properties.
FORMULA BART-PT-020-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Graph (trivial) has 3084 edges and 1789 vertex of which 1498 / 1789 are part of one of the 18 SCC in 8 ms
Free SCC test removed 1480 places
Ensure Unique test removed 2669 transitions
Reduce isomorphic transitions removed 2669 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 305 transition count 422
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 114 rules applied. Total rules applied 213 place count 210 transition count 403
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 221 place count 205 transition count 400
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 224 place count 204 transition count 398
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 227 place count 203 transition count 396
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 6 rules applied. Total rules applied 233 place count 202 transition count 391
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 241 place count 197 transition count 388
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 241 place count 197 transition count 382
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 253 place count 191 transition count 382
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 266 place count 178 transition count 369
Iterating global reduction 7 with 13 rules applied. Total rules applied 279 place count 178 transition count 369
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 284 place count 178 transition count 364
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 288 place count 174 transition count 360
Iterating global reduction 8 with 4 rules applied. Total rules applied 292 place count 174 transition count 360
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 295 place count 171 transition count 357
Iterating global reduction 8 with 3 rules applied. Total rules applied 298 place count 171 transition count 357
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 299 place count 170 transition count 356
Iterating global reduction 8 with 1 rules applied. Total rules applied 300 place count 170 transition count 356
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 301 place count 169 transition count 355
Iterating global reduction 8 with 1 rules applied. Total rules applied 302 place count 169 transition count 355
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 303 place count 168 transition count 354
Iterating global reduction 8 with 1 rules applied. Total rules applied 304 place count 168 transition count 354
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 346 place count 147 transition count 333
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 358 place count 147 transition count 321
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 366 place count 143 transition count 317
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 374 place count 143 transition count 309
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 382 place count 139 transition count 305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 390 place count 139 transition count 297
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 398 place count 135 transition count 293
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 405 place count 135 transition count 286
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 413 place count 131 transition count 282
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 421 place count 131 transition count 274
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 429 place count 127 transition count 270
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 437 place count 127 transition count 262
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 445 place count 123 transition count 258
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 453 place count 123 transition count 250
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 461 place count 119 transition count 246
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 469 place count 119 transition count 238
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 477 place count 115 transition count 234
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 485 place count 115 transition count 226
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 493 place count 111 transition count 222
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 501 place count 111 transition count 214
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 509 place count 107 transition count 210
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 517 place count 107 transition count 202
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 19 with 6 rules applied. Total rules applied 523 place count 104 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 529 place count 104 transition count 193
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 20 with 6 rules applied. Total rules applied 535 place count 101 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 541 place count 101 transition count 184
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 21 with 6 rules applied. Total rules applied 547 place count 98 transition count 181
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 553 place count 98 transition count 175
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 22 with 6 rules applied. Total rules applied 559 place count 95 transition count 172
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 565 place count 95 transition count 166
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 23 with 6 rules applied. Total rules applied 571 place count 92 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 577 place count 92 transition count 157
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 24 with 6 rules applied. Total rules applied 583 place count 89 transition count 154
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 589 place count 89 transition count 148
Performed 3 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 25 with 6 rules applied. Total rules applied 595 place count 86 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 599 place count 86 transition count 140
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 26 with 2 rules applied. Total rules applied 601 place count 85 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 603 place count 85 transition count 137
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 27 with 2 rules applied. Total rules applied 605 place count 84 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 607 place count 84 transition count 134
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 28 with 2 rules applied. Total rules applied 609 place count 83 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 611 place count 83 transition count 131
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 29 with 2 rules applied. Total rules applied 613 place count 82 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 614 place count 82 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 616 place count 81 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 617 place count 81 transition count 128
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 31 with 16 rules applied. Total rules applied 633 place count 81 transition count 112
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 2 Pre rules applied. Total rules applied 633 place count 81 transition count 110
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 31 with 4 rules applied. Total rules applied 637 place count 79 transition count 110
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 31 with 3 rules applied. Total rules applied 640 place count 79 transition count 110
Applied a total of 640 rules in 154 ms. Remains 79 /1789 variables (removed 1710) and now considering 110/3189 (removed 3079) transitions.
[2021-06-13 10:05:16] [INFO ] Flatten gal took : 3 ms
[2021-06-13 10:05:16] [INFO ] Flatten gal took : 3 ms
[2021-06-13 10:05:16] [INFO ] Input system was already deterministic with 110 transitions.
[2021-06-13 10:05:16] [INFO ] Flatten gal took : 3 ms
[2021-06-13 10:05:16] [INFO ] Flatten gal took : 2 ms
[2021-06-13 10:05:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality11985271459371493175.gal : 2 ms
[2021-06-13 10:05:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15010479112645117923.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality11985271459371493175.gal, -t, CGAL, -ctl, /tmp/CTLCardinality15010479112645117923.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality11985271459371493175.gal -t CGAL -ctl /tmp/CTLCardinality15010479112645117923.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88117e+10,0.020192,4676,2,185,5,969,5,0,427,647,0


Converting to forward existential form...Done !
original formula: EF(!(AF(((!(AG(((((((((((TrainState_1_2_26+TrainState_11_4_20)+TrainState_13_2_11)+TrainState_20_1_9)+TrainState_17_4_22)+TrainState_2_3_36)+TrainState_3_1_38)+TrainState_17_1_36)+TrainState_13_3_8)+TrainState_8_2_34)<=((TrainState_5_1_37+TrainState_6_4_29)+TrainState_9_1_1)))) + (((TrainState_2_2_31+TrainState_9_3_25)+TrainState_18_4_31)>(((((((((TrainState_18_1_1+TrainState_1_3_25)+TrainState_4_3_14)+TrainState_17_3_34)+TrainState_2_1_13)+TrainState_20_2_12)+TrainState_11_4_32)+TrainState_7_4_27)+TrainState_9_1_28)+TrainState_4_1_21))) + (((((((1+TrainState_3_3_21)+TrainState_9_3_24)+TrainState_6_2_32)+TrainState_2_1_25)+TrainState_14_2_25)+TrainState_6_3_26)>((((((((TrainState_3_3_20+TrainState_3_2_23)+TrainState_5_2_22)+TrainState_13_1_29)+TrainState_13_3_11)+TrainState_2_2_32)+TrainState_2_3_9)+TrainState_8_2_5)+TrainState_16_4_23))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(!(E(TRUE U !(((((((((((TrainState_1_2_26+TrainState_11_4_20)+TrainState_13_2_11)+TrainState_20_1_9)+TrainState_17_4_22)+TrainState_2_3_36)+TrainState_3_1_38)+TrainState_17_1_36)+TrainState_13_3_8)+TrainState_8_2_34)<=((TrainState_5_1_37+TrainState_6_4_29)+TrainState_9_1_1)))))) + (((TrainState_2_2_31+TrainState_9_3_25)+TrainState_18_4_31)>(((((((((TrainState_18_1_1+TrainState_1_3_25)+TrainState_4_3_14)+TrainState_17_3_34)+TrainState_2_1_13)+TrainState_20_2_12)+TrainState_11_4_32)+TrainState_7_4_27)+TrainState_9_1_28)+TrainState_4_1_21))) + (((((((1+TrainState_3_3_21)+TrainState_9_3_24)+TrainState_6_2_32)+TrainState_2_1_25)+TrainState_14_2_25)+TrainState_6_3_26)>((((((((TrainState_3_3_20+TrainState_3_2_23)+TrainState_5_2_22)+TrainState_13_1_29)+TrainState_13_3_11)+TrainState_2_2_32)+TrainState_2_3_9)+TrainState_8_2_5)+TrainState_16_4_23)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.090966,6976,1,0,8,10735,21,2,2895,3897,9
FORMULA BART-PT-020-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2021-06-13 10:05:16] [INFO ] Flatten gal took : 71 ms
[2021-06-13 10:05:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BART-PT-020-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-13 10:05:17] [INFO ] Flatten gal took : 72 ms
[2021-06-13 10:05:17] [INFO ] Applying decomposition
[2021-06-13 10:05:17] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8058459322942807732.txt, -o, /tmp/graph8058459322942807732.bin, -w, /tmp/graph8058459322942807732.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8058459322942807732.bin, -l, -1, -v, -w, /tmp/graph8058459322942807732.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-13 10:05:17] [INFO ] Decomposing Gal with order
[2021-06-13 10:05:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-13 10:05:17] [INFO ] Removed a total of 1488 redundant transitions.
[2021-06-13 10:05:17] [INFO ] Flatten gal took : 194 ms
[2021-06-13 10:05:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 76 ms.
[2021-06-13 10:05:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality6667969714315240235.gal : 31 ms
[2021-06-13 10:05:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality6393462742525325820.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality6667969714315240235.gal, -t, CGAL, -ctl, /tmp/CTLCardinality6393462742525325820.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality6667969714315240235.gal -t CGAL -ctl /tmp/CTLCardinality6393462742525325820.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.92901e+38,4.89344,79956,2,8105,5,255283,6,0,10332,203360,0


Converting to forward existential form...Done !
original formula: !(EX(TRUE))
=> equivalent forward existential formula: [(EY(Init) * TRUE)] = FALSE
(forward)formula 0,0,7.22055,79956,1,0,6,255283,7,1,12808,203360,1
FORMULA BART-PT-020-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (AX(FALSE) + !(EG((!(E(((((((((gi10.gu404.TrainState_8_4_33+1)+gi10.gu404.TrainState_2_3_25)+gi10.gu404.TrainState_3_4_17)+gi10.gu404.TrainState_7_1_7)+1)+gi10.gu404.TrainState_10_1_30)<=3)&&((gi8.gu334.TrainState_14_4_15==0)||(gi8.gu334.TrainState_14_4_15==1))) U (gi19.gu107.TrainState_17_3_10<=((((gi19.gu107.TrainState_18_3_32+gi19.gu107.TrainState_6_2_6)+gi19.gu107.TrainState_2_1_21)+gi19.gu107.TrainState_13_4_11)+gi19.gu107.TrainState_7_2_38)))) + !(AG(((((((((((gu106.TrainState_13_4_32+1)+gu106.TrainState_17_3_24)+gu106.TrainState_13_3_10)+gu106.TrainState_3_3_12)+gu106.TrainState_11_4_29)+gu106.TrainState_1_1_3)+gu106.TrainState_5_1_6)+gu106.TrainState_4_3_24)+gu106.TrainState_18_2_27)>(((((((gu106.TrainState_7_1_34+gu106.TrainState_17_1_13)+gu106.TrainState_1_1_11)+gu106.TrainState_18_3_28)+gu106.TrainState_1_4_17)+gu106.TrainState_4_3_37)+gu106.TrainState_9_1_22)+gu106.TrainState_1_2_33))))))))
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(FALSE))))),(!(E(((((((((gi10.gu404.TrainState_8_4_33+1)+gi10.gu404.TrainState_2_3_25)+gi10.gu404.TrainState_3_4_17)+gi10.gu404.TrainState_7_1_7)+1)+gi10.gu404.TrainState_10_1_30)<=3)&&((gi8.gu334.TrainState_14_4_15==0)||(gi8.gu334.TrainState_14_4_15==1))) U (gi19.gu107.TrainState_17_3_10<=((((gi19.gu107.TrainState_18_3_32+gi19.gu107.TrainState_6_2_6)+gi19.gu107.TrainState_2_1_21)+gi19.gu107.TrainState_13_4_11)+gi19.gu107.TrainState_7_2_38)))) + !(!(E(TRUE U !(((((((((((gu106.TrainState_13_4_32+1)+gu106.TrainState_17_3_24)+gu106.TrainState_13_3_10)+gu106.TrainState_3_3_12)+gu106.TrainState_11_4_29)+gu106.TrainState_1_1_3)+gu106.TrainState_5_1_6)+gu106.TrainState_4_3_24)+gu106.TrainState_18_2_27)>(((((((gu106.TrainState_7_1_34+gu106.TrainState_17_1_13)+gu106.TrainState_1_1_11)+gu106.TrainState_18_3_28)+gu106.TrainState_1_4_17)+gu106.TrainState_4_3_37)+gu106.TrainState_9_1_22)+gu106.TrainState_1_2_33))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 3112/4/16
(forward)formula 1,0,61.2587,1219172,1,0,11,8.00164e+06,27,4,52275,573590,15
FORMULA BART-PT-020-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: !(EX(TRUE))
=> equivalent forward existential formula: [(EY(Init) * TRUE)] = FALSE
(forward)formula 2,0,61.2592,1219172,1,0,11,8.00164e+06,27,4,52275,573590,15
FORMULA BART-PT-020-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AX((((AX(((((((((((gu89.TrainState_4_1_40+gu89.TrainState_3_2_25)+gu89.TrainState_15_2_13)+gu89.TrainState_4_2_19)+gu89.TrainState_15_2_35)+gu89.TrainState_3_2_17)+gu89.TrainState_14_1_15)+gu89.TrainState_12_2_6)+gu89.TrainState_4_3_9)<=10)&&(((gi15.gu101.TrainState_16_2_37+gi15.gu101.TrainState_6_0_0)+gi15.gu101.TrainState_10_3_30)<=((((((((gi15.gu101.TrainState_5_1_33+gi15.gu101.TrainState_16_1_5)+gi15.gu101.TrainState_17_1_36)+gi15.gu101.TrainState_16_4_26)+gi15.gu101.TrainState_16_1_13)+gi15.gu101.TrainState_8_2_13)+gi15.gu101.TrainState_9_1_14)+gi15.gu101.TrainState_18_2_10)+gi15.gu101.TrainState_2_3_29)))) + (((((gu27.TrainState_20_1_37+gu27.TrainState_1_3_10)+gu27.TrainState_6_2_38)+gu27.TrainState_8_1_4)+1)>(((((((gu27.TrainState_1_3_7+gu27.TrainState_5_3_35)+gu27.TrainState_15_1_27)+gu117.TrainState_15_2_27)+gu27.TrainState_6_3_15)+gu27.TrainState_6_2_5)+gu27.TrainState_15_3_14)+gu27.TrainState_9_2_8))) + ((gi23.gi0.gi0.gi0.gu320.TrainState_19_1_22+gi23.gi0.gi0.gi0.gu320.TrainState_13_1_38)>=42)) + (((gi16.gi0.gu454.TrainState_6_2_37+gi16.gi0.gu454.TrainState_7_3_27)+1)>=33)))
=> equivalent forward existential formula: [(EY((((EY(Init) * !((((gi16.gi0.gu454.TrainState_6_2_37+gi16.gi0.gu454.TrainState_7_3_27)+1)>=33))) * !(((gi23.gi0.gi0.gi0.gu320.TrainState_19_1_22+gi23.gi0.gi0.gi0.gu320.TrainState_13_1_38)>=42))) * !((((((gu27.TrainState_20_1_37+gu27.TrainState_1_3_10)+gu27.TrainState_6_2_38)+gu27.TrainState_8_1_4)+1)>(((((((gu27.TrainState_1_3_7+gu27.TrainState_5_3_35)+gu27.TrainState_15_1_27)+gu117.TrainState_15_2_27)+gu27.TrainState_6_3_15)+gu27.TrainState_6_2_5)+gu27.TrainState_15_3_14)+gu27.TrainState_9_2_8))))) * !(((((((((((gu89.TrainState_4_1_40+gu89.TrainState_3_2_25)+gu89.TrainState_15_2_13)+gu89.TrainState_4_2_19)+gu89.TrainState_15_2_35)+gu89.TrainState_3_2_17)+gu89.TrainState_14_1_15)+gu89.TrainState_12_2_6)+gu89.TrainState_4_3_9)<=10)&&(((gi15.gu101.TrainState_16_2_37+gi15.gu101.TrainState_6_0_0)+gi15.gu101.TrainState_10_3_30)<=((((((((gi15.gu101.TrainState_5_1_33+gi15.gu101.TrainState_16_1_5)+gi15.gu101.TrainState_17_1_36)+gi15.gu101.TrainState_16_4_26)+gi15.gu101.TrainState_16_1_13)+gi15.gu101.TrainState_8_2_13)+gi15.gu101.TrainState_9_1_14)+gi15.gu101.TrainState_18_2_10)+gi15.gu101.TrainState_2_3_29)))))] = FALSE
(forward)formula 3,0,62.8294,1254812,1,0,19,8.10119e+06,35,8,52849,671342,20
FORMULA BART-PT-020-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(!(EX(EF(((((((gu117.TrainState_15_4_11+gu117.TrainState_12_1_20)+1)+gu117.TrainState_17_3_9)+gu117.TrainState_6_2_22)+gu117.TrainState_20_3_18)<=(((((((((gu117.TrainState_14_2_6+gu117.TrainState_13_1_21)+gu117.TrainState_16_2_15)+1)+gu117.TrainState_1_1_19)+gu117.TrainState_15_2_27)+gu117.TrainState_17_4_24)+gu117.TrainState_18_1_21)+gu117.TrainState_7_2_11)+gu117.TrainState_17_4_30))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(E(TRUE U ((((((gu117.TrainState_15_4_11+gu117.TrainState_12_1_20)+1)+gu117.TrainState_17_3_9)+gu117.TrainState_6_2_22)+gu117.TrainState_20_3_18)<=(((((((((gu117.TrainState_14_2_6+gu117.TrainState_13_1_21)+gu117.TrainState_16_2_15)+1)+gu117.TrainState_1_1_19)+gu117.TrainState_15_2_27)+gu117.TrainState_17_4_24)+gu117.TrainState_18_1_21)+gu117.TrainState_7_2_11)+gu117.TrainState_17_4_30)))))))] = FALSE
(forward)formula 4,0,63.4682,1272236,1,0,20,8.13423e+06,36,8,53382,671841,23
FORMULA BART-PT-020-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************


BK_STOP 1623578783014

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="BART-PT-020"
export BK_EXAMINATION="CTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is BART-PT-020, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037990300619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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