Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025300526.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 ShieldPPPs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.1K Apr 30 03:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 30 03:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 03:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 03:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 30 03:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 30 03:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 30 03:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 30 03:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.8M May 10 09:34 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 ShieldPPPs-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654273261646

Running Version 202205111006
[2022-06-03 16:21:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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]
[2022-06-03 16:21:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 16:21:03] [INFO ] Load time of PNML (sax parser for PT used): 450 ms
[2022-06-03 16:21:03] [INFO ] Transformed 6803 places.
[2022-06-03 16:21:03] [INFO ] Transformed 6303 transitions.
[2022-06-03 16:21:03] [INFO ] Found NUPN structural information;
[2022-06-03 16:21:03] [INFO ] Parsed PT model containing 6803 places and 6303 transitions in 889 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=14 ) properties (out of 14) seen :3
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 6303 rows 6803 cols
[2022-06-03 16:21:05] [INFO ] Computed 1101 place invariants in 96 ms
[2022-06-03 16:21:07] [INFO ] After 2297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-03 16:21:09] [INFO ] [Nat]Absence check using 1101 positive place invariants in 779 ms returned sat
[2022-06-03 16:21:28] [INFO ] After 18448ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2022-06-03 16:21:32] [INFO ] After 22165ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-03 16:21:32] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 5 different solutions.
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 36925 ms.
Support contains 109 out of 6803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Drop transitions removed 661 transitions
Trivial Post-agglo rules discarded 661 transitions
Performed 661 trivial Post agglomeration. Transition count delta: 661
Iterating post reduction 0 with 661 rules applied. Total rules applied 661 place count 6803 transition count 5642
Reduce places removed 661 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 674 rules applied. Total rules applied 1335 place count 6142 transition count 5629
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1348 place count 6129 transition count 5629
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 501 Pre rules applied. Total rules applied 1348 place count 6129 transition count 5128
Deduced a syphon composed of 501 places in 25 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 2350 place count 5628 transition count 5128
Discarding 672 places :
Symmetric choice reduction at 3 with 672 rule applications. Total rules 3022 place count 4956 transition count 4456
Iterating global reduction 3 with 672 rules applied. Total rules applied 3694 place count 4956 transition count 4456
Performed 280 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 280 Pre rules applied. Total rules applied 3694 place count 4956 transition count 4176
Deduced a syphon composed of 280 places in 21 ms
Reduce places removed 280 places and 0 transitions.
Iterating global reduction 3 with 560 rules applied. Total rules applied 4254 place count 4676 transition count 4176
Performed 1450 Post agglomeration using F-continuation condition.Transition count delta: 1450
Deduced a syphon composed of 1450 places in 8 ms
Reduce places removed 1450 places and 0 transitions.
Iterating global reduction 3 with 2900 rules applied. Total rules applied 7154 place count 3226 transition count 2726
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 866 times.
Drop transitions removed 866 transitions
Iterating global reduction 3 with 866 rules applied. Total rules applied 8020 place count 3226 transition count 2726
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8021 place count 3225 transition count 2725
Applied a total of 8021 rules in 2951 ms. Remains 3225 /6803 variables (removed 3578) and now considering 2725/6303 (removed 3578) transitions.
Finished structural reductions, in 1 iterations. Remains : 3225/6803 places, 2725/6303 transitions.
Incomplete random walk after 1000000 steps, including 59 resets, run finished after 22781 ms. (steps per millisecond=43 ) properties (out of 3) seen :2
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 353914 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=70 ) properties seen 0
Running SMT prover for 1 properties.
// Phase 1: matrix 2725 rows 3225 cols
[2022-06-03 16:22:40] [INFO ] Computed 1101 place invariants in 197 ms
[2022-06-03 16:22:40] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 16:22:41] [INFO ] [Nat]Absence check using 1049 positive place invariants in 238 ms returned sat
[2022-06-03 16:22:41] [INFO ] [Nat]Absence check using 1049 positive and 52 generalized place invariants in 13 ms returned sat
[2022-06-03 16:22:43] [INFO ] After 2260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 16:22:44] [INFO ] Deduced a trap composed of 4 places in 547 ms of which 10 ms to minimize.
[2022-06-03 16:22:45] [INFO ] Deduced a trap composed of 6 places in 502 ms of which 3 ms to minimize.
[2022-06-03 16:22:45] [INFO ] Deduced a trap composed of 5 places in 514 ms of which 7 ms to minimize.
[2022-06-03 16:22:46] [INFO ] Deduced a trap composed of 9 places in 461 ms of which 2 ms to minimize.
[2022-06-03 16:22:47] [INFO ] Deduced a trap composed of 7 places in 480 ms of which 2 ms to minimize.
[2022-06-03 16:22:47] [INFO ] Deduced a trap composed of 5 places in 449 ms of which 1 ms to minimize.
[2022-06-03 16:22:48] [INFO ] Deduced a trap composed of 11 places in 477 ms of which 2 ms to minimize.
[2022-06-03 16:22:49] [INFO ] Deduced a trap composed of 4 places in 515 ms of which 1 ms to minimize.
[2022-06-03 16:22:50] [INFO ] Deduced a trap composed of 6 places in 547 ms of which 1 ms to minimize.
[2022-06-03 16:22:50] [INFO ] Deduced a trap composed of 8 places in 515 ms of which 1 ms to minimize.
[2022-06-03 16:22:51] [INFO ] Deduced a trap composed of 4 places in 547 ms of which 1 ms to minimize.
[2022-06-03 16:22:52] [INFO ] Deduced a trap composed of 8 places in 450 ms of which 1 ms to minimize.
[2022-06-03 16:22:52] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 1 ms to minimize.
[2022-06-03 16:22:53] [INFO ] Deduced a trap composed of 8 places in 428 ms of which 1 ms to minimize.
[2022-06-03 16:22:53] [INFO ] Deduced a trap composed of 11 places in 478 ms of which 1 ms to minimize.
[2022-06-03 16:22:54] [INFO ] Deduced a trap composed of 7 places in 430 ms of which 1 ms to minimize.
[2022-06-03 16:22:54] [INFO ] Deduced a trap composed of 9 places in 424 ms of which 1 ms to minimize.
[2022-06-03 16:22:55] [INFO ] Deduced a trap composed of 11 places in 393 ms of which 1 ms to minimize.
[2022-06-03 16:22:55] [INFO ] Deduced a trap composed of 10 places in 386 ms of which 1 ms to minimize.
[2022-06-03 16:22:56] [INFO ] Deduced a trap composed of 9 places in 380 ms of which 3 ms to minimize.
[2022-06-03 16:22:56] [INFO ] Deduced a trap composed of 12 places in 392 ms of which 1 ms to minimize.
[2022-06-03 16:22:57] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 1 ms to minimize.
[2022-06-03 16:22:57] [INFO ] Deduced a trap composed of 14 places in 377 ms of which 1 ms to minimize.
[2022-06-03 16:22:58] [INFO ] Deduced a trap composed of 11 places in 377 ms of which 1 ms to minimize.
[2022-06-03 16:22:58] [INFO ] Deduced a trap composed of 14 places in 384 ms of which 1 ms to minimize.
[2022-06-03 16:22:59] [INFO ] Deduced a trap composed of 12 places in 365 ms of which 1 ms to minimize.
[2022-06-03 16:22:59] [INFO ] Deduced a trap composed of 12 places in 341 ms of which 1 ms to minimize.
[2022-06-03 16:23:00] [INFO ] Deduced a trap composed of 16 places in 369 ms of which 1 ms to minimize.
[2022-06-03 16:23:00] [INFO ] Deduced a trap composed of 11 places in 351 ms of which 1 ms to minimize.
[2022-06-03 16:23:01] [INFO ] Deduced a trap composed of 11 places in 314 ms of which 1 ms to minimize.
[2022-06-03 16:23:01] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 1 ms to minimize.
[2022-06-03 16:23:01] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2022-06-03 16:23:02] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 0 ms to minimize.
[2022-06-03 16:23:02] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2022-06-03 16:23:02] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 1 ms to minimize.
[2022-06-03 16:23:03] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 1 ms to minimize.
[2022-06-03 16:23:03] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 1 ms to minimize.
[2022-06-03 16:23:03] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 0 ms to minimize.
[2022-06-03 16:23:04] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 1 ms to minimize.
[2022-06-03 16:23:04] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 1 ms to minimize.
[2022-06-03 16:23:04] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 1 ms to minimize.
[2022-06-03 16:23:05] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2022-06-03 16:23:05] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 0 ms to minimize.
[2022-06-03 16:23:05] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2022-06-03 16:23:05] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2022-06-03 16:23:06] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2022-06-03 16:23:06] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 0 ms to minimize.
[2022-06-03 16:23:06] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2022-06-03 16:23:06] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2022-06-03 16:23:07] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 0 ms to minimize.
[2022-06-03 16:23:07] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2022-06-03 16:23:07] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2022-06-03 16:23:07] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 23942 ms
[2022-06-03 16:23:08] [INFO ] After 26457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 339 ms.
[2022-06-03 16:23:08] [INFO ] After 27421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3918 ms.
Support contains 40 out of 3225 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3225/3225 places, 2725/2725 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 3225 transition count 2712
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 3212 transition count 2712
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 26 place count 3212 transition count 2707
Deduced a syphon composed of 5 places in 11 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 3207 transition count 2707
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 10 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 148 place count 3151 transition count 2651
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 3150 transition count 2650
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 159 place count 3150 transition count 2650
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 164 place count 3145 transition count 2645
Applied a total of 164 rules in 864 ms. Remains 3145 /3225 variables (removed 80) and now considering 2645/2725 (removed 80) transitions.
Finished structural reductions, in 1 iterations. Remains : 3145/3225 places, 2645/2725 transitions.
Incomplete random walk after 1000000 steps, including 45 resets, run finished after 23291 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 352725 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=70 ) properties seen 0
Probabilistic random walk exhausted memory after 1093445 steps, saw 1032719 distinct states, run finished after 41633 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2645 rows 3145 cols
[2022-06-03 16:24:23] [INFO ] Computed 1101 place invariants in 27 ms
[2022-06-03 16:24:23] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 16:24:24] [INFO ] [Nat]Absence check using 1055 positive place invariants in 235 ms returned sat
[2022-06-03 16:24:24] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 16 ms returned sat
[2022-06-03 16:24:31] [INFO ] After 6958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 16:24:40] [INFO ] After 15996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-03 16:24:40] [INFO ] After 16652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10373 ms.
Support contains 40 out of 3145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3145/3145 places, 2645/2645 transitions.
Applied a total of 0 rules in 169 ms. Remains 3145 /3145 variables (removed 0) and now considering 2645/2645 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3145/3145 places, 2645/2645 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3145/3145 places, 2645/2645 transitions.
Applied a total of 0 rules in 157 ms. Remains 3145 /3145 variables (removed 0) and now considering 2645/2645 (removed 0) transitions.
// Phase 1: matrix 2645 rows 3145 cols
[2022-06-03 16:24:50] [INFO ] Computed 1101 place invariants in 29 ms
[2022-06-03 16:24:53] [INFO ] Implicit Places using invariants in 2413 ms returned []
// Phase 1: matrix 2645 rows 3145 cols
[2022-06-03 16:24:53] [INFO ] Computed 1101 place invariants in 25 ms
[2022-06-03 16:24:58] [INFO ] Implicit Places using invariants and state equation in 5365 ms returned []
Implicit Place search using SMT with State Equation took 7780 ms to find 0 implicit places.
[2022-06-03 16:24:58] [INFO ] Redundant transitions in 144 ms returned []
// Phase 1: matrix 2645 rows 3145 cols
[2022-06-03 16:24:58] [INFO ] Computed 1101 place invariants in 28 ms
[2022-06-03 16:25:00] [INFO ] Dead Transitions using invariants and state equation in 1929 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3145/3145 places, 2645/2645 transitions.
Incomplete random walk after 1000000 steps, including 45 resets, run finished after 24973 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 316224 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=63 ) properties seen 0
Probabilistic random walk exhausted memory after 1093632 steps, saw 1032896 distinct states, run finished after 43646 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2645 rows 3145 cols
[2022-06-03 16:26:14] [INFO ] Computed 1101 place invariants in 31 ms
[2022-06-03 16:26:14] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 16:26:15] [INFO ] [Nat]Absence check using 1055 positive place invariants in 205 ms returned sat
[2022-06-03 16:26:15] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 9 ms returned sat
[2022-06-03 16:26:22] [INFO ] After 7348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 16:26:31] [INFO ] After 16376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-03 16:26:31] [INFO ] After 16992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10149 ms.
Support contains 40 out of 3145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3145/3145 places, 2645/2645 transitions.
Applied a total of 0 rules in 197 ms. Remains 3145 /3145 variables (removed 0) and now considering 2645/2645 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3145/3145 places, 2645/2645 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3145/3145 places, 2645/2645 transitions.
Applied a total of 0 rules in 198 ms. Remains 3145 /3145 variables (removed 0) and now considering 2645/2645 (removed 0) transitions.
// Phase 1: matrix 2645 rows 3145 cols
[2022-06-03 16:26:42] [INFO ] Computed 1101 place invariants in 31 ms
[2022-06-03 16:26:44] [INFO ] Implicit Places using invariants in 2414 ms returned []
// Phase 1: matrix 2645 rows 3145 cols
[2022-06-03 16:26:44] [INFO ] Computed 1101 place invariants in 30 ms
[2022-06-03 16:26:50] [INFO ] Implicit Places using invariants and state equation in 5424 ms returned []
Implicit Place search using SMT with State Equation took 7842 ms to find 0 implicit places.
[2022-06-03 16:26:50] [INFO ] Redundant transitions in 132 ms returned []
// Phase 1: matrix 2645 rows 3145 cols
[2022-06-03 16:26:50] [INFO ] Computed 1101 place invariants in 30 ms
[2022-06-03 16:26:52] [INFO ] Dead Transitions using invariants and state equation in 1987 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3145/3145 places, 2645/2645 transitions.
Applied a total of 0 rules in 228 ms. Remains 3145 /3145 variables (removed 0) and now considering 2645/2645 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2645 rows 3145 cols
[2022-06-03 16:26:52] [INFO ] Computed 1101 place invariants in 28 ms
[2022-06-03 16:26:52] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 16:26:53] [INFO ] [Nat]Absence check using 1055 positive place invariants in 229 ms returned sat
[2022-06-03 16:26:53] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 10 ms returned sat
[2022-06-03 16:27:00] [INFO ] After 7367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 16:27:10] [INFO ] After 16393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-03 16:27:10] [INFO ] After 17034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-06-03 16:27:10] [INFO ] Flatten gal took : 404 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15199713325831602849
[2022-06-03 16:27:10] [INFO ] Too many transitions (2645) to apply POR reductions. Disabling POR matrices.
[2022-06-03 16:27:11] [INFO ] Applying decomposition
[2022-06-03 16:27:11] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15199713325831602849
Running compilation step : cd /tmp/ltsmin15199713325831602849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-03 16:27:11] [INFO ] Flatten gal took : 423 ms
[2022-06-03 16:27:11] [INFO ] Flatten gal took : 403 ms
[2022-06-03 16:27:11] [INFO ] Input system was already deterministic with 2645 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18264379372275897649.txt' '-o' '/tmp/graph18264379372275897649.bin' '-w' '/tmp/graph18264379372275897649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18264379372275897649.bin' '-l' '-1' '-v' '-w' '/tmp/graph18264379372275897649.weights' '-q' '0' '-e' '0.001'
[2022-06-03 16:27:11] [INFO ] Decomposing Gal with order
[2022-06-03 16:27:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 16:27:12] [INFO ] Ran tautology test, simplified 0 / 1 in 1489 ms.
[2022-06-03 16:27:13] [INFO ] Removed a total of 1345 redundant transitions.
[2022-06-03 16:27:13] [INFO ] BMC solution for property ShieldPPPs-PT-100B-ReachabilityCardinality-10(UNSAT) depth K=0 took 132 ms
[2022-06-03 16:27:13] [INFO ] BMC solution for property ShieldPPPs-PT-100B-ReachabilityCardinality-10(UNSAT) depth K=1 took 18 ms
[2022-06-03 16:27:13] [INFO ] Flatten gal took : 668 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 2645 rows 3145 cols
[2022-06-03 16:27:14] [INFO ] Computed 1101 place invariants in 48 ms
[2022-06-03 16:27:14] [INFO ] Computed 1101 place invariants in 50 ms
[2022-06-03 16:27:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 2234 labels/synchronizations in 1026 ms.
[2022-06-03 16:27:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12873692476122755458.gal : 77 ms
[2022-06-03 16:27:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5630007453677388099.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12873692476122755458.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5630007453677388099.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality5630007453677388099.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3 after 37
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :37 after 55
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :55 after 163
Compilation finished in 9196 ms.
Running link step : cd /tmp/ltsmin15199713325831602849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 112 ms.
Running LTSmin : cd /tmp/ltsmin15199713325831602849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT100BReachabilityCardinality10==true'
[2022-06-03 16:27:45] [INFO ] Proved 3145 variables to be positive in 31335 ms
[2022-06-03 16:27:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-100B-ReachabilityCardinality-10
[2022-06-03 16:27:49] [INFO ] KInduction solution for property ShieldPPPs-PT-100B-ReachabilityCardinality-10(SAT) depth K=0 took 3831 ms
[2022-06-03 16:28:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-100B-ReachabilityCardinality-10
[2022-06-03 16:28:40] [INFO ] KInduction solution for property ShieldPPPs-PT-100B-ReachabilityCardinality-10(SAT) depth K=1 took 51102 ms
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :163 after 1459
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1459 after 104977
[2022-06-03 16:31:28] [INFO ] BMC solution for property ShieldPPPs-PT-100B-ReachabilityCardinality-10(UNSAT) depth K=2 took 255324 ms
Detected timeout of ITS tools.
[2022-06-03 16:49:17] [INFO ] Applying decomposition
[2022-06-03 16:49:18] [INFO ] Flatten gal took : 535 ms
[2022-06-03 16:49:18] [INFO ] Decomposing Gal with order
[2022-06-03 16:49:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 16:49:21] [INFO ] Removed a total of 2224 redundant transitions.
[2022-06-03 16:49:21] [INFO ] Flatten gal took : 698 ms
[2022-06-03 16:49:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 3248 labels/synchronizations in 5373 ms.
[2022-06-03 16:49:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8725519444477854595.gal : 589 ms
[2022-06-03 16:49:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14862203449010096306.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8725519444477854595.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14862203449010096306.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality14862203449010096306.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 28
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :28 after 244
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :244 after 2188
[2022-06-03 16:54:09] [INFO ] BMC solution for property ShieldPPPs-PT-100B-ReachabilityCardinality-10(UNSAT) depth K=3 took 1360044 ms
ITS-tools command line returned an error code 137
[2022-06-03 17:08:56] [INFO ] Flatten gal took : 1551 ms
[2022-06-03 17:09:09] [INFO ] Input system was already deterministic with 2645 transitions.
[2022-06-03 17:09:09] [INFO ] Transformed 3145 places.
[2022-06-03 17:09:10] [INFO ] Transformed 2645 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-03 17:09:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10935128611242142699.gal : 29 ms
[2022-06-03 17:09:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15822923182560973544.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10935128611242142699.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15822923182560973544.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...366
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality15822923182560973544.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 35
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :35 after 161
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :161 after 311
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :311 after 2257
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2257 after 3775
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3775 after 27862
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :27862 after 3.23253e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.23253e+06 after 5.68637e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.68637e+06 after 8.63296e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.63296e+06 after 8.69786e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.69786e+09 after 1.64594e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.64594e+10 after 1.49179e+12
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.49179e+12 after 4.17856e+13
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :4.17856e+13 after 3.29106e+14
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :3.29106e+14 after 1.33615e+17
[2022-06-03 17:14:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-100B-ReachabilityCardinality-10
[2022-06-03 17:14:49] [INFO ] KInduction solution for property ShieldPPPs-PT-100B-ReachabilityCardinality-10(SAT) depth K=2 took 2768412 ms
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :1.33615e+17 after 1.18958e+19

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldPPPs-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldPPPs-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025300526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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