Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r006-smll-158897516000396.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 AutoFlight-PT-02b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-smll-158897516000396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.0K Mar 25 23:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 23:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 10:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 10:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 48K 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 AutoFlight-PT-02b-CTLFireability-00
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-01
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-02
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-03
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-04
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-05
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-06
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-07
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-08
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-09
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-10
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-11
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-12
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-13
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-14
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589529990868

[2020-05-15 08:06:33] [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-15 08:06:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 08:06:33] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2020-05-15 08:06:33] [INFO ] Transformed 206 places.
[2020-05-15 08:06:33] [INFO ] Transformed 204 transitions.
[2020-05-15 08:06:33] [INFO ] Found NUPN structural information;
[2020-05-15 08:06:33] [INFO ] Parsed PT model containing 206 places and 204 transitions in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Incomplete random walk after 100000 steps, including 883 resets, run finished after 448 ms. (steps per millisecond=223 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 204 rows 206 cols
[2020-05-15 08:06:34] [INFO ] Computed 16 place invariants in 13 ms
[2020-05-15 08:06:34] [INFO ] [Real]Absence check using 15 positive place invariants in 28 ms returned unsat
[2020-05-15 08:06:34] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2020-05-15 08:06:34] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 08:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:06:34] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2020-05-15 08:06:34] [INFO ] Deduced a trap composed of 34 places in 122 ms
[2020-05-15 08:06:34] [INFO ] Deduced a trap composed of 28 places in 131 ms
[2020-05-15 08:06:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2020-05-15 08:06:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:06:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 127 ms returned sat
[2020-05-15 08:06:35] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 10 ms returned sat
[2020-05-15 08:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:06:35] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2020-05-15 08:06:35] [INFO ] Deduced a trap composed of 34 places in 125 ms
[2020-05-15 08:06:35] [INFO ] Deduced a trap composed of 28 places in 74 ms
[2020-05-15 08:06:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2020-05-15 08:06:35] [INFO ] Computed and/alt/rep : 203/275/203 causal constraints in 23 ms.
[2020-05-15 08:06:36] [INFO ] Added : 184 causal constraints over 38 iterations in 1065 ms. Result :sat
[2020-05-15 08:06:36] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2020-05-15 08:06:36] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 08:06:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:06:36] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-05-15 08:06:37] [INFO ] Computed and/alt/rep : 203/275/203 causal constraints in 25 ms.
[2020-05-15 08:06:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:06:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 90 ms returned sat
[2020-05-15 08:06:37] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 08:06:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:06:37] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2020-05-15 08:06:37] [INFO ] Computed and/alt/rep : 203/275/203 causal constraints in 29 ms.
[2020-05-15 08:06:38] [INFO ] Added : 170 causal constraints over 35 iterations in 768 ms. Result :sat
[2020-05-15 08:06:38] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2020-05-15 08:06:38] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 3 ms returned sat
[2020-05-15 08:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:06:38] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2020-05-15 08:06:38] [INFO ] Deduced a trap composed of 58 places in 114 ms
[2020-05-15 08:06:38] [INFO ] Deduced a trap composed of 34 places in 96 ms
[2020-05-15 08:06:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 235 ms
[2020-05-15 08:06:38] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2020-05-15 08:06:38] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 08:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:06:39] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2020-05-15 08:06:39] [INFO ] Deduced a trap composed of 41 places in 101 ms
[2020-05-15 08:06:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2020-05-15 08:06:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:06:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 155 ms returned sat
[2020-05-15 08:06:39] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 3 ms returned sat
[2020-05-15 08:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:06:39] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2020-05-15 08:06:39] [INFO ] Deduced a trap composed of 41 places in 119 ms
[2020-05-15 08:06:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2020-05-15 08:06:39] [INFO ] Computed and/alt/rep : 203/275/203 causal constraints in 31 ms.
[2020-05-15 08:06:40] [INFO ] Added : 188 causal constraints over 38 iterations in 1011 ms. Result :sat
[2020-05-15 08:06:41] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned unsat
[2020-05-15 08:06:41] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2020-05-15 08:06:41] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 08:06:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:06:41] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2020-05-15 08:06:41] [INFO ] Deduced a trap composed of 28 places in 104 ms
[2020-05-15 08:06:41] [INFO ] Deduced a trap composed of 40 places in 105 ms
[2020-05-15 08:06:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2020-05-15 08:06:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:06:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 144 ms returned sat
[2020-05-15 08:06:41] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 08:06:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:06:42] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2020-05-15 08:06:42] [INFO ] Deduced a trap composed of 36 places in 82 ms
[2020-05-15 08:06:42] [INFO ] Deduced a trap composed of 30 places in 111 ms
[2020-05-15 08:06:42] [INFO ] Deduced a trap composed of 34 places in 93 ms
[2020-05-15 08:06:42] [INFO ] Deduced a trap composed of 40 places in 82 ms
[2020-05-15 08:06:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 445 ms
[2020-05-15 08:06:42] [INFO ] Computed and/alt/rep : 203/275/203 causal constraints in 63 ms.
[2020-05-15 08:06:43] [INFO ] Added : 201 causal constraints over 41 iterations in 924 ms. Result :sat
[2020-05-15 08:06:43] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2020-05-15 08:06:43] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 3 ms returned sat
[2020-05-15 08:06:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:06:43] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2020-05-15 08:06:43] [INFO ] Deduced a trap composed of 15 places in 114 ms
[2020-05-15 08:06:44] [INFO ] Deduced a trap composed of 30 places in 88 ms
[2020-05-15 08:06:44] [INFO ] Deduced a trap composed of 38 places in 77 ms
[2020-05-15 08:06:44] [INFO ] Deduced a trap composed of 55 places in 87 ms
[2020-05-15 08:06:44] [INFO ] Deduced a trap composed of 34 places in 79 ms
[2020-05-15 08:06:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 550 ms
[2020-05-15 08:06:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:06:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 143 ms returned sat
[2020-05-15 08:06:44] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 08:06:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:06:44] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2020-05-15 08:06:44] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2020-05-15 08:06:45] [INFO ] Deduced a trap composed of 30 places in 128 ms
[2020-05-15 08:06:45] [INFO ] Deduced a trap composed of 38 places in 110 ms
[2020-05-15 08:06:45] [INFO ] Deduced a trap composed of 55 places in 67 ms
[2020-05-15 08:06:45] [INFO ] Deduced a trap composed of 34 places in 81 ms
[2020-05-15 08:06:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 532 ms
[2020-05-15 08:06:45] [INFO ] Computed and/alt/rep : 203/275/203 causal constraints in 15 ms.
[2020-05-15 08:06:46] [INFO ] Added : 203 causal constraints over 41 iterations in 839 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-15 08:06:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 08:06:46] [INFO ] Flatten gal took : 81 ms
[2020-05-15 08:06:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 08:06:46] [INFO ] Flatten gal took : 28 ms
FORMULA AutoFlight-PT-02b-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 08:06:46] [INFO ] Applying decomposition
[2020-05-15 08:06:46] [INFO ] Flatten gal took : 21 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/graph357241427832882029.txt, -o, /tmp/graph357241427832882029.bin, -w, /tmp/graph357241427832882029.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/graph357241427832882029.bin, -l, -1, -v, -w, /tmp/graph357241427832882029.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 08:06:46] [INFO ] Decomposing Gal with order
[2020-05-15 08:06:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 08:06:46] [INFO ] Removed a total of 20 redundant transitions.
[2020-05-15 08:06:46] [INFO ] Flatten gal took : 142 ms
[2020-05-15 08:06:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2020-05-15 08:06:46] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 11 ms
[2020-05-15 08:06:46] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/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 15 CTL formulae.
built 29 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 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,1.61545e+13,0.714208,24680,3553,21,40142,258,502,64168,33,748,0


Converting to forward existential form...Done !
original formula: (EX(!(AF((i5.u32.p85==1)))) + AX(((i2.i2.u18.p48==1) * AX((i14.i1.u82.p198==1)))))
=> equivalent forward existential formula: ([(EY((Init * !(EX(!(!(EG(!((i5.u32.p85==1))))))))) * !((i2.i2.u18.p48==1)))] = FALSE * [(EY(EY((Init * !(EX(!(!(EG(!((i5.u32.p85==1)))))))))) * !((i14.i1.u82.p198==1)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t196, t197, t198, t199, i0.t89, i0.i1.t91, i1.i0.t169, i1.i0.u7.t0, i1.i0.u7.t1, i1.i0.u7.t2, i1.i0.u8.t162, i2.t150, i2.i0.t7, i2.i0.t9, i2.i0.u13.t6, i2.i0.u13.t8, i2.i2.u18.t142, i3.i0.t137, i3.i0.u20.t130, i3.i0.u23.t10, i3.i0.u23.t11, i3.i0.u23.t12, i4.i1.t127, i4.i1.u26.t13, i4.i1.u26.t14, i4.i1.u26.t15, i4.i1.u27.t120, i5.t117, i5.t19, i5.t17, i5.u29.t16, i5.u29.t18, i5.u34.t109, i6.t94, i6.u35.t104, i7.i0.t78, i7.i0.u44.t88, i8.t73, i8.i1.t75, i10.i0.t69, i10.i0.u53.t72, i12.i1.t50, i12.i1.u71.t53, i13.i0.t160, i13.i0.u9.t153, i13.i0.u12.t3, i13.i0.u12.t4, i13.i0.u12.t5, i14.i0.t38, i14.i0.u80.t41, i15.i1.t57, i15.i1.u68.t60, i15.i2.t29, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/151/53/204
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,525.468,2782616,1,0,4.51771e+06,258,1486,6.88285e+06,85,748,3255359
FORMULA AutoFlight-PT-02b-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((((i14.i0.u80.p194==1)&&(i15.i2.u86.p202==1))&&(i1.i0.u7.p19!=1)) * EF(((i8.i1.u49.p123==1)&&(i8.i1.u79.p193==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((((i14.i0.u80.p194==1)&&(i15.i2.u86.p202==1))&&(i1.i0.u7.p19!=1)) * E(TRUE U ((i8.i1.u49.p123==1)&&(i8.i1.u79.p193==1))))))] = FALSE
(forward)formula 1,0,598.701,3064832,1,0,5.2309e+06,258,975,7.99987e+06,70,748,1940042
FORMULA AutoFlight-PT-02b-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX(((i2.i1.u14.p37==1)&&(i5.u66.p161==1))) + EG((i8.i1.u48.p122!=1)))
=> equivalent forward existential formula: [(EY((Init * !(EG((i8.i1.u48.p122!=1))))) * !(((i2.i1.u14.p37==1)&&(i5.u66.p161==1))))] = FALSE
(forward)formula 2,1,810.895,3405656,1,0,6.09033e+06,258,996,8.45729e+06,75,748,2035630
FORMULA AutoFlight-PT-02b-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((!(AG((i10.i1.u52.p128==1))) * E((i12.i1.u75.p180==1) U (i7.i2.u47.p116==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(!(E(TRUE U !((i10.i1.u52.p128==1))))) * E((i12.i1.u75.p180==1) U (i7.i2.u47.p116==1)))))] = FALSE
(forward)formula 3,0,835.064,3405656,1,0,6.09033e+06,258,1716,8.45729e+06,88,748,3408321
FORMULA AutoFlight-PT-02b-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF((((((i0.i0.u4.p10==1)||((i5.u32.p85==1)&&(i9.u55.p133==1)))||(i8.i1.u48.p121==1))||(i0.i1.u41.p105==1)) + EX(((i5.u32.p85==1)&&(i9.u55.p133==1))))) * EF(((((i1.i1.u5.p20==1)&&(i13.i1.u72.p172==1))&&(i2.i2.u19.p49==1))&&(i10.i1.u52.p128==1))))
=> equivalent forward existential formula: ([FwdG(Init,!((((((i0.i0.u4.p10==1)||((i5.u32.p85==1)&&(i9.u55.p133==1)))||(i8.i1.u48.p121==1))||(i0.i1.u41.p105==1)) + EX(((i5.u32.p85==1)&&(i9.u55.p133==1))))))] = FALSE * [(Init * !(E(TRUE U ((((i1.i1.u5.p20==1)&&(i13.i1.u72.p172==1))&&(i2.i2.u19.p49==1))&&(i10.i1.u52.p128==1)))))] = FALSE)
(forward)formula 4,1,835.814,3405656,1,0,6.09033e+06,258,1752,8.45729e+06,89,748,3507290
FORMULA AutoFlight-PT-02b-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AX((((i4.i1.u26.p65!=1)||(i11.u64.p158==1)) * AF((i7.i2.u46.p114==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(((i4.i1.u26.p65!=1)||(i11.u64.p158==1))))] != FALSE + [FwdG(EY(Init),!((i7.i2.u46.p114==1)))] != FALSE)
(forward)formula 5,1,841.315,3405656,1,0,6.09033e+06,313,2346,8.45729e+06,106,968,3941954
FORMULA AutoFlight-PT-02b-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EF(((((i15.i1.u68.p165==1)&&(i15.i2.u86.p202==1))&&(i5.u33.p84==1))&&((i3.i1.u21.p59==1)||(i5.u28.p88==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i15.i1.u68.p165==1)&&(i15.i2.u86.p202==1))&&(i5.u33.p84==1))&&((i3.i1.u21.p59==1)||(i5.u28.p88==1))))))] = FALSE
(forward)formula 6,0,870.375,3405656,1,0,6.09033e+06,313,2362,8.68307e+06,106,969,5199511
FORMULA AutoFlight-PT-02b-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AF(((i13.i0.u11.p28==1)||(i13.i0.u9.p32==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((i13.i0.u11.p28==1)||(i13.i0.u9.p32==1))))] != FALSE
(forward)formula 7,1,871.683,3405656,1,0,6.09033e+06,313,2444,8.74158e+06,106,970,5301222
FORMULA AutoFlight-PT-02b-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((AF((i10.i1.u52.p128!=1)) + EG(((i9.u57.p137==1)&&(i12.i1.u75.p179==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((i10.i1.u52.p128!=1)))) + EG(((i9.u57.p137==1)&&(i12.i1.u75.p179==1)))))] != FALSE
(forward)formula 8,1,998.9,3744828,1,0,7.06988e+06,313,975,1.01378e+07,70,976,3642063
FORMULA AutoFlight-PT-02b-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((i3.i1.u22.p56!=1) U EX((i5.u31.p80==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(EX((i5.u31.p80==1)))))) * !(E(!(EX((i5.u31.p80==1))) U (!((i3.i1.u22.p56!=1)) * !(EX((i5.u31.p80==1)))))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2020-05-15 08:26:51] [INFO ] Applying decomposition
[2020-05-15 08:26:51] [INFO ] Flatten gal took : 12 ms
[2020-05-15 08:26:51] [INFO ] Decomposing Gal with order
[2020-05-15 08:26:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 08:26:51] [INFO ] Removed a total of 6 redundant transitions.
[2020-05-15 08:26:51] [INFO ] Flatten gal took : 22 ms
[2020-05-15 08:26:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 7 ms.
[2020-05-15 08:26:51] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 6 ms
[2020-05-15 08:26:51] [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 6 CTL formulae.
built 2 ordering constraints for composite.
built 22 ordering constraints for composite.
built 21 ordering constraints for composite.
built 20 ordering constraints for composite.
built 19 ordering constraints for composite.
built 18 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 23 ordering constraints for composite.
built 26 ordering constraints for composite.
built 22 ordering constraints for composite.
built 18 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,1.61545e+13,16.8786,501892,14705,556,571831,1668,350,5.10282e+06,184,12193,0


Converting to forward existential form...Done !
original formula: A((i0.i0.i0.i0.i0.i0.i0.u13.p56!=1) U EX((i0.i0.i0.i0.i0.u15.p80==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(EX((i0.i0.i0.i0.i0.u15.p80==1)))))) * !(E(!(EX((i0.i0.i0.i0.i0.u15.p80==1))) U (!((i0.i0.i0.i0.i0.i0.i0.u13.p56!=1)) * !(EX((i0.i0.i0.i0.i0.u15.p80==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t73, i0.u19.t75, i0.i0.u18.t78, i0.i0.u18.t88, i0.i0.i0.t89, i0.i0.i0.u17.t91, i0.i0.i0.i0.u16.t94, i0.i0.i0.i0.u16.t104, i0.i0.i0.i0.i0.u15.t16, i0.i0.i0.i0.i0.u15.t17, i0.i0.i0.i0.i0.u15.t18, i0.i0.i0.i0.i0.u15.t19, i0.i0.i0.i0.i0.u15.t109, i0.i0.i0.i0.i0.u15.t117, i0.i0.i0.i0.i0.i0.u14.t13, i0.i0.i0.i0.i0.i0.u14.t14, i0.i0.i0.i0.i0.i0.u14.t15, i0.i0.i0.i0.i0.i0.u14.t120, i0.i0.i0.i0.i0.i0.u14.t127, i0.i0.i0.i0.i0.i0.i0.u13.t10, i0.i0.i0.i0.i0.i0.i0.u13.t11, i0.i0.i0.i0.i0.i0.i0.u13.t12, i0.i0.i0.i0.i0.i0.i0.u13.t130, i0.i0.i0.i0.i0.i0.i0.u13.t137, i0.i0.i0.i0.i0.i0.i0.i0.u12.t6, i0.i0.i0.i0.i0.i0.i0.i0.u12.t7, i0.i0.i0.i0.i0.i0.i0.i0.u12.t8, i0.i0.i0.i0.i0.i0.i0.i0.u12.t9, i0.i0.i0.i0.i0.i0.i0.i0.u12.t142, i0.i0.i0.i0.i0.i0.i0.i0.u12.t150, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t0, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t1, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t2, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t162, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t169, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t3, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t4, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t5, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t153, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t160, i1.t196, i1.u28.t29, i1.i0.u27.t38, i1.i0.u27.t41, i1.i0.i0.u26.t50, i1.i0.i0.u26.t53, i1.i0.i0.i0.u24.t69, i1.i0.i0.i0.u24.t72, i1.i0.i0.i0.u25.t57, i1.i0.i0.i0.u25.t60, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/148/50/198
Detected timeout of ITS tools.
[2020-05-15 08:46:55] [INFO ] Flatten gal took : 22 ms
[2020-05-15 08:46:55] [INFO ] Input system was already deterministic with 204 transitions.
[2020-05-15 08:46:55] [INFO ] Transformed 206 places.
[2020-05-15 08:46:55] [INFO ] Transformed 204 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-15 08:46:55] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 2 ms
[2020-05-15 08:46:55] [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, --load-order, /home/mcc/execution/model.ord, --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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61545e+13,9.92471,211192,2,85205,5,748477,6,0,1030,1.24246e+06,0


Converting to forward existential form...Done !
original formula: A((p56!=1) U EX((p80==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(EX((p80==1)))))) * !(E(!(EX((p80==1))) U (!((p56!=1)) * !(EX((p80==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t29, t38, t41, t50, t53, t57, t60, t69, t72, t73, t75, t78, t88, t89, t91, t94, t104, t109, t117, t120, t127, t130, t137, t142, t150, t153, t160, t162, t169, t196, t197, t198, t199, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/151/53/204

BK_TIME_CONFINEMENT_REACHED

--------------------
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="AutoFlight-PT-02b"
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 AutoFlight-PT-02b, 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 r006-smll-158897516000396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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