fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286026100977
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldRVt-PT-020A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9167.680 3600000.00 3650767.00 8544.50 TTFTFTTTT?TFTTTF normal

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-165286026100977.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 ShieldRVt-PT-020A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026100977
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 7.3K Apr 30 01:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 01:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 01:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 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 54K 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 ShieldRVt-PT-020A-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-020A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653074975710

Running Version 202205111006
[2022-05-20 19:29:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 19:29:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 19:29:36] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2022-05-20 19:29:36] [INFO ] Transformed 163 places.
[2022-05-20 19:29:36] [INFO ] Transformed 163 transitions.
[2022-05-20 19:29:36] [INFO ] Found NUPN structural information;
[2022-05-20 19:29:36] [INFO ] Parsed PT model containing 163 places and 163 transitions in 177 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-020A-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 12 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:37] [INFO ] Computed 81 place invariants in 15 ms
[2022-05-20 19:29:37] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:37] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:29:37] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:37] [INFO ] Computed 81 place invariants in 9 ms
[2022-05-20 19:29:37] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
Support contains 99 out of 163 places after structural reductions.
[2022-05-20 19:29:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-20 19:29:37] [INFO ] Flatten gal took : 42 ms
FORMULA ShieldRVt-PT-020A-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 19:29:37] [INFO ] Flatten gal took : 21 ms
[2022-05-20 19:29:37] [INFO ] Input system was already deterministic with 162 transitions.
Support contains 98 out of 163 places (down from 99) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 81) seen :41
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Running SMT prover for 40 properties.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:38] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:38] [INFO ] [Real]Absence check using 81 positive place invariants in 40 ms returned sat
[2022-05-20 19:29:39] [INFO ] After 471ms SMT Verify possible using all constraints in real domain returned unsat :26 sat :0 real:14
[2022-05-20 19:29:39] [INFO ] [Nat]Absence check using 81 positive place invariants in 14 ms returned sat
[2022-05-20 19:29:39] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :26 sat :14
[2022-05-20 19:29:40] [INFO ] After 660ms SMT Verify possible using trap constraints in natural domain returned unsat :26 sat :14
Attempting to minimize the solution found.
Minimization took 181 ms.
[2022-05-20 19:29:40] [INFO ] After 1052ms SMT Verify possible using all constraints in natural domain returned unsat :26 sat :14
Fused 40 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 136 ms.
Support contains 27 out of 163 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 162/162 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 161
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 17 place count 162 transition count 161
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 32 place count 162 transition count 146
Applied a total of 32 rules in 42 ms. Remains 162 /163 variables (removed 1) and now considering 146/162 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/163 places, 146/162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 146 rows 162 cols
[2022-05-20 19:29:40] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:41] [INFO ] [Real]Absence check using 81 positive place invariants in 14 ms returned sat
[2022-05-20 19:29:41] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 19:29:41] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2022-05-20 19:29:41] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 19:29:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 19:29:41] [INFO ] After 52ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 19:29:41] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-05-20 19:29:41] [INFO ] After 428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 38 ms.
Support contains 15 out of 162 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 162/162 places, 146/146 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 146
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 162 transition count 145
Applied a total of 2 rules in 18 ms. Remains 162 /162 variables (removed 0) and now considering 145/146 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 145/146 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 145 rows 162 cols
[2022-05-20 19:29:41] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:41] [INFO ] [Real]Absence check using 81 positive place invariants in 9 ms returned sat
[2022-05-20 19:29:42] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 19:29:42] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2022-05-20 19:29:42] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 19:29:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 19:29:42] [INFO ] After 64ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 19:29:42] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-20 19:29:42] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 31 ms.
Support contains 13 out of 162 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 162/162 places, 145/145 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 145
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 162 transition count 143
Applied a total of 4 rules in 18 ms. Remains 162 /162 variables (removed 0) and now considering 143/145 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 143/145 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 143 rows 162 cols
[2022-05-20 19:29:42] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:29:42] [INFO ] [Real]Absence check using 81 positive place invariants in 9 ms returned sat
[2022-05-20 19:29:42] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 19:29:42] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2022-05-20 19:29:42] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 19:29:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 19:29:42] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 19:29:42] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-20 19:29:42] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 162/162 places, 143/143 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 143
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 162 transition count 142
Applied a total of 2 rules in 16 ms. Remains 162 /162 variables (removed 0) and now considering 142/143 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 142/143 transitions.
Finished random walk after 4678 steps, including 1 resets, run visited all 2 properties in 56 ms. (steps per millisecond=83 )
Successfully simplified 26 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-020A-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 19:29:43] [INFO ] Flatten gal took : 17 ms
[2022-05-20 19:29:43] [INFO ] Flatten gal took : 24 ms
[2022-05-20 19:29:43] [INFO ] Input system was already deterministic with 162 transitions.
Support contains 66 out of 163 places (down from 74) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:43] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:43] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:43] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:43] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:43] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:43] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
[2022-05-20 19:29:43] [INFO ] Flatten gal took : 11 ms
[2022-05-20 19:29:43] [INFO ] Flatten gal took : 13 ms
[2022-05-20 19:29:43] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-20 19:29:43] [INFO ] Flatten gal took : 11 ms
[2022-05-20 19:29:43] [INFO ] Flatten gal took : 11 ms
[2022-05-20 19:29:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality13488959047935098489.gal : 6 ms
[2022-05-20 19:29:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality3812054443766423875.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13488959047935098489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3812054443766423875.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.071713,6852,2,406,5,9057,6,0,816,11515,0


Converting to forward existential form...Done !
original formula: A((AF(EX((((p116==1)||(p115==0))||((p133==1)||(p84==1))))) + (AG(EF(AX((p112==1)))) * (((p36==1)||(p117==1))||((!((p156==0)||(p156==1)))&...189
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(TRUE U (p111==1))))))))) * !(E(!(!(E(TRUE U !(E(TRUE U (p111==1)))))) U (!((!(EG...384
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.211654,10196,1,0,7,25892,22,1,4742,11515,8
FORMULA ShieldRVt-PT-020A-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 5 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:43] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:43] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:43] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:44] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:44] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:29:44] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
[2022-05-20 19:29:44] [INFO ] Flatten gal took : 14 ms
[2022-05-20 19:29:44] [INFO ] Flatten gal took : 17 ms
[2022-05-20 19:29:44] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-20 19:29:44] [INFO ] Flatten gal took : 14 ms
[2022-05-20 19:29:44] [INFO ] Flatten gal took : 13 ms
[2022-05-20 19:29:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4782911765833964278.gal : 2 ms
[2022-05-20 19:29:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality14036621144723418394.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4782911765833964278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14036621144723418394.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.068762,6936,2,406,5,9057,6,0,816,11515,0


Converting to forward existential form...Done !
original formula: E(((EX(EF((AX((p89==1)) + ((p134==1)&&((p31==0)||(p31==1)))))) + (p155==0)) + (p91==1)) U (!((EX(TRUE) * (EF(((p57==0)||(p23==1))) + ((p1...285
=> equivalent forward existential formula: (([(FwdU(Init,((EX(E(TRUE U (!(EX(!((p89==1)))) + ((p134==1)&&((p31==0)||(p31==1)))))) + (p155==0)) + (p91==1)))...866
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.218572,11336,1,0,14,32178,22,4,4827,16834,18
FORMULA ShieldRVt-PT-020A-CTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:44] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 19:29:44] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:44] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:44] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:44] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:44] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
[2022-05-20 19:29:44] [INFO ] Flatten gal took : 8 ms
[2022-05-20 19:29:44] [INFO ] Flatten gal took : 9 ms
[2022-05-20 19:29:44] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-20 19:29:44] [INFO ] Flatten gal took : 8 ms
[2022-05-20 19:29:44] [INFO ] Flatten gal took : 8 ms
[2022-05-20 19:29:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality11371852411398747970.gal : 2 ms
[2022-05-20 19:29:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality16774939603270426645.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11371852411398747970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16774939603270426645.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.079782,7012,2,406,5,9057,6,0,816,11515,0


Converting to forward existential form...Done !
original formula: (E(AF((((EX(TRUE) * AF(((p103==0)||(p35==1)))) + (p20==0)) + (p151==1))) U !(A(AF((p98==1)) U ((((p103==1)&&((p0==0)||(p3==1)))||(p33==0)...238
=> equivalent forward existential formula: ([(EY((Init * E(!(EG(!((((EX(TRUE) * !(EG(!(((p103==0)||(p35==1)))))) + (p20==0)) + (p151==1))))) U !(!((E(!((((...774
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 145/33/17
(forward)formula 0,1,1.03646,45628,1,0,66,154517,47,57,4963,321760,68
FORMULA ShieldRVt-PT-020A-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:45] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:29:45] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:45] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:46] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:46] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:46] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
[2022-05-20 19:29:46] [INFO ] Flatten gal took : 8 ms
[2022-05-20 19:29:46] [INFO ] Flatten gal took : 8 ms
[2022-05-20 19:29:46] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-20 19:29:46] [INFO ] Flatten gal took : 8 ms
[2022-05-20 19:29:46] [INFO ] Flatten gal took : 7 ms
[2022-05-20 19:29:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality3607616157093971230.gal : 10 ms
[2022-05-20 19:29:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality2172827550210879308.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3607616157093971230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2172827550210879308.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.069449,6848,2,406,5,9057,6,0,816,11515,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.074226,6848,1,0,6,9057,7,1,1179,11515,1
FORMULA ShieldRVt-PT-020A-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:46] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:46] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:46] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:46] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:46] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 19:29:46] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
[2022-05-20 19:29:46] [INFO ] Flatten gal took : 10 ms
[2022-05-20 19:29:46] [INFO ] Flatten gal took : 9 ms
[2022-05-20 19:29:46] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-20 19:29:46] [INFO ] Flatten gal took : 7 ms
[2022-05-20 19:29:46] [INFO ] Flatten gal took : 7 ms
[2022-05-20 19:29:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality13239660714593139184.gal : 2 ms
[2022-05-20 19:29:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality1503109053701761762.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13239660714593139184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1503109053701761762.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.067619,6840,2,406,5,9057,6,0,816,11515,0


Converting to forward existential form...Done !
original formula: EG(E(EF(EX(TRUE)) U !(AX(AX(((p11==0)||(p8==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U EX(TRUE)) U !(!(EX(!(!(EX(!(((p11==0)||(p8==1)))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.272117,12556,1,0,9,38054,19,1,4899,22727,15
FORMULA ShieldRVt-PT-020A-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 160 transition count 160
Applied a total of 3 rules in 17 ms. Remains 160 /163 variables (removed 3) and now considering 160/162 (removed 2) transitions.
// Phase 1: matrix 160 rows 160 cols
[2022-05-20 19:29:46] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:29:47] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 160 rows 160 cols
[2022-05-20 19:29:47] [INFO ] Computed 80 place invariants in 0 ms
[2022-05-20 19:29:47] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2022-05-20 19:29:47] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 160 rows 160 cols
[2022-05-20 19:29:47] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:29:47] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 160/163 places, 160/162 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/163 places, 160/162 transitions.
[2022-05-20 19:29:47] [INFO ] Flatten gal took : 6 ms
[2022-05-20 19:29:47] [INFO ] Flatten gal took : 6 ms
[2022-05-20 19:29:47] [INFO ] Input system was already deterministic with 160 transitions.
Finished random walk after 861 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=215 )
FORMULA ShieldRVt-PT-020A-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:47] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:29:47] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:47] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 19:29:47] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:29:47] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 19:29:47] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
[2022-05-20 19:29:47] [INFO ] Flatten gal took : 6 ms
[2022-05-20 19:29:47] [INFO ] Flatten gal took : 7 ms
[2022-05-20 19:29:47] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-20 19:29:47] [INFO ] Flatten gal took : 6 ms
[2022-05-20 19:29:47] [INFO ] Flatten gal took : 7 ms
[2022-05-20 19:29:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality3968957969737580573.gal : 1 ms
[2022-05-20 19:29:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality16639291793849968030.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3968957969737580573.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16639291793849968030.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.067474,6992,2,406,5,9057,6,0,816,11515,0


Converting to forward existential form...Done !
original formula: ((EF((((AF((p38==0)) * AG((p19==0))) * (AX(((p64==0)&&(p162==0))) * (p159==0))) * ((p78==1)&&(p89==0)))) + AG(AF(!(A((((p160==0)||(p124==...317
=> equivalent forward existential formula: ([(EY((Init * !((E(TRUE U (((!(EG(!((p38==0)))) * !(E(TRUE U !((p19==0))))) * (!(EX(!(((p64==0)&&(p162==0))))) *...1049
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 146/0/16
Using saturation style SCC detection
Detected timeout of ITS tools.
[2022-05-20 19:30:17] [INFO ] Flatten gal took : 8 ms
[2022-05-20 19:30:17] [INFO ] Applying decomposition
[2022-05-20 19:30:17] [INFO ] Flatten gal took : 6 ms
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/graph13622063066051931748.txt' '-o' '/tmp/graph13622063066051931748.bin' '-w' '/tmp/graph13622063066051931748.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13622063066051931748.bin' '-l' '-1' '-v' '-w' '/tmp/graph13622063066051931748.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:30:17] [INFO ] Decomposing Gal with order
[2022-05-20 19:30:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:30:17] [INFO ] Removed a total of 60 redundant transitions.
[2022-05-20 19:30:17] [INFO ] Flatten gal took : 46 ms
[2022-05-20 19:30:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2022-05-20 19:30:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality12538866795694224932.gal : 4 ms
[2022-05-20 19:30:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality4382979069713385546.ctl : 4 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12538866795694224932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4382979069713385546.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.040322,6548,48,9,1384,65,204,2037,18,102,0


Converting to forward existential form...Done !
original formula: ((EF((((AF((i2.i1.u18.p38==0)) * AG((i1.i1.u9.p19==0))) * (AX(((i4.i0.u31.p64==0)&&(i11.u80.p162==0))) * (i11.u79.p159==0))) * ((i5.u38.p...487
=> equivalent forward existential formula: ([(EY((Init * !((E(TRUE U (((!(EG(!((i2.i1.u18.p38==0)))) * !(E(TRUE U !((i1.i1.u9.p19==0))))) * (!(EX(!(((i4.i0...1526
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:47] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:30:48] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:48] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:30:48] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:48] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 19:30:48] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
[2022-05-20 19:30:48] [INFO ] Flatten gal took : 21 ms
[2022-05-20 19:30:48] [INFO ] Flatten gal took : 6 ms
[2022-05-20 19:30:48] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-20 19:30:48] [INFO ] Flatten gal took : 6 ms
[2022-05-20 19:30:48] [INFO ] Flatten gal took : 6 ms
[2022-05-20 19:30:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality8045076516388645697.gal : 1 ms
[2022-05-20 19:30:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality5925498468581114576.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8045076516388645697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5925498468581114576.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.067295,7100,2,406,5,9057,6,0,816,11515,0


Converting to forward existential form...Done !
original formula: EF(AX(((p48==0)||(p143==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((p48==0)||(p143==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.16013,9536,1,0,8,24102,11,2,4159,11515,4
FORMULA ShieldRVt-PT-020A-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:48] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 19:30:48] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:48] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 19:30:48] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:48] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 19:30:48] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
[2022-05-20 19:30:48] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:48] [INFO ] Flatten gal took : 6 ms
[2022-05-20 19:30:48] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-20 19:30:48] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:48] [INFO ] Flatten gal took : 6 ms
[2022-05-20 19:30:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality6116798275754407907.gal : 1 ms
[2022-05-20 19:30:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality14118638071264472020.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6116798275754407907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14118638071264472020.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.06768,7012,2,406,5,9057,6,0,816,11515,0


Converting to forward existential form...Done !
original formula: EX(AG(((p162==0)||(p42==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((p162==0)||(p42==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.172917,10028,1,0,6,25229,15,0,4318,11515,5
FORMULA ShieldRVt-PT-020A-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 162/162 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 161
Applied a total of 2 rules in 8 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
// Phase 1: matrix 161 rows 162 cols
[2022-05-20 19:30:49] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:30:49] [INFO ] Implicit Places using invariants in 87 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 161/163 places, 161/162 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 161/163 places, 161/162 transitions.
[2022-05-20 19:30:49] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:49] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:49] [INFO ] Input system was already deterministic with 161 transitions.
[2022-05-20 19:30:49] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:49] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality2332061728982177031.gal : 1 ms
[2022-05-20 19:30:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality17110012247384634095.ctl : 7 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2332061728982177031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17110012247384634095.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20893e+24,0.067166,7040,2,401,5,8954,6,0,807,11387,0


Converting to forward existential form...Done !
original formula: EF(!(E(AF(E((p63==1) U ((p94==0)||(p68==1)))) U ((p133==0)||(p101==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EG(!(E((p63==1) U ((p94==0)||(p68==1)))))) U ((p133==0)||(p101==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 157/0/4
Using saturation style SCC detection
(forward)formula 0,1,0.222206,10592,1,0,14,28666,28,7,4846,11651,16
FORMULA ShieldRVt-PT-020A-CTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:49] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:30:49] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:49] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:30:49] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:49] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 19:30:49] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
[2022-05-20 19:30:49] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:49] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:49] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-20 19:30:49] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:49] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality6080380244981907353.gal : 1 ms
[2022-05-20 19:30:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality11764188365027804025.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6080380244981907353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11764188365027804025.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.067739,6988,2,406,5,9057,6,0,816,11515,0


Converting to forward existential form...Done !
original formula: AF((AG((EX(TRUE) + (p138==0))) + ((p30==0)&&(p78==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((EX(TRUE) + (p138==0))))) + ((p30==0)&&(p78==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.191181,9480,1,0,8,24252,20,2,4580,11515,7
FORMULA ShieldRVt-PT-020A-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:49] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 19:30:50] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:50] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:30:50] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:50] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 19:30:50] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
[2022-05-20 19:30:50] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:50] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:50] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-20 19:30:50] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:50] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality15264723898143609272.gal : 1 ms
[2022-05-20 19:30:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality10290014196546376901.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15264723898143609272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10290014196546376901.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.067352,7164,2,406,5,9057,6,0,816,11515,0


Converting to forward existential form...Done !
original formula: AG(AX(EF((((p108==1)||(p91==0))||(p131==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U (((p108==1)||(p91==0))||(p131==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.160254,9540,1,0,6,22868,14,0,4317,11515,5
FORMULA ShieldRVt-PT-020A-CTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 5 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:50] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:30:50] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:50] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 19:30:50] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2022-05-20 19:30:50] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2022-05-20 19:30:50] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 19:30:50] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 162/162 transitions.
[2022-05-20 19:30:50] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:50] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:50] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-20 19:30:50] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:50] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality16454362995083181931.gal : 1 ms
[2022-05-20 19:30:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality13582608018765435116.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16454362995083181931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13582608018765435116.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.06873,6952,2,406,5,9057,6,0,816,11515,0


Converting to forward existential form...Done !
original formula: A((!(A(((p64==1)||(p23==1)) U (((p127==0)||(p24==1))&&((p79==0)||(p155==1))))) * AG((p145==1))) U AF(AG((AF(((p66==0)||(p160==1))) * EG((...168
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(E(TRUE U !((!(EG(!(((p66==0)||(p160==1))))) * EG((p103==1))))))))))))) * !(E(!(!(EG(!(...552
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.23637,11028,1,0,13,29185,39,3,4771,12920,17
FORMULA ShieldRVt-PT-020A-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2022-05-20 19:30:51] [INFO ] Flatten gal took : 8 ms
[2022-05-20 19:30:51] [INFO ] Flatten gal took : 5 ms
[2022-05-20 19:30:51] [INFO ] Applying decomposition
[2022-05-20 19:30:51] [INFO ] Flatten gal took : 5 ms
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/graph13835710148804783093.txt' '-o' '/tmp/graph13835710148804783093.bin' '-w' '/tmp/graph13835710148804783093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13835710148804783093.bin' '-l' '-1' '-v' '-w' '/tmp/graph13835710148804783093.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:30:51] [INFO ] Decomposing Gal with order
[2022-05-20 19:30:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:30:51] [INFO ] Removed a total of 60 redundant transitions.
[2022-05-20 19:30:51] [INFO ] Flatten gal took : 19 ms
[2022-05-20 19:30:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2022-05-20 19:30:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality7644512154421851453.gal : 12 ms
[2022-05-20 19:30:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality3745850917763551925.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7644512154421851453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3745850917763551925.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.037273,6508,48,9,1448,66,208,2133,18,110,0


Converting to forward existential form...Done !
original formula: ((EF((((AF((i3.i0.u18.p38==0)) * AG((i1.i1.u9.p19==0))) * (AX(((i5.i0.u31.p64==0)&&(i11.i1.u80.p162==0))) * (i11.i1.u79.p159==0))) * ((i6...505
=> equivalent forward existential formula: ([(EY((Init * !((E(TRUE U (((!(EG(!((i3.i0.u18.p38==0)))) * !(E(TRUE U !((i1.i1.u9.p19==0))))) * (!(EX(!(((i5.i0...1559
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
[2022-05-20 19:51:15] [INFO ] Applying decomposition
[2022-05-20 19:51:15] [INFO ] Flatten gal took : 6 ms
[2022-05-20 19:51:15] [INFO ] Decomposing Gal with order
[2022-05-20 19:51:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:51:15] [INFO ] Removed a total of 60 redundant transitions.
[2022-05-20 19:51:15] [INFO ] Flatten gal took : 15 ms
[2022-05-20 19:51:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 19:51:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality4068393634570497097.gal : 3 ms
[2022-05-20 19:51:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality12658349846307816781.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4068393634570497097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12658349846307816781.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.073162,6972,168,5,4148,312,418,4494,12,233,0


Converting to forward existential form...Done !
original formula: ((EF((((AF((u19.p38==0)) * AG((u10.p19==0))) * (AX(((u32.p64==0)&&(u81.p162==0))) * (u80.p159==0))) * ((u39.p78==1)&&(u45.p89==0)))) + AG...391
=> equivalent forward existential formula: ([(EY((Init * !((E(TRUE U (((!(EG(!((u19.p38==0)))) * !(E(TRUE U !((u10.p19==0))))) * (!(EX(!(((u32.p64==0)&&(u8...1252
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 80
Fast SCC detection found an SCC at level 81
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 80
Fast SCC detection found an SCC at level 81
Detected timeout of ITS tools.
[2022-05-20 20:11:39] [INFO ] Flatten gal took : 7 ms
[2022-05-20 20:11:39] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-20 20:11:39] [INFO ] Transformed 163 places.
[2022-05-20 20:11:39] [INFO ] Transformed 162 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-05-20 20:11:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality5473487654673308293.gal : 1 ms
[2022-05-20 20:11:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality14244557831494468865.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5473487654673308293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14244557831494468865.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...320
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41785e+24,0.086811,7808,2,1065,5,12970,6,0,816,13474,0


Converting to forward existential form...Done !
original formula: ((EF((((AF((p38==0)) * AG((p19==0))) * (AX(((p64==0)&&(p162==0))) * (p159==0))) * ((p78==1)&&(p89==0)))) + AG(AF(!(A((((p160==0)||(p124==...317
=> equivalent forward existential formula: ([(EY((Init * !((E(TRUE U (((!(EG(!((p38==0)))) * !(E(TRUE U !((p19==0))))) * (!(EX(!(((p64==0)&&(p162==0))))) *...1049
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 146/0/16
Using saturation style SCC detection

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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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 CTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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="ShieldRVt-PT-020A"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-020A, 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 r222-tall-165286026100977"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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