fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r201-smll-171649587200377
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for IOTPpurchase-PT-C05M04P03D02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
317.848 14267.00 33172.00 285.60 TTFFFTFTTFFFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r201-smll-171649587200377.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is IOTPpurchase-PT-C05M04P03D02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649587200377
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 156K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 13 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 60K May 18 16:42 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 IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2023-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2023-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2023-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716804779259

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C05M04P03D02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 10:13:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 10:13:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 10:13:01] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-27 10:13:01] [INFO ] Transformed 111 places.
[2024-05-27 10:13:01] [INFO ] Transformed 45 transitions.
[2024-05-27 10:13:01] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 106 ms.
Support contains 102 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 45
Applied a total of 7 rules in 43 ms. Remains 104 /111 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 104 cols
[2024-05-27 10:13:01] [INFO ] Computed 60 invariants in 22 ms
[2024-05-27 10:13:01] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-27 10:13:01] [INFO ] Invariant cache hit.
[2024-05-27 10:13:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 10:13:02] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-27 10:13:02] [INFO ] Invariant cache hit.
[2024-05-27 10:13:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/149 variables, 104/164 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/149 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 165 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1751 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 45/149 variables, 104/164 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 44/209 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/149 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 209 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1534 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 3340ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 3367ms
Starting structural reductions in LTL mode, iteration 1 : 104/111 places, 45/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3955 ms. Remains : 104/111 places, 45/45 transitions.
Support contains 102 out of 104 places after structural reductions.
[2024-05-27 10:13:05] [INFO ] Flatten gal took : 39 ms
[2024-05-27 10:13:05] [INFO ] Flatten gal took : 15 ms
[2024-05-27 10:13:05] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 40000 steps (8 resets) in 3672 ms. (10 steps per ms) remains 53/136 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 50/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
[2024-05-27 10:13:07] [INFO ] Invariant cache hit.
[2024-05-27 10:13:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp114 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 44 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 10/12 constraints. Problems are: Problem set: 5 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 43 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp101 is UNSAT
Problem AtomicPropp103 is UNSAT
Problem AtomicPropp109 is UNSAT
Problem AtomicPropp118 is UNSAT
Problem AtomicPropp127 is UNSAT
At refinement iteration 3 (OVERLAPS) 25/81 variables, 14/26 constraints. Problems are: Problem set: 22 solved, 26 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp111 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 9/35 constraints. Problems are: Problem set: 29 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/35 constraints. Problems are: Problem set: 29 solved, 19 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp121 is UNSAT
Problem AtomicPropp128 is UNSAT
At refinement iteration 6 (OVERLAPS) 20/101 variables, 22/57 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/57 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/102 variables, 1/58 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/58 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/104 variables, 2/60 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/60 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 45/149 variables, 104/164 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 1/165 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/165 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/149 variables, 0/165 constraints. Problems are: Problem set: 45 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 165 constraints, problems are : Problem set: 45 solved, 3 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 45 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 7/7 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 1/8 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/44 variables, 4/12 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/46 variables, 2/14 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 42/88 variables, 31/45 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/45 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 5/93 variables, 4/49 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 0/49 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 11/104 variables, 11/60 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/104 variables, 0/60 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 45/149 variables, 104/164 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 1/165 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 3/168 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/149 variables, 0/168 constraints. Problems are: Problem set: 45 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/149 variables, 0/168 constraints. Problems are: Problem set: 45 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 168 constraints, problems are : Problem set: 45 solved, 3 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 770ms problems are : Problem set: 45 solved, 3 unsolved
Finished Parikh walk after 158 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=79 )
Parikh walk visited 3 properties in 236 ms.
Successfully simplified 45 atomic propositions for a total of 16 simplifications.
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 10:13:08] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-27 10:13:08] [INFO ] Flatten gal took : 11 ms
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 10:13:08] [INFO ] Flatten gal took : 9 ms
[2024-05-27 10:13:08] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 72 out of 104 places (down from 85) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 67 transition count 45
Applied a total of 37 rules in 5 ms. Remains 67 /104 variables (removed 37) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 67/104 places, 45/45 transitions.
[2024-05-27 10:13:08] [INFO ] Flatten gal took : 5 ms
[2024-05-27 10:13:08] [INFO ] Flatten gal took : 5 ms
[2024-05-27 10:13:08] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 67 transition count 45
Applied a total of 37 rules in 4 ms. Remains 67 /104 variables (removed 37) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 67/104 places, 45/45 transitions.
[2024-05-27 10:13:08] [INFO ] Flatten gal took : 5 ms
[2024-05-27 10:13:08] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:08] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 67 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 32 place count 56 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 48 transition count 30
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 40 place count 48 transition count 22
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 60 place count 36 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 60 place count 36 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 34 transition count 20
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 79 place count 25 transition count 14
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 24 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 80 place count 24 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 23 transition count 13
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 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 85 place count 21 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 20 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 86 place count 20 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 89 place count 18 transition count 11
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 5 with 2 rules applied. Total rules applied 91 place count 17 transition count 10
Applied a total of 91 rules in 39 ms. Remains 17 /104 variables (removed 87) and now considering 10/45 (removed 35) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 17/104 places, 10/45 transitions.
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 2 ms
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 1 ms
[2024-05-27 10:13:09] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 68 transition count 45
Applied a total of 36 rules in 4 ms. Remains 68 /104 variables (removed 36) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 68/104 places, 45/45 transitions.
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 45/45 transitions.
Ensure Unique test removed 30 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 69 transition count 45
Applied a total of 35 rules in 4 ms. Remains 69 /104 variables (removed 35) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 69/104 places, 45/45 transitions.
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 3 ms
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 69 transition count 45
Applied a total of 35 rules in 3 ms. Remains 69 /104 variables (removed 35) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 69/104 places, 45/45 transitions.
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 3 ms
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 67 transition count 45
Applied a total of 37 rules in 4 ms. Remains 67 /104 variables (removed 37) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 67/104 places, 45/45 transitions.
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 68 transition count 45
Applied a total of 36 rules in 4 ms. Remains 68 /104 variables (removed 36) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 68/104 places, 45/45 transitions.
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 69 transition count 45
Applied a total of 35 rules in 3 ms. Remains 69 /104 variables (removed 35) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 69/104 places, 45/45 transitions.
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 67 transition count 45
Applied a total of 37 rules in 4 ms. Remains 67 /104 variables (removed 37) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 67/104 places, 45/45 transitions.
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 67 transition count 45
Applied a total of 37 rules in 4 ms. Remains 67 /104 variables (removed 37) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 67/104 places, 45/45 transitions.
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 3 ms
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 67 transition count 45
Applied a total of 37 rules in 5 ms. Remains 67 /104 variables (removed 37) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 67/104 places, 45/45 transitions.
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 67 transition count 45
Applied a total of 37 rules in 4 ms. Remains 67 /104 variables (removed 37) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 67/104 places, 45/45 transitions.
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 3 ms
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 4 ms
[2024-05-27 10:13:09] [INFO ] Input system was already deterministic with 45 transitions.
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 7 ms
[2024-05-27 10:13:09] [INFO ] Flatten gal took : 7 ms
[2024-05-27 10:13:09] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-27 10:13:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 45 transitions and 210 arcs took 2 ms.
Total runtime 8363 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running IOTPpurchase-PT-C05M04P03D02

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 104
TRANSITIONS: 45
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 545
MODEL NAME: /home/mcc/execution/410/model
104 places, 45 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716804793526

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

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="IOTPpurchase-PT-C05M04P03D02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is IOTPpurchase-PT-C05M04P03D02, 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 r201-smll-171649587200377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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