fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r111-csrt-158961257700475
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for ParamProductionCell-PT-1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.810 21276.00 38354.00 94.70 TFTFFFTFFFTFTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257700475.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 ParamProductionCell-PT-1, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257700475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 3.8K Apr 13 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 13 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 13 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 13 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 13 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 13 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 13 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 13 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 13 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 13 14:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 13 14:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 13 14:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-1-CTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1590000551798

[2020-05-20 18:49:13] [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-20 18:49:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:49:14] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2020-05-20 18:49:14] [INFO ] Transformed 231 places.
[2020-05-20 18:49:14] [INFO ] Transformed 202 transitions.
[2020-05-20 18:49:14] [INFO ] Found NUPN structural information;
[2020-05-20 18:49:14] [INFO ] Parsed PT model containing 231 places and 202 transitions in 231 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 260 ms. (steps per millisecond=384 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0]
// Phase 1: matrix 202 rows 231 cols
[2020-05-20 18:49:14] [INFO ] Computed 59 place invariants in 19 ms
[2020-05-20 18:49:14] [INFO ] [Real]Absence check using 35 positive place invariants in 60 ms returned sat
[2020-05-20 18:49:14] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 24 ms returned sat
[2020-05-20 18:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:15] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2020-05-20 18:49:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-05-20 18:49:15] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-05-20 18:49:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:15] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2020-05-20 18:49:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2020-05-20 18:49:15] [INFO ] [Nat]Added 68 Read/Feed constraints in 17 ms returned sat
[2020-05-20 18:49:15] [INFO ] Deduced a trap composed of 7 places in 186 ms
[2020-05-20 18:49:16] [INFO ] Deduced a trap composed of 8 places in 322 ms
[2020-05-20 18:49:16] [INFO ] Deduced a trap composed of 29 places in 137 ms
[2020-05-20 18:49:16] [INFO ] Deduced a trap composed of 11 places in 116 ms
[2020-05-20 18:49:16] [INFO ] Deduced a trap composed of 10 places in 307 ms
[2020-05-20 18:49:16] [INFO ] Deduced a trap composed of 59 places in 87 ms
[2020-05-20 18:49:17] [INFO ] Deduced a trap composed of 21 places in 267 ms
[2020-05-20 18:49:17] [INFO ] Deduced a trap composed of 28 places in 134 ms
[2020-05-20 18:49:17] [INFO ] Deduced a trap composed of 41 places in 138 ms
[2020-05-20 18:49:17] [INFO ] Deduced a trap composed of 7 places in 203 ms
[2020-05-20 18:49:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 2160 ms
[2020-05-20 18:49:17] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2020-05-20 18:49:17] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 30 ms returned unsat
[2020-05-20 18:49:17] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2020-05-20 18:49:17] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-05-20 18:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:18] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2020-05-20 18:49:18] [INFO ] [Real]Added 68 Read/Feed constraints in 29 ms returned sat
[2020-05-20 18:49:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2020-05-20 18:49:18] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-05-20 18:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:18] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2020-05-20 18:49:18] [INFO ] [Nat]Added 68 Read/Feed constraints in 72 ms returned sat
[2020-05-20 18:49:19] [INFO ] Deduced a trap composed of 8 places in 878 ms
[2020-05-20 18:49:21] [INFO ] Deduced a trap composed of 6 places in 1225 ms
[2020-05-20 18:49:21] [INFO ] Deduced a trap composed of 10 places in 491 ms
[2020-05-20 18:49:21] [INFO ] Deduced a trap composed of 27 places in 142 ms
[2020-05-20 18:49:21] [INFO ] Deduced a trap composed of 7 places in 93 ms
[2020-05-20 18:49:21] [INFO ] Deduced a trap composed of 25 places in 111 ms
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 7 places in 113 ms
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 10 places in 70 ms
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 55 places in 201 ms
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 85 places in 151 ms
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 19 places in 79 ms
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 8 places in 93 ms
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 5 places in 135 ms
[2020-05-20 18:49:23] [INFO ] Deduced a trap composed of 7 places in 79 ms
[2020-05-20 18:49:23] [INFO ] Deduced a trap composed of 46 places in 111 ms
[2020-05-20 18:49:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 4312 ms
[2020-05-20 18:49:23] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned sat
[2020-05-20 18:49:23] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2020-05-20 18:49:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:23] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2020-05-20 18:49:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 24 ms returned sat
[2020-05-20 18:49:24] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned unsat
[2020-05-20 18:49:24] [INFO ] [Real]Absence check using 35 positive place invariants in 27 ms returned sat
[2020-05-20 18:49:24] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2020-05-20 18:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:24] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2020-05-20 18:49:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 39 ms returned sat
[2020-05-20 18:49:24] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2020-05-20 18:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:24] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2020-05-20 18:49:24] [INFO ] [Nat]Added 68 Read/Feed constraints in 14 ms returned sat
[2020-05-20 18:49:25] [INFO ] Deduced a trap composed of 7 places in 207 ms
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 10 places in 1011 ms
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 8 places in 193 ms
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 16 places in 126 ms
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 79 places in 111 ms
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 46 places in 115 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 5 places in 429 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 21 places in 314 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 25 places in 138 ms
[2020-05-20 18:49:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 2847 ms
[2020-05-20 18:49:27] [INFO ] [Real]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-05-20 18:49:27] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2020-05-20 18:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:27] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2020-05-20 18:49:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2020-05-20 18:49:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-05-20 18:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:28] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2020-05-20 18:49:28] [INFO ] [Nat]Added 68 Read/Feed constraints in 17 ms returned sat
[2020-05-20 18:49:28] [INFO ] Deduced a trap composed of 7 places in 96 ms
[2020-05-20 18:49:28] [INFO ] Deduced a trap composed of 5 places in 89 ms
[2020-05-20 18:49:28] [INFO ] Deduced a trap composed of 7 places in 101 ms
[2020-05-20 18:49:28] [INFO ] Deduced a trap composed of 28 places in 91 ms
[2020-05-20 18:49:28] [INFO ] Deduced a trap composed of 11 places in 80 ms
[2020-05-20 18:49:28] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2020-05-20 18:49:28] [INFO ] Deduced a trap composed of 5 places in 75 ms
[2020-05-20 18:49:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 703 ms
[2020-05-20 18:49:29] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-05-20 18:49:29] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-05-20 18:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:29] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-05-20 18:49:29] [INFO ] [Real]Added 68 Read/Feed constraints in 40 ms returned sat
[2020-05-20 18:49:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 49 ms returned sat
[2020-05-20 18:49:29] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-05-20 18:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:29] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2020-05-20 18:49:29] [INFO ] [Nat]Added 68 Read/Feed constraints in 11 ms returned sat
[2020-05-20 18:49:29] [INFO ] Deduced a trap composed of 7 places in 94 ms
[2020-05-20 18:49:29] [INFO ] Deduced a trap composed of 5 places in 113 ms
[2020-05-20 18:49:29] [INFO ] Deduced a trap composed of 12 places in 99 ms
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 5 places in 120 ms
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 10 places in 97 ms
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 8 places in 119 ms
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 46 places in 125 ms
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 16 places in 127 ms
[2020-05-20 18:49:30] [INFO ] Deduced a trap composed of 8 places in 128 ms
[2020-05-20 18:49:31] [INFO ] Deduced a trap composed of 49 places in 75 ms
[2020-05-20 18:49:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 1384 ms
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-05-20 18:49:31] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-20 18:49:31] [INFO ] Flatten gal took : 94 ms
[2020-05-20 18:49:31] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-20 18:49:31] [INFO ] Flatten gal took : 25 ms
FORMULA ParamProductionCell-PT-1-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-20 18:49:31] [INFO ] Applying decomposition
[2020-05-20 18:49:31] [INFO ] Flatten gal took : 33 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/graph10428598157821604862.txt, -o, /tmp/graph10428598157821604862.bin, -w, /tmp/graph10428598157821604862.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/graph10428598157821604862.bin, -l, -1, -v, -w, /tmp/graph10428598157821604862.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 18:49:31] [INFO ] Decomposing Gal with order
[2020-05-20 18:49:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 18:49:31] [INFO ] Removed a total of 86 redundant transitions.
[2020-05-20 18:49:31] [INFO ] Flatten gal took : 95 ms
[2020-05-20 18:49:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2020-05-20 18:49:31] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 9 ms
[2020-05-20 18:49:31] [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], 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
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
built 18 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 63 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
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,25632,0.185539,8344,682,59,7180,441,665,5649,64,845,0


Converting to forward existential form...Done !
original formula: AG((((i0.i1.u15.table_ready_for_loading==0)||(i0.i1.u20.FB_out==1)) + EX(TRUE)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((i0.i1.u15.table_ready_for_loading==0)||(i0.i1.u20.FB_out==1)))) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions forge_Pstart, PL_lower_Pstart, TL_rot_Pstart, TU_rot_Pstart, DB_trans_Pstart, A2U_ext_Pstart, A2L_ext_Pstart, arm1_unlock_swivel_2, A1L_ext_Pstart, A1U_ext_Pstart, CU_lower_Pstart, CL_lower_Pstart, CL_trans_Pstart, i0.FB_trans_Pstart, i0.i2.FB_deliver_Pstart, i1.PU_lower_Pstart, i3.TL_lower_Pstart, i3.i1.TU_lift_Pstart, i4.i0.arm2_unlock_swivel_2, i5.i0.DB_deliver_Pstart, i6.A1U_rot1_Pstart, i6.A1L_rot3_Pstart, i6.A2L_rot2_Pstart, i6.A2U_rot3_Pstart, i7.A2L_ret_Pstart, i7.A2U_ret_Pstart, i8.A1U_ret_Pstart, i8.A1L_ret_Pstart, i9.CL_lift_Pstart, i9.CU_lift_Pstart, i10.i1.CU_trans_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :40/131/31/202
(forward)formula 0,1,0.255263,10048,1,0,10014,441,2803,12959,281,845,40454
FORMULA ParamProductionCell-PT-1-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(AF(((i4.i1.u23.A2U_out==0)||(i6.u34.A2U_rot1_in==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((i4.i1.u23.A2U_out==0)||(i6.u34.A2U_rot1_in==1))))] = FALSE
(forward)formula 1,1,0.430805,19288,1,0,32128,441,3573,32820,296,916,96263
FORMULA ParamProductionCell-PT-1-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EX(((i8.u61.arm1_retract_ext==0)||(i8.u56.arm1_backward==1))) * AX(FALSE))
=> equivalent forward existential formula: ([(Init * !(EX(((i8.u61.arm1_retract_ext==0)||(i8.u56.arm1_backward==1)))))] = FALSE * [(EY(Init) * !(FALSE))] = FALSE)
(forward)formula 2,0,0.431007,19288,1,0,32139,441,3573,32830,296,916,96353
FORMULA ParamProductionCell-PT-1-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 3,0,0.43106,19288,1,0,32139,441,3573,32830,296,916,96353
FORMULA ParamProductionCell-PT-1-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(EF(((i10.i1.u71.crane_stop_h==0)||(i2.i0.u2.arm1_having_swivel_2==1))) U EG((i5.i0.u25.belt2_stop==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(TRUE U ((i10.i1.u71.crane_stop_h==0)||(i2.i0.u2.arm1_having_swivel_2==1)))),(i5.i0.u25.belt2_stop==1))] != FALSE
(forward)formula 4,0,0.535026,23248,1,0,40712,545,4289,41048,318,1345,137057
FORMULA ParamProductionCell-PT-1-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
(forward)formula 5,1,0.535157,23248,1,0,40712,545,4289,41054,318,1345,137057
FORMULA ParamProductionCell-PT-1-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(EX(((i4.i1.u24.deposit_belt_empty!=0)&&(i10.i0.u68.crane_storing!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((i4.i1.u24.deposit_belt_empty!=0)&&(i10.i0.u68.crane_storing!=1)))))] = FALSE
(forward)formula 6,1,0.696148,30904,1,0,61697,548,4302,58013,320,1357,182409
FORMULA ParamProductionCell-PT-1-CTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EF(((i7.u43.A2U_ret_rs==0)||(i6.u63.A1U_rot1_run==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((i7.u43.A2U_ret_rs==0)||(i6.u63.A1U_rot1_run==1))))] != FALSE
(forward)formula 7,1,0.697629,31168,1,0,61716,548,4307,58049,320,1357,182574
FORMULA ParamProductionCell-PT-1-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1590000573074

--------------------
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="ParamProductionCell-PT-1"
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 ParamProductionCell-PT-1, 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 r111-csrt-158961257700475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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