fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r210-tajo-159033476000668
Last Updated
Jun 28, 2020

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.440 1245078.00 1269992.00 2747.10 TFTFFTTTTTFTTFTF normal

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.r210-tajo-159033476000668.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 ShieldPPPt-PT-020A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476000668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 3.7K May 14 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 19:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 19:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.7K May 13 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 134K May 12 20:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-020A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590610903436

[2020-05-27 20:21:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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-27 20:21:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 20:21:45] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2020-05-27 20:21:45] [INFO ] Transformed 503 places.
[2020-05-27 20:21:45] [INFO ] Transformed 363 transitions.
[2020-05-27 20:21:45] [INFO ] Found NUPN structural information;
[2020-05-27 20:21:45] [INFO ] Parsed PT model containing 503 places and 363 transitions in 152 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 693 ms. (steps per millisecond=144 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 362 rows 503 cols
[2020-05-27 20:21:46] [INFO ] Computed 221 place invariants in 27 ms
[2020-05-27 20:21:47] [INFO ] [Real]Absence check using 221 positive place invariants in 115 ms returned sat
[2020-05-27 20:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:21:47] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2020-05-27 20:21:47] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 34 ms.
[2020-05-27 20:21:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:21:48] [INFO ] [Nat]Absence check using 221 positive place invariants in 114 ms returned sat
[2020-05-27 20:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:21:48] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2020-05-27 20:21:48] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 28 ms.
[2020-05-27 20:21:50] [INFO ] Added : 355 causal constraints over 72 iterations in 2117 ms. Result :sat
[2020-05-27 20:21:51] [INFO ] [Real]Absence check using 221 positive place invariants in 88 ms returned sat
[2020-05-27 20:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:21:51] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2020-05-27 20:21:51] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 41 ms.
[2020-05-27 20:21:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:21:51] [INFO ] [Nat]Absence check using 221 positive place invariants in 95 ms returned sat
[2020-05-27 20:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:21:52] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2020-05-27 20:21:52] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 28 ms.
[2020-05-27 20:21:54] [INFO ] Added : 356 causal constraints over 72 iterations in 2349 ms. Result :sat
[2020-05-27 20:21:54] [INFO ] [Real]Absence check using 221 positive place invariants in 119 ms returned sat
[2020-05-27 20:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:21:55] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2020-05-27 20:21:55] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 16 ms.
[2020-05-27 20:21:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:21:55] [INFO ] [Nat]Absence check using 221 positive place invariants in 76 ms returned sat
[2020-05-27 20:21:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:21:56] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2020-05-27 20:21:56] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 26 ms.
[2020-05-27 20:21:59] [INFO ] Added : 350 causal constraints over 73 iterations in 3045 ms. Result :sat
[2020-05-27 20:21:59] [INFO ] [Real]Absence check using 221 positive place invariants in 94 ms returned sat
[2020-05-27 20:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:22:00] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2020-05-27 20:22:00] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 25 ms.
[2020-05-27 20:22:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:22:00] [INFO ] [Nat]Absence check using 221 positive place invariants in 96 ms returned sat
[2020-05-27 20:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:22:00] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2020-05-27 20:22:01] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 45 ms.
[2020-05-27 20:22:04] [INFO ] Added : 357 causal constraints over 72 iterations in 3749 ms. Result :sat
[2020-05-27 20:22:04] [INFO ] [Real]Absence check using 221 positive place invariants in 76 ms returned sat
[2020-05-27 20:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:22:05] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2020-05-27 20:22:05] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 23 ms.
[2020-05-27 20:22:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:22:05] [INFO ] [Nat]Absence check using 221 positive place invariants in 76 ms returned sat
[2020-05-27 20:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:22:06] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2020-05-27 20:22:06] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 28 ms.
[2020-05-27 20:22:08] [INFO ] Added : 356 causal constraints over 73 iterations in 2825 ms. Result :sat
[2020-05-27 20:22:09] [INFO ] [Real]Absence check using 221 positive place invariants in 100 ms returned sat
[2020-05-27 20:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:22:09] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2020-05-27 20:22:09] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 29 ms.
[2020-05-27 20:22:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:22:10] [INFO ] [Nat]Absence check using 221 positive place invariants in 100 ms returned sat
[2020-05-27 20:22:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:22:10] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2020-05-27 20:22:10] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 29 ms.
[2020-05-27 20:22:13] [INFO ] Added : 349 causal constraints over 72 iterations in 2380 ms. Result :sat
[2020-05-27 20:22:13] [INFO ] Flatten gal took : 120 ms
[2020-05-27 20:22:13] [INFO ] Flatten gal took : 51 ms
[2020-05-27 20:22:13] [INFO ] Applying decomposition
[2020-05-27 20:22:13] [INFO ] Flatten gal took : 31 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/graph3291334989684398999.txt, -o, /tmp/graph3291334989684398999.bin, -w, /tmp/graph3291334989684398999.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/graph3291334989684398999.bin, -l, -1, -v, -w, /tmp/graph3291334989684398999.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 20:22:13] [INFO ] Decomposing Gal with order
[2020-05-27 20:22:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 20:22:13] [INFO ] Removed a total of 60 redundant transitions.
[2020-05-27 20:22:13] [INFO ] Flatten gal took : 86 ms
[2020-05-27 20:22:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 23 ms.
[2020-05-27 20:22:13] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 9 ms
[2020-05-27 20:22:13] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.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/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 30 ordering constraints for composite.
built 22 ordering constraints for composite.
built 23 ordering constraints for composite.
built 19 ordering constraints for composite.
built 18 ordering constraints for composite.
built 21 ordering constraints for composite.
built 16 ordering constraints for composite.
built 20 ordering constraints for composite.
built 32 ordering constraints for composite.
built 21 ordering constraints for composite.
built 21 ordering constraints for composite.
built 23 ordering constraints for composite.
built 19 ordering constraints for composite.
built 24 ordering constraints for composite.
built 19 ordering constraints for composite.
built 21 ordering constraints for composite.
built 21 ordering constraints for composite.
built 23 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 18 ordering constraints for composite.
built 21 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,2.19902e+72,17.85,448320,186,15,848932,525,589,2.6589e+06,33,3330,0


Converting to forward existential form...Done !
original formula: !(E(((i16.i1.i1.u142.p447!=1)&&((i16.i1.i1.u138.p432!=1)||(i16.i1.i1.u138.p434!=1))) U AG(((i11.u91.p286==1)&&(i11.u93.p296==1)))))
=> equivalent forward existential formula: [(FwdU(Init,((i16.i1.i1.u142.p447!=1)&&((i16.i1.i1.u138.p432!=1)||(i16.i1.i1.u138.p434!=1)))) * !(E(TRUE U !(((i11.u91.p286==1)&&(i11.u93.p296==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,17.9716,448320,1,0,848932,525,2598,2.6589e+06,125,3330,10665
FORMULA ShieldPPPt-PT-020A-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX(((i3.u42.p132==1)&&(i3.u42.p134==1))) + AG(((((i10.u84.p265==1)&&(i10.u95.p299==1))||(i4.u20.p67!=1))||(i4.u20.p69!=1))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EX(!(((i3.u42.p132==1)&&(i3.u42.p134==1))))))),TRUE) * !(((((i10.u84.p265==1)&&(i10.u95.p299==1))||(i4.u20.p67!=1))||(i4.u20.p69!=1))))] = FALSE
(forward)formula 1,0,33.8311,497808,1,0,916203,525,3635,2.98209e+06,141,3330,620230
FORMULA ShieldPPPt-PT-020A-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((E(((i6.u44.p142!=1)||(i6.u44.p144!=1)) U ((i1.u12.p42==1)&&(i1.u12.p44==1))) * (EF(((i0.u1.p4==1)&&(i0.u6.p23==1))) + EX((i14.u117.p370==1)))) * (AF((((i16.i1.i0.u139.p437==1)&&(i16.i1.i0.u139.p439==1))||((i0.u0.p2==1)&&(i0.u3.p10==1)))) + EF((((i11.u90.p281==1)&&(i11.u93.p296==1))||(i18.u156.p490==1)))))
=> equivalent forward existential formula: (([(Init * !(E(((i6.u44.p142!=1)||(i6.u44.p144!=1)) U ((i1.u12.p42==1)&&(i1.u12.p44==1)))))] = FALSE * [((Init * !(EX((i14.u117.p370==1)))) * !(E(TRUE U ((i0.u1.p4==1)&&(i0.u6.p23==1)))))] = FALSE) * [FwdG((Init * !(E(TRUE U (((i11.u90.p281==1)&&(i11.u93.p296==1))||(i18.u156.p490==1))))),!((((i16.i1.i0.u139.p437==1)&&(i16.i1.i0.u139.p439==1))||((i0.u0.p2==1)&&(i0.u3.p10==1)))))] = FALSE)
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 2,1,34.2268,513384,1,0,953788,525,4101,3.05531e+06,145,3330,671374
FORMULA ShieldPPPt-PT-020A-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(E(((i16.i0.i2.u148.p466!=1)||(i16.i1.i2.u152.p477!=1)) U (((i15.u126.p397==1)&&(i10.u81.p253==1))&&(i10.u88.p276==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(((i16.i0.i2.u148.p466!=1)||(i16.i1.i2.u152.p477!=1)) U (((i15.u126.p397==1)&&(i10.u81.p253==1))&&(i10.u88.p276==1)))))] = FALSE
(forward)formula 3,0,37.6276,578032,1,0,1.04313e+06,528,4145,3.51691e+06,146,3330,697408
FORMULA ShieldPPPt-PT-020A-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(!(EF(((i10.u88.p276==1)||((i7.u51.p161==1)&&(i7.u53.p171==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i10.u88.p276==1)||((i7.u51.p161==1)&&(i7.u53.p171==1))))))] != FALSE
(forward)formula 4,0,37.6521,579088,1,0,1.04546e+06,528,4153,3.52163e+06,146,3330,701462
FORMULA ShieldPPPt-PT-020A-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((EF((i11.u94.p297==1)) + (((((i2.u18.p58==1)&&(i1.u23.p75==1))&&(i8.u68.p215==1))&&(i8.u79.p249==1))&&((i2.u21.p70!=1)||(i2.u27.p85!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (i11.u94.p297==1)) + (((((i2.u18.p58==1)&&(i1.u23.p75==1))&&(i8.u68.p215==1))&&(i8.u79.p249==1))&&((i2.u21.p70!=1)||(i2.u27.p85!=1))))))] = FALSE
(forward)formula 5,1,37.6542,579352,1,0,1.04554e+06,528,4189,3.52176e+06,148,3330,701684
FORMULA ShieldPPPt-PT-020A-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EF((((i12.u100.p318==1)&&(i12.u103.p325==1))&&((i2.u19.p63!=1)||(i2.u24.p77!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i12.u100.p318==1)&&(i12.u103.p325==1))&&((i2.u19.p63!=1)||(i2.u24.p77!=1))))))] = FALSE
(forward)formula 6,1,37.6581,579352,1,0,1.04578e+06,528,4206,3.52219e+06,149,3330,702215
FORMULA ShieldPPPt-PT-020A-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((EX(((i0.u1.p3==1)&&(i0.u8.p26==1))) + EF(((i5.u34.p107==1)&&(i5.u34.p109==1)))) + E(((i3.u42.p132==1)&&(i3.u42.p134==1)) U ((i6.u44.p142==1)&&(i6.u44.p144==1))))
=> equivalent forward existential formula: (([(EY(Init) * ((i0.u1.p3==1)&&(i0.u8.p26==1)))] != FALSE + [(FwdU(Init,TRUE) * ((i5.u34.p107==1)&&(i5.u34.p109==1)))] != FALSE) + [(FwdU(Init,((i3.u42.p132==1)&&(i3.u42.p134==1))) * ((i6.u44.p142==1)&&(i6.u44.p144==1)))] != FALSE)
(forward)formula 7,1,37.659,579616,1,0,1.04581e+06,528,4216,3.52223e+06,149,3330,702301
FORMULA ShieldPPPt-PT-020A-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EG(AG(((((i12.u92.p292==1)&&(i12.u92.p294==1))&&(i5.u33.p104==1))&&(i5.u38.p123==1)))) + EF(((i17.u125.p395==1)||(i9.u70.p222==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(E(TRUE U !(((((i12.u92.p292==1)&&(i12.u92.p294==1))&&(i5.u33.p104==1))&&(i5.u38.p123==1))))))] != FALSE + [(FwdU(Init,TRUE) * ((i17.u125.p395==1)||(i9.u70.p222==1)))] != FALSE)
(forward)formula 8,1,37.6606,579616,1,0,1.04587e+06,528,4231,3.5223e+06,149,3330,702441
FORMULA ShieldPPPt-PT-020A-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((AF(((i7.u58.p183==1)&&(i7.u63.p200==1))) * ((i13.u108.p343!=1)||(i12.u111.p350!=1))) * ((i15.u126.p397==1)||((i6.u49.p153==1)&&(i7.u56.p176==1)))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((i15.u126.p397==1)||((i6.u49.p153==1)&&(i7.u56.p176==1)))) * ((i13.u108.p343!=1)||(i12.u111.p350!=1))) * !(EG(!(((i7.u58.p183==1)&&(i7.u63.p200==1))))))] != FALSE
(forward)formula 9,1,37.6665,580144,1,0,1.04657e+06,528,4262,3.52366e+06,149,3330,702879
FORMULA ShieldPPPt-PT-020A-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2020-05-27 20:42:23] [INFO ] Applying decomposition
[2020-05-27 20:42:23] [INFO ] Flatten gal took : 70 ms
[2020-05-27 20:42:23] [INFO ] Decomposing Gal with order
[2020-05-27 20:42:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 20:42:23] [INFO ] Removed a total of 120 redundant transitions.
[2020-05-27 20:42:23] [INFO ] Flatten gal took : 46 ms
[2020-05-27 20:42:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 28 ms.
[2020-05-27 20:42:23] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 27 ms
[2020-05-27 20:42:23] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 5 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/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
built 221 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 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,2.19902e+72,1.38061,55172,332,5,113877,562,995,156027,12,436,0


Converting to forward existential form...Done !
original formula: !(E((((i130.u229.p408!=1)||(u238.p425!=1))||((i42.u285.p130==1)&&(u83.p147==1))) U AF((u15.p26==1))))
=> equivalent forward existential formula: [(FwdU(Init,(((i130.u229.p408!=1)||(u238.p425!=1))||((i42.u285.p130==1)&&(u83.p147==1)))) * !(EG(!((u15.p26==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 81
Fast SCC detection found an SCC at level 82
Fast SCC detection found an SCC at level 83
Fast SCC detection found an SCC at level 84
Fast SCC detection found an SCC at level 85
Fast SCC detection found an SCC at level 86
Fast SCC detection found an SCC at level 87
Fast SCC detection found an SCC at level 88
Fast SCC detection found an SCC at level 89
Fast SCC detection found an SCC at level 90
Fast SCC detection found an SCC at level 91
Fast SCC detection found an SCC at level 92
Fast SCC detection found an SCC at level 93
Fast SCC detection found an SCC at level 94
Fast SCC detection found an SCC at level 95
Fast SCC detection found an SCC at level 96
Fast SCC detection found an SCC at level 97
Fast SCC detection found an SCC at level 98
Fast SCC detection found an SCC at level 99
Fast SCC detection found an SCC at level 100
Fast SCC detection found an SCC at level 101
Fast SCC detection found an SCC at level 102
Fast SCC detection found an SCC at level 103
Fast SCC detection found an SCC at level 104
Fast SCC detection found an SCC at level 105
Fast SCC detection found an SCC at level 106
Fast SCC detection found an SCC at level 107
Fast SCC detection found an SCC at level 108
Fast SCC detection found an SCC at level 109
Fast SCC detection found an SCC at level 110
Fast SCC detection found an SCC at level 111
Fast SCC detection found an SCC at level 112
Fast SCC detection found an SCC at level 113
Fast SCC detection found an SCC at level 114
Fast SCC detection found an SCC at level 115
Fast SCC detection found an SCC at level 116
Fast SCC detection found an SCC at level 117
Fast SCC detection found an SCC at level 118
Fast SCC detection found an SCC at level 119
Fast SCC detection found an SCC at level 120
Fast SCC detection found an SCC at level 121
Fast SCC detection found an SCC at level 122
Fast SCC detection found an SCC at level 123
Fast SCC detection found an SCC at level 124
Fast SCC detection found an SCC at level 125
Fast SCC detection found an SCC at level 126
Fast SCC detection found an SCC at level 127
Fast SCC detection found an SCC at level 128
Fast SCC detection found an SCC at level 129
Fast SCC detection found an SCC at level 130
Fast SCC detection found an SCC at level 131
Fast SCC detection found an SCC at level 132
Fast SCC detection found an SCC at level 133
Fast SCC detection found an SCC at level 134
Fast SCC detection found an SCC at level 135
Fast SCC detection found an SCC at level 136
Fast SCC detection found an SCC at level 137
Fast SCC detection found an SCC at level 138
Fast SCC detection found an SCC at level 139
Fast SCC detection found an SCC at level 140
Fast SCC detection found an SCC at level 141
Fast SCC detection found an SCC at level 142
Fast SCC detection found an SCC at level 143
Fast SCC detection found an SCC at level 144
Fast SCC detection found an SCC at level 145
Fast SCC detection found an SCC at level 146
Fast SCC detection found an SCC at level 147
Fast SCC detection found an SCC at level 148
Fast SCC detection found an SCC at level 149
Fast SCC detection found an SCC at level 150
Fast SCC detection found an SCC at level 151
Fast SCC detection found an SCC at level 152
Fast SCC detection found an SCC at level 153
Fast SCC detection found an SCC at level 154
Fast SCC detection found an SCC at level 155
Fast SCC detection found an SCC at level 156
Fast SCC detection found an SCC at level 157
Fast SCC detection found an SCC at level 158
Fast SCC detection found an SCC at level 159
Fast SCC detection found an SCC at level 160
Fast SCC detection found an SCC at level 161
(forward)formula 0,0,3.83224,109412,1,0,243429,562,5361,312252,48,436,411038
FORMULA ShieldPPPt-PT-020A-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(E(((i75.u133.p236!=1)||(u138.p246!=1)) U (((i3.u7.p11==1)&&(u12.p21==1))||((i4.u298.p15==1)&&(u28.p49==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),((i75.u133.p236!=1)||(u138.p246!=1))) * (((i3.u7.p11==1)&&(u12.p21==1))||((i4.u298.p15==1)&&(u28.p49==1))))] != FALSE
(forward)formula 1,1,4.23312,127892,1,0,287078,562,5657,364832,49,436,497296
FORMULA ShieldPPPt-PT-020A-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((i28.u52.p91==1)&&(u57.p102==1))&&(u153.p272==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i28.u52.p91==1)&&(u57.p102==1))&&(u153.p272==1)))] != FALSE
(forward)formula 2,1,4.23444,128420,1,0,287215,562,5664,364970,49,436,497513
FORMULA ShieldPPPt-PT-020A-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((AX(((i107.u189.p337!=1)||(i107.u190.p339!=1))) * ((i44.u80.p141!=1)||(u85.p152!=1))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(((i107.u189.p337!=1)||(i107.u190.p339!=1))))] = FALSE * [(FwdU(Init,TRUE) * !(((i44.u80.p141!=1)||(u85.p152!=1))))] = FALSE)
(forward)formula 3,0,4.23648,128684,1,0,287453,562,5668,365210,49,436,497756
FORMULA ShieldPPPt-PT-020A-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((i59.u106.p188==1)&&(u113.p202==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i59.u106.p188==1)&&(u113.p202==1)))] != FALSE
(forward)formula 4,1,4.23749,128684,1,0,287554,562,5673,365317,49,436,497969
FORMULA ShieldPPPt-PT-020A-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF(((u268.p478==1)&&(u281.p501==1))) * E((((u139.p247!=1)||(i148.u262.p467!=1))||(i148.u263.p469!=1)) U ((u250.p445==1)&&(i147.u342.p460==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(((u268.p478==1)&&(u281.p501==1))))] = FALSE * [(Init * !(E((((u139.p247!=1)||(i148.u262.p467!=1))||(i148.u263.p469!=1)) U ((u250.p445==1)&&(i147.u342.p460==1)))))] = FALSE)
(forward)formula 5,0,4.66464,144260,1,0,319492,562,6837,408650,50,436,568551
FORMULA ShieldPPPt-PT-020A-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1590612148514

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="ShieldPPPt-PT-020A"
export BK_EXAMINATION="CTLFireability"
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 ShieldPPPt-PT-020A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-tajo-159033476000668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020A.tgz
mv ShieldPPPt-PT-020A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;