Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961390900779.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itstools
Input is QuasiCertifProtocol-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390900779
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.8K Apr 12 06:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 06:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Apr 10 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 10 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 55K Mar 24 05:37 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 QuasiCertifProtocol-PT-02-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1589857626741

[2020-05-19 03:07:08] [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]
[2020-05-19 03:07:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 03:07:08] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2020-05-19 03:07:08] [INFO ] Transformed 86 places.
[2020-05-19 03:07:08] [INFO ] Transformed 56 transitions.
[2020-05-19 03:07:08] [INFO ] Parsed PT model containing 86 places and 56 transitions in 69 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Incomplete random walk after 100000 steps, including 16420 resets, run finished after 231 ms. (steps per millisecond=432 ) properties seen :[0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0]
// Phase 1: matrix 56 rows 86 cols
[2020-05-19 03:07:09] [INFO ] Computed 31 place invariants in 7 ms
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned unsat
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 17 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-05-19 03:07:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 9 ms.
[2020-05-19 03:07:09] [INFO ] Added : 28 causal constraints over 6 iterations in 54 ms. Result :sat
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-05-19 03:07:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:07:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:09] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-05-19 03:07:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:07:09] [INFO ] Added : 24 causal constraints over 5 iterations in 32 ms. Result :sat
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-05-19 03:07:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:07:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 10 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:09] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-05-19 03:07:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:07:09] [INFO ] Added : 23 causal constraints over 5 iterations in 34 ms. Result :sat
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-19 03:07:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:07:09] [INFO ] Added : 19 causal constraints over 4 iterations in 24 ms. Result :sat
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-19 03:07:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:07:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:09] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-05-19 03:07:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:07:09] [INFO ] Added : 18 causal constraints over 4 iterations in 19 ms. Result :sat
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-19 03:07:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:07:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:09] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-05-19 03:07:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 2 ms.
[2020-05-19 03:07:09] [INFO ] Added : 16 causal constraints over 4 iterations in 18 ms. Result :sat
[2020-05-19 03:07:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-05-19 03:07:10] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:07:10] [INFO ] Added : 26 causal constraints over 6 iterations in 28 ms. Result :sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-05-19 03:07:10] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:07:10] [INFO ] Added : 27 causal constraints over 6 iterations in 35 ms. Result :sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-05-19 03:07:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:07:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:10] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-05-19 03:07:10] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 2 ms.
[2020-05-19 03:07:10] [INFO ] Added : 14 causal constraints over 3 iterations in 14 ms. Result :sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-05-19 03:07:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:07:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:10] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2020-05-19 03:07:10] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:07:10] [INFO ] Added : 19 causal constraints over 4 iterations in 21 ms. Result :sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-19 03:07:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:07:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:10] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-05-19 03:07:10] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:07:10] [INFO ] Added : 19 causal constraints over 4 iterations in 23 ms. Result :sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-05-19 03:07:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:07:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 12 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:10] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-05-19 03:07:10] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:07:10] [INFO ] Added : 19 causal constraints over 4 iterations in 34 ms. Result :sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 16 ms returned sat
[2020-05-19 03:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:10] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-05-19 03:07:11] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-19 03:07:11] [INFO ] Flatten gal took : 30 ms
[2020-05-19 03:07:11] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-19 03:07:11] [INFO ] Flatten gal took : 9 ms
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 03:07:11] [INFO ] Applying decomposition
[2020-05-19 03:07:11] [INFO ] Flatten gal took : 7 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/graph10920013009731264062.txt, -o, /tmp/graph10920013009731264062.bin, -w, /tmp/graph10920013009731264062.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/graph10920013009731264062.bin, -l, -1, -v, -w, /tmp/graph10920013009731264062.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 03:07:11] [INFO ] Decomposing Gal with order
[2020-05-19 03:07:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 03:07:11] [INFO ] Removed a total of 25 redundant transitions.
[2020-05-19 03:07:11] [INFO ] Flatten gal took : 47 ms
[2020-05-19 03:07:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 11 ms.
[2020-05-19 03:07:11] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 27 ms
[2020-05-19 03:07:11] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 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 13 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,1029,0.040464,5796,2,2453,5,7179,6,0,367,3851,0


Converting to forward existential form...Done !
original formula: (EX(AX((((gu8.n1_2+gu8.n1_0)+gu8.n1_1)>=1))) * AF((((gu7.Cstart_1+gu7.Cstart_0)+gu7.Cstart_2)<=((gu7.CstopOK_0+gu7.CstopOK_1)+gu7.CstopOK_2))))
=> equivalent forward existential formula: ([(Init * !(EX(!(EX(!((((gu8.n1_2+gu8.n1_0)+gu8.n1_1)>=1)))))))] = FALSE * [FwdG(Init,!((((gu7.Cstart_1+gu7.Cstart_0)+gu7.Cstart_2)<=((gu7.CstopOK_0+gu7.CstopOK_1)+gu7.CstopOK_2))))] = FALSE)
Hit Full ! (commute/partial/dont) 45/0/6
(forward)formula 0,0,0.24653,17264,1,0,39,49180,19,4,1988,27012,37
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EG((((gu10.n3_0+gu10.n3_1)+gu10.n3_2)<=gu10.a1)))
=> equivalent forward existential formula: [FwdG(Init,(((gu10.n3_0+gu10.n3_1)+gu10.n3_2)<=gu10.a1))] = FALSE
Hit Full ! (commute/partial/dont) 45/0/6
(forward)formula 1,0,0.249763,17528,1,0,43,49255,26,7,2076,27334,40
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((((gu9.s6_0+gu9.s6_1)+gu9.s6_2)<=((gu9.n4_1+gu9.n4_2)+gu9.n4_0)))
=> equivalent forward existential formula: [FwdG(Init,(((gu9.s6_0+gu9.s6_1)+gu9.s6_2)<=((gu9.n4_1+gu9.n4_2)+gu9.n4_0)))] != FALSE
Hit Full ! (commute/partial/dont) 38/0/13
(forward)formula 2,1,0.258377,17792,1,0,45,49992,33,10,2179,28161,43
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AF((((gu12.s3_1+gu12.s3_0)+gu12.s3_2)>((gu12.n6_0+gu12.n6_2)+gu12.n6_1))))
=> equivalent forward existential formula: [FwdG(Init,!((((gu12.s3_1+gu12.s3_0)+gu12.s3_2)>((gu12.n6_0+gu12.n6_2)+gu12.n6_1))))] != FALSE
Hit Full ! (commute/partial/dont) 43/0/8
(forward)formula 3,1,0.260631,18056,1,0,48,50122,41,13,2242,28265,46
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((gu9.CstopAbort<=((gu9.n4_1+gu9.n4_2)+gu9.n4_0)) U (((gi1.gu1.s5_0+gi1.gu1.s5_1)+gi1.gu1.s5_2)>=2))
=> equivalent forward existential formula: [((Init * !(EG(!((((gi1.gu1.s5_0+gi1.gu1.s5_1)+gi1.gu1.s5_2)>=2))))) * !(E(!((((gi1.gu1.s5_0+gi1.gu1.s5_1)+gi1.gu1.s5_2)>=2)) U (!((gu9.CstopAbort<=((gu9.n4_1+gu9.n4_2)+gu9.n4_0))) * !((((gi1.gu1.s5_0+gi1.gu1.s5_1)+gi1.gu1.s5_2)>=2))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions gi0.gu0.malS4_1, gi0.gu0.malS1_1, gi0.gu0.malS1_0, gi0.gu0.malS2_0, gi0.gu0.malS2_1, gi0.malS4_0, gi0.malS4_2, gi2.gu4.malA3, gi2.gu4.malA2, gi2.gu4.malA4, gi2.malA5, malS6_1, malS6_0, malS5_0, malS6_2, malC1_0, malS3_0, malS5_1, malS5_2, malS1_2, malS2_2, malA1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/29/22/51
(forward)formula 4,0,0.577011,26072,1,0,225,102735,158,98,2663,84177,212
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(AF((((gu11.SstopOK_1+gu11.SstopOK_0)+gu11.SstopOK_2)>=2)))
=> equivalent forward existential formula: [FwdG(EY(Init),!((((gu11.SstopOK_1+gu11.SstopOK_0)+gu11.SstopOK_2)>=2)))] = FALSE
Hit Full ! (commute/partial/dont) 48/0/3
(forward)formula 5,0,0.604769,26336,1,0,228,102950,166,101,2716,84773,216
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((gu7.n9_1_2>=1))
=> equivalent forward existential formula: [FwdG(Init,!((gu7.n9_1_2>=1)))] = FALSE
Hit Full ! (commute/partial/dont) 49/0/2
(forward)formula 6,0,0.615109,26600,1,0,232,103225,174,104,2762,85114,219
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((gi0.gu5.s4_0>gi0.gu5.n7_1_0)&&((gu10.n3_0<=gu7.CstopOK_2)||(gi1.gu6.s2_2<=gi1.gu6.n7_2_1))))
=> equivalent forward existential formula: [FwdG(Init,!(((gi0.gu5.s4_0>gi0.gu5.n7_1_0)&&((gu10.n3_0<=gu7.CstopOK_2)||(gi1.gu6.s2_2<=gi1.gu6.n7_2_1)))))] = FALSE
Hit Full ! (commute/partial/dont) 38/0/13
(forward)formula 7,0,0.694013,27920,1,0,235,107621,182,107,2863,89609,222
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((gi2.gu3.n7_0_1<=gi2.gu3.a5))
=> equivalent forward existential formula: [(EY(Init) * (gi2.gu3.n7_0_1<=gi2.gu3.a5))] != FALSE
(forward)formula 8,1,0.703117,28448,1,0,237,107852,183,108,2867,89637,223
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EG((((gu7.Cstart_2<=gu7.Sstart_2)||(gi1.gu6.n7_2_1<=gi1.gu1.s5_1))||((gu12.n6_0>=2)&&(gi0.gu2.n7_2_0>=1)))))
=> equivalent forward existential formula: [FwdG(Init,(((gu7.Cstart_2<=gu7.Sstart_2)||(gi1.gu6.n7_2_1<=gi1.gu1.s5_1))||((gu12.n6_0>=2)&&(gi0.gu2.n7_2_0>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 40/0/11
(forward)formula 9,0,0.763937,29504,1,0,238,112592,190,111,2961,95250,226
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(EG((gu10.n3_1<=gu10.n3_2)))
=> equivalent forward existential formula: [FwdG(EY(Init),(gu10.n3_1<=gu10.n3_2))] != FALSE
Hit Full ! (commute/partial/dont) 48/0/3
(forward)formula 10,1,0.769699,29768,1,0,241,112711,197,114,2998,95531,229
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
(forward)formula 11,1,0.770951,29768,1,0,241,112713,198,116,3009,95583,231
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(AF((gi1.gu6.s2_2<=gu10.n3_2)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((gi1.gu6.s2_2<=gu10.n3_2)))))] != FALSE
(forward)formula 12,1,0.806931,30032,1,0,279,114988,206,144,3014,99199,269
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589857632564

--------------------
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="QuasiCertifProtocol-PT-02"
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"

# 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 QuasiCertifProtocol-PT-02, 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 r126-tajo-158961390900779"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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