Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r035-tajo-162038167800135.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CSRepetitions-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167800135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 76K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 321K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 239K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 22 12:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 22 12:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 71K May 5 16:51 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 CSRepetitions-PT-03-CTLCardinality-00
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-01
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-02
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-03
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-04
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-05
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-06
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-07
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-08
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-09
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-10
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-11
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-12
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-13
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-14
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620909676537

[2021-05-13 12:41:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 12:41:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 12:41:18] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-13 12:41:18] [INFO ] Transformed 58 places.
[2021-05-13 12:41:18] [INFO ] Transformed 81 transitions.
[2021-05-13 12:41:18] [INFO ] Parsed PT model containing 58 places and 81 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Incomplete random walk after 100000 steps, including 3333 resets, run finished after 2515 ms. (steps per millisecond=39 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1]
// Phase 1: matrix 81 rows 58 cols
[2021-05-13 12:41:21] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-13 12:41:21] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2021-05-13 12:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using state equation in 437 ms returned unsat
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using 12 positive place invariants in 54 ms returned unsat
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2021-05-13 12:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using 12 positive place invariants in 57 ms returned sat
[2021-05-13 12:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using 12 positive place invariants in 53 ms returned sat
[2021-05-13 12:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned unsat
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using 12 positive place invariants in 54 ms returned sat
[2021-05-13 12:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using state equation in 57 ms returned unsat
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-13 12:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using state equation in 38 ms returned unsat
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using 12 positive place invariants in 28 ms returned sat
[2021-05-13 12:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using state equation in 54 ms returned unsat
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using 12 positive place invariants in 27 ms returned sat
[2021-05-13 12:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:22] [INFO ] [Real]Absence check using state equation in 52 ms returned unsat
[2021-05-13 12:41:23] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned unsat
[2021-05-13 12:41:23] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-13 12:41:23] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned unsat
[2021-05-13 12:41:23] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:41:23] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2021-05-13 12:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:23] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
[2021-05-13 12:41:23] [INFO ] [Real]Absence check using 12 positive place invariants in 86 ms returned sat
[2021-05-13 12:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:23] [INFO ] [Real]Absence check using state equation in 477 ms returned unsat
[2021-05-13 12:41:23] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-13 12:41:23] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2021-05-13 12:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:23] [INFO ] [Real]Absence check using state equation in 42 ms returned unsat
[2021-05-13 12:41:23] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-13 12:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using state equation in 337 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-13 12:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 38 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 41 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-13 12:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 81 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-13 12:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using state equation in 38 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 79 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-13 12:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 67 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-13 12:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
[2021-05-13 12:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2021-05-13 12:41:25] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned unsat
[2021-05-13 12:41:25] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned unsat
[2021-05-13 12:41:25] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-13 12:41:25] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned unsat
[2021-05-13 12:41:25] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-13 12:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:25] [INFO ] [Real]Absence check using state equation in 477 ms returned unsat
[2021-05-13 12:41:25] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2021-05-13 12:41:25] [INFO ] [Real]Absence check using 12 positive place invariants in 67 ms returned sat
[2021-05-13 12:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using state equation in 479 ms returned unsat
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-13 12:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-13 12:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using state equation in 87 ms returned unsat
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-13 12:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using state equation in 141 ms returned unsat
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using 12 positive place invariants in 40 ms returned sat
[2021-05-13 12:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using state equation in 89 ms returned unsat
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-13 12:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using state equation in 39 ms returned unsat
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using 12 positive place invariants in 67 ms returned sat
[2021-05-13 12:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2021-05-13 12:41:26] [INFO ] [Real]Absence check using 12 positive place invariants in 65 ms returned sat
[2021-05-13 12:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using state equation in 350 ms returned unsat
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned unsat
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-13 12:41:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using 12 positive place invariants in 33 ms returned sat
[2021-05-13 12:41:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using state equation in 51 ms returned unsat
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-13 12:41:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using state equation in 60 ms returned unsat
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned unsat
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-13 12:41:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned unsat
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned unsat
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-13 12:41:27] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
Successfully simplified 65 atomic propositions for a total of 65 simplifications.
[2021-05-13 12:41:28] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-13 12:41:28] [INFO ] Flatten gal took : 60 ms
[2021-05-13 12:41:28] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2021-05-13 12:41:28] [INFO ] Flatten gal took : 34 ms
FORMULA CSRepetitions-PT-03-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 12:41:28] [INFO ] Applying decomposition
[2021-05-13 12:41:28] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph2536254392551752970.txt, -o, /tmp/graph2536254392551752970.bin, -w, /tmp/graph2536254392551752970.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph2536254392551752970.bin, -l, -1, -v, -w, /tmp/graph2536254392551752970.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 12:41:28] [INFO ] Decomposing Gal with order
[2021-05-13 12:41:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 12:41:28] [INFO ] Removed a total of 60 redundant transitions.
[2021-05-13 12:41:28] [INFO ] Flatten gal took : 101 ms
[2021-05-13 12:41:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-13 12:41:28] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 4 ms
[2021-05-13 12:41:28] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34075e+08,6.97194,215176,2,20162,5,694152,6,0,307,1.29764e+06,0


Converting to forward existential form...Done !
original formula: (EG(EF(AG(EF((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu2.Server_Anwering_1_3+gu2.Server_Anwering_1_1)+gu2.Server_Anwering_1_2)+gu2.Server_Anwering_7_3)+gu2.Server_Anwering_9_2)+gu2.Server_Anwering_2_2)+gu2.Server_Anwering_4_1)+gu2.Server_Anwering_3_1)+gu2.Server_Anwering_3_2)+gu2.Server_Anwering_8_3)+gu2.Server_Anwering_8_2)+gu2.Server_Anwering_7_2)+gu2.Server_Anwering_5_3)+gu2.Server_Anwering_6_1)+gu2.Server_Anwering_6_2)+gu2.Server_Anwering_6_3)+gu2.Server_Anwering_5_1)+gu2.Server_Anwering_3_3)+gu2.Server_Anwering_5_2)+gu2.Server_Anwering_7_1)+gu2.Server_Anwering_4_3)+gu2.Server_Anwering_4_2)+gu2.Server_Anwering_8_1)+gu2.Server_Anwering_9_3)+gu2.Server_Anwering_2_1)+gu2.Server_Anwering_9_1)+gu2.Server_Anwering_2_3)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)+gi0.gu1.RequestBufferSlots)+gu3.Client_Waiting_4)+gu3.Client_Waiting_3)+gu3.Client_Waiting_5)+gu3.Client_Waiting_6)+gu3.Client_Waiting_7)+gu3.Client_Waiting_8)+gu3.Client_Waiting_9)+gu3.Client_Waiting_2)+gu3.Client_Waiting_1)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_9)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_8)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBufferSlots)+gu3.Server_Waiting_1)+gu3.Server_Waiting_3)+gu3.Server_Waiting_2)<=13))))) * AG((((((((((((((((((((((((((((((((((((((gu2.Server_Anwering_1_3+gu2.Server_Anwering_1_1)+gu2.Server_Anwering_1_2)+gu2.Server_Anwering_7_3)+gu2.Server_Anwering_9_2)+gu2.Server_Anwering_2_2)+gu2.Server_Anwering_4_1)+gu2.Server_Anwering_3_1)+gu2.Server_Anwering_3_2)+gu2.Server_Anwering_8_3)+gu2.Server_Anwering_8_2)+gu2.Server_Anwering_7_2)+gu2.Server_Anwering_5_3)+gu2.Server_Anwering_6_1)+gu2.Server_Anwering_6_2)+gu2.Server_Anwering_6_3)+gu2.Server_Anwering_5_1)+gu2.Server_Anwering_3_3)+gu2.Server_Anwering_5_2)+gu2.Server_Anwering_7_1)+gu2.Server_Anwering_4_3)+gu2.Server_Anwering_4_2)+gu2.Server_Anwering_8_1)+gu2.Server_Anwering_9_3)+gu2.Server_Anwering_2_1)+gu2.Server_Anwering_9_1)+gu2.Server_Anwering_2_3)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)+gi0.gu1.RequestBufferSlots)<12)))
=> equivalent forward existential formula: ([(Init * !(EG(E(TRUE U !(E(TRUE U !(E(TRUE U (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu2.Server_Anwering_1_3+gu2.Server_Anwering_1_1)+gu2.Server_Anwering_1_2)+gu2.Server_Anwering_7_3)+gu2.Server_Anwering_9_2)+gu2.Server_Anwering_2_2)+gu2.Server_Anwering_4_1)+gu2.Server_Anwering_3_1)+gu2.Server_Anwering_3_2)+gu2.Server_Anwering_8_3)+gu2.Server_Anwering_8_2)+gu2.Server_Anwering_7_2)+gu2.Server_Anwering_5_3)+gu2.Server_Anwering_6_1)+gu2.Server_Anwering_6_2)+gu2.Server_Anwering_6_3)+gu2.Server_Anwering_5_1)+gu2.Server_Anwering_3_3)+gu2.Server_Anwering_5_2)+gu2.Server_Anwering_7_1)+gu2.Server_Anwering_4_3)+gu2.Server_Anwering_4_2)+gu2.Server_Anwering_8_1)+gu2.Server_Anwering_9_3)+gu2.Server_Anwering_2_1)+gu2.Server_Anwering_9_1)+gu2.Server_Anwering_2_3)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)+gi0.gu1.RequestBufferSlots)+gu3.Client_Waiting_4)+gu3.Client_Waiting_3)+gu3.Client_Waiting_5)+gu3.Client_Waiting_6)+gu3.Client_Waiting_7)+gu3.Client_Waiting_8)+gu3.Client_Waiting_9)+gu3.Client_Waiting_2)+gu3.Client_Waiting_1)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_9)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_8)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBufferSlots)+gu3.Server_Waiting_1)+gu3.Server_Waiting_3)+gu3.Server_Waiting_2)<=13)))))))))] = FALSE * [(FwdU(Init,TRUE) * !((((((((((((((((((((((((((((((((((((((gu2.Server_Anwering_1_3+gu2.Server_Anwering_1_1)+gu2.Server_Anwering_1_2)+gu2.Server_Anwering_7_3)+gu2.Server_Anwering_9_2)+gu2.Server_Anwering_2_2)+gu2.Server_Anwering_4_1)+gu2.Server_Anwering_3_1)+gu2.Server_Anwering_3_2)+gu2.Server_Anwering_8_3)+gu2.Server_Anwering_8_2)+gu2.Server_Anwering_7_2)+gu2.Server_Anwering_5_3)+gu2.Server_Anwering_6_1)+gu2.Server_Anwering_6_2)+gu2.Server_Anwering_6_3)+gu2.Server_Anwering_5_1)+gu2.Server_Anwering_3_3)+gu2.Server_Anwering_5_2)+gu2.Server_Anwering_7_1)+gu2.Server_Anwering_4_3)+gu2.Server_Anwering_4_2)+gu2.Server_Anwering_8_1)+gu2.Server_Anwering_9_3)+gu2.Server_Anwering_2_1)+gu2.Server_Anwering_9_1)+gu2.Server_Anwering_2_3)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)+gi0.gu1.RequestBufferSlots)<12)))] = FALSE)
(forward)formula 0,0,7.9879,215176,1,0,8,694152,9,2,12200,1.29764e+06,1
FORMULA CSRepetitions-PT-03-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AG((EF(((((((((((gi0.gu0.Client_Sending_1+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)<=((((((((((((((((((((((((((gu2.Server_Anwering_1_3+gu2.Server_Anwering_1_1)+gu2.Server_Anwering_1_2)+gu2.Server_Anwering_7_3)+gu2.Server_Anwering_9_2)+gu2.Server_Anwering_2_2)+gu2.Server_Anwering_4_1)+gu2.Server_Anwering_3_1)+gu2.Server_Anwering_3_2)+gu2.Server_Anwering_8_3)+gu2.Server_Anwering_8_2)+gu2.Server_Anwering_7_2)+gu2.Server_Anwering_5_3)+gu2.Server_Anwering_6_1)+gu2.Server_Anwering_6_2)+gu2.Server_Anwering_6_3)+gu2.Server_Anwering_5_1)+gu2.Server_Anwering_3_3)+gu2.Server_Anwering_5_2)+gu2.Server_Anwering_7_1)+gu2.Server_Anwering_4_3)+gu2.Server_Anwering_4_2)+gu2.Server_Anwering_8_1)+gu2.Server_Anwering_9_3)+gu2.Server_Anwering_2_1)+gu2.Server_Anwering_9_1)+gu2.Server_Anwering_2_3))&&((((((((((((((((((((gi0.gu0.Client_Sending_1+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_9)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_8)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBufferSlots)+gi0.gu1.RequestBufferSlots)<=33))) * (((((((((((((((((((((gi0.gu0.Client_Sending_1+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)+gi0.gu1.RequestBufferSlots)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_9)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_8)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBufferSlots)<=6)&&((((((((((((((((((((((((((((((((((((((((gi0.gu1.RequestBuffer_1+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_9)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_8)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBufferSlots)+gu3.Server_Waiting_1)+gu3.Server_Waiting_3)+gu3.Server_Waiting_2)+gu2.Server_Anwering_1_3)+gu2.Server_Anwering_1_1)+gu2.Server_Anwering_1_2)+gu2.Server_Anwering_7_3)+gu2.Server_Anwering_9_2)+gu2.Server_Anwering_2_2)+gu2.Server_Anwering_4_1)+gu2.Server_Anwering_3_1)+gu2.Server_Anwering_3_2)+gu2.Server_Anwering_8_3)+gu2.Server_Anwering_8_2)+gu2.Server_Anwering_7_2)+gu2.Server_Anwering_5_3)+gu2.Server_Anwering_6_1)+gu2.Server_Anwering_6_2)+gu2.Server_Anwering_6_3)+gu2.Server_Anwering_5_1)+gu2.Server_Anwering_3_3)+gu2.Server_Anwering_5_2)+gu2.Server_Anwering_7_1)+gu2.Server_Anwering_4_3)+gu2.Server_Anwering_4_2)+gu2.Server_Anwering_8_1)+gu2.Server_Anwering_9_3)+gu2.Server_Anwering_2_1)+gu2.Server_Anwering_9_1)+gu2.Server_Anwering_2_3)>=3)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U ((((((((((gi0.gu0.Client_Sending_1+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)<=((((((((((((((((((((((((((gu2.Server_Anwering_1_3+gu2.Server_Anwering_1_1)+gu2.Server_Anwering_1_2)+gu2.Server_Anwering_7_3)+gu2.Server_Anwering_9_2)+gu2.Server_Anwering_2_2)+gu2.Server_Anwering_4_1)+gu2.Server_Anwering_3_1)+gu2.Server_Anwering_3_2)+gu2.Server_Anwering_8_3)+gu2.Server_Anwering_8_2)+gu2.Server_Anwering_7_2)+gu2.Server_Anwering_5_3)+gu2.Server_Anwering_6_1)+gu2.Server_Anwering_6_2)+gu2.Server_Anwering_6_3)+gu2.Server_Anwering_5_1)+gu2.Server_Anwering_3_3)+gu2.Server_Anwering_5_2)+gu2.Server_Anwering_7_1)+gu2.Server_Anwering_4_3)+gu2.Server_Anwering_4_2)+gu2.Server_Anwering_8_1)+gu2.Server_Anwering_9_3)+gu2.Server_Anwering_2_1)+gu2.Server_Anwering_9_1)+gu2.Server_Anwering_2_3))&&((((((((((((((((((((gi0.gu0.Client_Sending_1+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_9)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_8)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBufferSlots)+gi0.gu1.RequestBufferSlots)<=33))) * (((((((((((((((((((((gi0.gu0.Client_Sending_1+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)+gi0.gu1.RequestBufferSlots)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_9)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_8)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBufferSlots)<=6)&&((((((((((((((((((((((((((((((((((((((((gi0.gu1.RequestBuffer_1+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_9)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_8)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBufferSlots)+gu3.Server_Waiting_1)+gu3.Server_Waiting_3)+gu3.Server_Waiting_2)+gu2.Server_Anwering_1_3)+gu2.Server_Anwering_1_1)+gu2.Server_Anwering_1_2)+gu2.Server_Anwering_7_3)+gu2.Server_Anwering_9_2)+gu2.Server_Anwering_2_2)+gu2.Server_Anwering_4_1)+gu2.Server_Anwering_3_1)+gu2.Server_Anwering_3_2)+gu2.Server_Anwering_8_3)+gu2.Server_Anwering_8_2)+gu2.Server_Anwering_7_2)+gu2.Server_Anwering_5_3)+gu2.Server_Anwering_6_1)+gu2.Server_Anwering_6_2)+gu2.Server_Anwering_6_3)+gu2.Server_Anwering_5_1)+gu2.Server_Anwering_3_3)+gu2.Server_Anwering_5_2)+gu2.Server_Anwering_7_1)+gu2.Server_Anwering_4_3)+gu2.Server_Anwering_4_2)+gu2.Server_Anwering_8_1)+gu2.Server_Anwering_9_3)+gu2.Server_Anwering_2_1)+gu2.Server_Anwering_9_1)+gu2.Server_Anwering_2_3)>=3)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions gi0.gu1.Lose_Request_7, gi0.gu1.Lose_Request_4, gi0.gu1.Lose_Request_5, gi0.gu1.Lose_Request_2, gi0.gu1.Lose_Request_3, gi0.gu1.Lose_Request_1, gi0.gu1.Lose_Request_8, gi0.gu1.Lose_Request_9, gi0.gu1.Lose_Request_6, Send_Answer_8_2, Prepare_Request_7, Send_Answer_2_2, Send_Answer_9_2, Prepare_Request_8, Send_Answer_7_3, Send_Answer_5_1, Prepare_Request_2, Prepare_Request_9, Send_Answer_1_3, Send_Answer_6_1, Send_Answer_1_2, Prepare_Request_1, Send_Answer_4_2, Send_Answer_2_3, Send_Answer_3_1, Send_Answer_6_3, Send_Answer_5_3, Send_Answer_3_2, Send_Answer_3_3, Prepare_Request_3, Send_Answer_4_3, Send_Answer_4_1, Send_Answer_8_1, Prepare_Request_4, Send_Answer_5_2, Send_Answer_7_1, Send_Answer_2_1, Send_Answer_1_1, Send_Answer_6_2, Prepare_Request_5, Send_Answer_9_3, Prepare_Request_6, Send_Answer_7_2, Send_Answer_8_3, Send_Answer_9_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/36/45/81
(forward)formula 1,0,87.8616,1760436,1,0,278,8.49908e+06,186,116,39947,9.91758e+06,247
FORMULA CSRepetitions-PT-03-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((((((((((((((((((((((((((((((((((((((((((((((((gi0.gu1.RequestBufferSlots+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_9)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_8)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBufferSlots)+gu2.Server_Anwering_1_3)+gu2.Server_Anwering_1_1)+gu2.Server_Anwering_1_2)+gu2.Server_Anwering_7_3)+gu2.Server_Anwering_9_2)+gu2.Server_Anwering_2_2)+gu2.Server_Anwering_4_1)+gu2.Server_Anwering_3_1)+gu2.Server_Anwering_3_2)+gu2.Server_Anwering_8_3)+gu2.Server_Anwering_8_2)+gu2.Server_Anwering_7_2)+gu2.Server_Anwering_5_3)+gu2.Server_Anwering_6_1)+gu2.Server_Anwering_6_2)+gu2.Server_Anwering_6_3)+gu2.Server_Anwering_5_1)+gu2.Server_Anwering_3_3)+gu2.Server_Anwering_5_2)+gu2.Server_Anwering_7_1)+gu2.Server_Anwering_4_3)+gu2.Server_Anwering_4_2)+gu2.Server_Anwering_8_1)+gu2.Server_Anwering_9_3)+gu2.Server_Anwering_2_1)+gu2.Server_Anwering_9_1)+gu2.Server_Anwering_2_3)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)>=11))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((((((((((((((((((((((((((((((((((((((((((((((gi0.gu1.RequestBufferSlots+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_9)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_8)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBufferSlots)+gu2.Server_Anwering_1_3)+gu2.Server_Anwering_1_1)+gu2.Server_Anwering_1_2)+gu2.Server_Anwering_7_3)+gu2.Server_Anwering_9_2)+gu2.Server_Anwering_2_2)+gu2.Server_Anwering_4_1)+gu2.Server_Anwering_3_1)+gu2.Server_Anwering_3_2)+gu2.Server_Anwering_8_3)+gu2.Server_Anwering_8_2)+gu2.Server_Anwering_7_2)+gu2.Server_Anwering_5_3)+gu2.Server_Anwering_6_1)+gu2.Server_Anwering_6_2)+gu2.Server_Anwering_6_3)+gu2.Server_Anwering_5_1)+gu2.Server_Anwering_3_3)+gu2.Server_Anwering_5_2)+gu2.Server_Anwering_7_1)+gu2.Server_Anwering_4_3)+gu2.Server_Anwering_4_2)+gu2.Server_Anwering_8_1)+gu2.Server_Anwering_9_3)+gu2.Server_Anwering_2_1)+gu2.Server_Anwering_9_1)+gu2.Server_Anwering_2_3)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)>=11))] != FALSE
(forward)formula 2,1,100.951,1867704,1,0,279,8.5335e+06,187,117,154064,9.95671e+06,248
FORMULA CSRepetitions-PT-03-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EG(TRUE))
=> equivalent forward existential formula: [FwdG(Init,TRUE)] = FALSE
(forward)formula 3,0,111.098,2101584,1,0,280,9.17685e+06,191,121,154192,1.13421e+07,253
FORMULA CSRepetitions-PT-03-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AG(EX(TRUE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] != FALSE
(forward)formula 4,1,111.288,2102904,1,0,281,9.19957e+06,191,123,154216,1.13956e+07,255
FORMULA CSRepetitions-PT-03-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1620909800941

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="CSRepetitions-PT-03"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is CSRepetitions-PT-03, 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 r035-tajo-162038167800135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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