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

About the Execution of ITS-Tools for ResAllocation-PT-R003C100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.790 3600000.00 3640911.00 527.50 TFFTTFFFFTTF???? 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.r193-csrt-159033389200692.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 ResAllocation-PT-R003C100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389200692
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 3.7K May 14 00:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 00:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 17:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 17:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 13 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 07:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 721K May 12 20:53 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 ResAllocation-PT-R003C100-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590556214622

[2020-05-27 05:10:16] [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 05:10:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:10:16] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2020-05-27 05:10:16] [INFO ] Transformed 600 places.
[2020-05-27 05:10:16] [INFO ] Transformed 400 transitions.
[2020-05-27 05:10:16] [INFO ] Parsed PT model containing 600 places and 400 transitions in 217 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Incomplete random walk after 100000 steps, including 481 resets, run finished after 1297 ms. (steps per millisecond=77 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 400 rows 600 cols
[2020-05-27 05:10:18] [INFO ] Computed 300 place invariants in 26 ms
[2020-05-27 05:10:18] [INFO ] [Real]Absence check using 300 positive place invariants in 185 ms returned sat
[2020-05-27 05:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:19] [INFO ] [Real]Absence check using state equation in 896 ms returned sat
[2020-05-27 05:10:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:19] [INFO ] [Nat]Absence check using 300 positive place invariants in 148 ms returned sat
[2020-05-27 05:10:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:20] [INFO ] [Nat]Absence check using state equation in 921 ms returned sat
[2020-05-27 05:10:21] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-05-27 05:10:21] [INFO ] Deduced a trap composed of 5 places in 159 ms
[2020-05-27 05:10:21] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-05-27 05:10:21] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-05-27 05:10:21] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-27 05:10:21] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-05-27 05:10:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 634 ms
[2020-05-27 05:10:21] [INFO ] Computed and/alt/rep : 300/300/300 causal constraints in 27 ms.
[2020-05-27 05:10:21] [INFO ] Added : 41 causal constraints over 9 iterations in 266 ms. Result :sat
[2020-05-27 05:10:22] [INFO ] [Real]Absence check using 300 positive place invariants in 123 ms returned sat
[2020-05-27 05:10:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:22] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2020-05-27 05:10:23] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-05-27 05:10:23] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-27 05:10:23] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-05-27 05:10:23] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-27 05:10:23] [INFO ] Deduced a trap composed of 6 places in 61 ms
[2020-05-27 05:10:23] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-27 05:10:23] [INFO ] Deduced a trap composed of 5 places in 43 ms
[2020-05-27 05:10:23] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-05-27 05:10:23] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-27 05:10:23] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-05-27 05:10:23] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2020-05-27 05:10:23] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-05-27 05:10:24] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-05-27 05:10:24] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-27 05:10:24] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-27 05:10:24] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-05-27 05:10:24] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1320 ms
[2020-05-27 05:10:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:24] [INFO ] [Nat]Absence check using 300 positive place invariants in 144 ms returned sat
[2020-05-27 05:10:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:25] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2020-05-27 05:10:25] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-05-27 05:10:25] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-27 05:10:25] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-27 05:10:25] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-27 05:10:25] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-27 05:10:25] [INFO ] Deduced a trap composed of 6 places in 203 ms
[2020-05-27 05:10:26] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-27 05:10:26] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-05-27 05:10:26] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-05-27 05:10:26] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-05-27 05:10:26] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-05-27 05:10:26] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-05-27 05:10:26] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-05-27 05:10:26] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-27 05:10:26] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-27 05:10:26] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-05-27 05:10:26] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1314 ms
[2020-05-27 05:10:26] [INFO ] Computed and/alt/rep : 300/300/300 causal constraints in 21 ms.
[2020-05-27 05:10:26] [INFO ] Added : 44 causal constraints over 9 iterations in 261 ms. Result :sat
[2020-05-27 05:10:27] [INFO ] Flatten gal took : 116 ms
[2020-05-27 05:10:27] [INFO ] Flatten gal took : 45 ms
[2020-05-27 05:10:27] [INFO ] Applying decomposition
[2020-05-27 05:10:27] [INFO ] Flatten gal took : 36 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/graph13281374364011824256.txt, -o, /tmp/graph13281374364011824256.bin, -w, /tmp/graph13281374364011824256.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/graph13281374364011824256.bin, -l, -1, -v, -w, /tmp/graph13281374364011824256.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 05:10:27] [INFO ] Decomposing Gal with order
[2020-05-27 05:10:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 05:10:27] [INFO ] Removed a total of 2 redundant transitions.
[2020-05-27 05:10:27] [INFO ] Flatten gal took : 140 ms
[2020-05-27 05:10:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2020-05-27 05:10:27] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 19 ms
[2020-05-27 05:10:27] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 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 13 ordering constraints for composite.
built 23 ordering constraints for composite.
built 29 ordering constraints for composite.
built 7 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 23 ordering constraints for composite.
built 10 ordering constraints for composite.
built 16 ordering constraints for composite.
built 10 ordering constraints for composite.
built 15 ordering constraints for composite.
built 14 ordering constraints for composite.
built 31 ordering constraints for composite.
built 18 ordering constraints for composite.
built 14 ordering constraints for composite.
built 16 ordering constraints for composite.
built 15 ordering constraints for composite.
built 29 ordering constraints for composite.
built 13 ordering constraints for composite.
built 26 ordering constraints for composite.
built 20 ordering constraints for composite.
built 16 ordering constraints for composite.
built 23 ordering constraints for composite.
built 15 ordering constraints for composite.
built 24 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 10 ordering constraints for composite.
built 27 ordering constraints for composite.
built 7 ordering constraints for composite.
built 14 ordering constraints for composite.
built 18 ordering constraints for composite.
built 15 ordering constraints for composite.
built 14 ordering constraints for composite.
built 24 ordering constraints for composite.
built 18 ordering constraints for composite.
built 30 ordering constraints for composite.
built 10 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 26 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 22 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.41951e+57,1.28322,49604,7655,118,122282,801,1303,144676,108,2390,0


Converting to forward existential form...Done !
original formula: EF(((((((i1.i5.u29.r_11_0>=1)&&(i1.i5.u31.r_12_0>=1))&&(i5.u89.p_37_0>=1))&&(i3.u73.r_28_2>=1))&&(i4.i1.u74.r_29_2>=1)) * EX((i8.i1.u136.p_59_0>=1))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (((((i1.i5.u29.r_11_0>=1)&&(i1.i5.u31.r_12_0>=1))&&(i5.u89.p_37_0>=1))&&(i3.u73.r_28_2>=1))&&(i4.i1.u74.r_29_2>=1)))) * (i8.i1.u136.p_59_0>=1))] != FALSE
(forward)formula 0,1,1.68407,49988,1,0,122282,801,1965,151425,147,2390,110708
FORMULA ResAllocation-PT-R003C100-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((i13.u225.p_96_2>=1))
=> equivalent forward existential formula: [FwdG(Init,!((i13.u225.p_96_2>=1)))] = FALSE
Fast SCC detection found an SCC at level 1
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
(forward)formula 1,0,5.28982,154268,1,0,318039,1514,5436,849247,470,6015,430119
FORMULA ResAllocation-PT-R003C100-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((((i11.i0.u183.r_77_2<1)||(i11.i0.u182.p_78_1<1))||(i11.i0.u185.r_78_2<1)) * (AX((((i4.i1.u77.r_31_1>=1)&&(i4.i2.u76.p_32_0>=1))&&(i4.i2.u78.r_32_1>=1))) + (((i3.u68.r_27_2>=1)&&(i3.u70.p_28_1>=1))&&(i3.u73.r_28_2>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((((i11.i0.u183.r_77_2<1)||(i11.i0.u182.p_78_1<1))||(i11.i0.u185.r_78_2<1)) * (!(EX(!((((i4.i1.u77.r_31_1>=1)&&(i4.i2.u76.p_32_0>=1))&&(i4.i2.u78.r_32_1>=1))))) + (((i3.u68.r_27_2>=1)&&(i3.u70.p_28_1>=1))&&(i3.u73.r_28_2>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t_22_3, t_23_0, t_34_3, t_40_3, t_49_0, t_54_3, t_61_0, t_77_0, t_94_3, i0.t_4_3, i0.t_3_0, i0.t_2_3, i0.t_1_0, i0.u2.t_0_3, i1.t_11_0, i1.i0.t_6_3, i1.i1.t_5_0, i1.i1.t_7_0, i1.i2.t_8_3, i1.i3.t_9_0, i1.i4.t_10_3, i1.i4.u32.t_12_3, i1.i5.t_13_0, i1.i6.t_14_3, i2.t_17_0, i2.i0.t_15_0, i2.i1.t_18_3, i2.i1.u39.t_16_3, i2.i2.t_19_0, i2.i3.t_20_3, i2.i4.t_21_0, i3.t_28_3, i3.t_27_0, i3.t_26_3, i3.u60.t_24_3, i3.u61.t_25_0, i4.t_31_0, i4.i0.t_29_0, i4.i1.t_30_3, i4.i1.t_32_3, i4.i2.t_33_0, i5.t_39_0, i5.t_38_3, i5.t_37_0, i5.t_36_3, i5.t_35_0, i6.t_45_0, i6.i0.t_41_0, i6.i0.t_42_3, i6.i0.t_44_3, i6.i0.u103.t_43_0, i6.i1.t_46_3, i6.i1.t_47_0, i6.i1.t_48_3, i7.t_53_0, i7.i0.t_50_3, i7.i0.t_51_0, i7.i0.t_52_3, i7.i1.t_55_0, i8.t_58_3, i8.i0.t_56_3, i8.i1.t_57_0, i8.i1.t_59_0, i8.i2.t_62_3, i8.i2.u141.t_60_3, i9.t_66_3, i9.i0.t_64_3, i9.i1.t_63_0, i9.i1.t_67_0, i9.i1.u151.t_65_0, i9.i2.t_69_0, i9.i3.t_68_3, i10.t_73_0, i10.t_72_3, i10.i0.t_70_3, i10.i1.t_71_0, i10.i2.t_74_3, i10.i2.t_76_3, i10.i2.u176.t_75_0, i11.t_83_0, i11.i0.t_78_3, i11.i0.t_79_0, i11.i0.t_80_3, i11.i0.t_81_0, i11.i0.t_82_3, i11.i1.t_85_0, i11.i2.t_84_3, i11.i2.t_86_3, i12.t_92_3, i12.t_91_0, i12.i0.t_87_0, i12.i0.t_88_3, i12.i0.t_89_0, i12.i0.t_90_3, i12.i2.t_93_0, i13.t_99_0, i13.t_98_3, i13.t_97_0, i13.t_96_3, i13.t_95_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/300/100/400
Detected timeout of ITS tools.
[2020-05-27 05:30:31] [INFO ] Flatten gal took : 40 ms
[2020-05-27 05:30:31] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 9 ms
[2020-05-27 05:30:31] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 17 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, --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 --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 14 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.41951e+57,1.40535,55712,2,73232,5,261851,6,0,2803,199743,0


Converting to forward existential form...Done !
original formula: AF(((((r_77_2<1)||(p_78_1<1))||(r_78_2<1)) * (AX((((r_31_1>=1)&&(p_32_0>=1))&&(r_32_1>=1))) + (((r_27_2>=1)&&(p_28_1>=1))&&(r_28_2>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((((r_77_2<1)||(p_78_1<1))||(r_78_2<1)) * (!(EX(!((((r_31_1>=1)&&(p_32_0>=1))&&(r_32_1>=1))))) + (((r_27_2>=1)&&(p_28_1>=1))&&(r_28_2>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t_0_3, t_1_0, t_2_3, t_3_0, t_4_3, t_5_0, t_6_3, t_7_0, t_8_3, t_9_0, t_10_3, t_11_0, t_12_3, t_13_0, t_14_3, t_15_0, t_16_3, t_17_0, t_18_3, t_19_0, t_20_3, t_21_0, t_22_3, t_23_0, t_24_3, t_25_0, t_26_3, t_27_0, t_28_3, t_29_0, t_30_3, t_31_0, t_32_3, t_33_0, t_34_3, t_35_0, t_36_3, t_37_0, t_38_3, t_39_0, t_40_3, t_41_0, t_42_3, t_43_0, t_44_3, t_45_0, t_46_3, t_47_0, t_48_3, t_49_0, t_50_3, t_51_0, t_52_3, t_53_0, t_54_3, t_55_0, t_56_3, t_57_0, t_58_3, t_59_0, t_60_3, t_61_0, t_62_3, t_63_0, t_64_3, t_65_0, t_66_3, t_67_0, t_68_3, t_69_0, t_70_3, t_71_0, t_72_3, t_73_0, t_74_3, t_75_0, t_76_3, t_77_0, t_78_3, t_79_0, t_80_3, t_81_0, t_82_3, t_83_0, t_84_3, t_85_0, t_86_3, t_87_0, t_88_3, t_89_0, t_90_3, t_91_0, t_92_3, t_93_0, t_94_3, t_95_0, t_96_3, t_97_0, t_98_3, t_99_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/300/100/400
Detected timeout of ITS tools.
[2020-05-27 05:50:34] [INFO ] Flatten gal took : 19 ms
[2020-05-27 05:50:34] [INFO ] Input system was already deterministic with 400 transitions.
[2020-05-27 05:50:34] [INFO ] Transformed 600 places.
[2020-05-27 05:50:34] [INFO ] Transformed 400 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-27 05:50:34] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 3 ms
[2020-05-27 05:50:34] [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, --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 14 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.41951e+57,0.285052,9344,2,5205,5,17162,6,0,2803,12414,0


Converting to forward existential form...Done !
original formula: AF(((((r_77_2<1)||(p_78_1<1))||(r_78_2<1)) * (AX((((r_31_1>=1)&&(p_32_0>=1))&&(r_32_1>=1))) + (((r_27_2>=1)&&(p_28_1>=1))&&(r_28_2>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((((r_77_2<1)||(p_78_1<1))||(r_78_2<1)) * (!(EX(!((((r_31_1>=1)&&(p_32_0>=1))&&(r_32_1>=1))))) + (((r_27_2>=1)&&(p_28_1>=1))&&(r_28_2>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t11, t12, t19, t20, t27, t28, t35, t36, t43, t44, t51, t52, t59, t60, t67, t68, t75, t76, t83, t84, t91, t92, t99, t100, t107, t108, t115, t116, t123, t124, t131, t132, t139, t140, t147, t148, t155, t156, t163, t164, t171, t172, t179, t180, t187, t188, t195, t196, t203, t204, t211, t212, t219, t220, t227, t228, t235, t236, t243, t244, t251, t252, t259, t260, t267, t268, t275, t276, t283, t284, t291, t292, t299, t300, t307, t308, t315, t316, t323, t324, t331, t332, t339, t340, t347, t348, t355, t356, t363, t364, t371, t372, t379, t380, t387, t388, t395, t396, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/300/100/400
(forward)formula 0,0,65.998,2072056,1,0,1527,1.06542e+07,825,1019,19171,1.68994e+07,1423
FORMULA ResAllocation-PT-R003C100-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (EG(((EF((((r_53_2>=1)&&(p_54_1>=1))&&(r_54_2>=1))) * (r_8_2>=1)) * (r_9_2>=1))) * (EX(((r_38_2>=1)&&(r_39_2>=1))) + (!(EF((((r_74_1>=1)&&(r_75_1>=1))&&(p_75_2>=1)))) * EF(((r_69_0>=1)&&(r_70_0>=1))))))
=> equivalent forward existential formula: ([(Init * !(EG(((E(TRUE U (((r_53_2>=1)&&(p_54_1>=1))&&(r_54_2>=1))) * (r_8_2>=1)) * (r_9_2>=1)))))] = FALSE * ([(FwdU((Init * !(EX(((r_38_2>=1)&&(r_39_2>=1))))),TRUE) * (((r_74_1>=1)&&(r_75_1>=1))&&(p_75_2>=1)))] = FALSE * [((Init * !(EX(((r_38_2>=1)&&(r_39_2>=1))))) * !(E(TRUE U ((r_69_0>=1)&&(r_70_0>=1)))))] = FALSE))
Using saturation style SCC detection
(forward)formula 1,1,525.714,8330916,1,0,1567,2.43891e+07,11,1046,9484,7.37595e+07,6
FORMULA ResAllocation-PT-R003C100-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (EG(((r_22_2>=1)&&(r_23_2>=1))) + !(E((((r_57_2>=1)&&(p_58_1>=1))&&(r_58_2>=1)) U ((r_82_2>=1)&&(r_83_2>=1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG(((r_22_2>=1)&&(r_23_2>=1))))),(((r_57_2>=1)&&(p_58_1>=1))&&(r_58_2>=1))) * ((r_82_2>=1)&&(r_83_2>=1)))] = FALSE
(forward)formula 2,1,562.698,8332128,1,0,1567,2.43891e+07,23,1046,9505,7.37595e+07,934
FORMULA ResAllocation-PT-R003C100-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF((AF(((((r_62_0>=1)&&(r_63_0>=1))&&(p_63_1>=1))||(p_30_2>=1))) + ((((((r_26_0>=1)&&(r_27_0>=1))&&(p_27_1>=1))&&(r_51_0>=1))&&(r_52_0>=1))&&(p_22_2<1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(((((r_62_0>=1)&&(r_63_0>=1))&&(p_63_1>=1))||(p_30_2>=1))))) + ((((((r_26_0>=1)&&(r_27_0>=1))&&(p_27_1>=1))&&(r_51_0>=1))&&(r_52_0>=1))&&(p_22_2<1)))))] = FALSE
(forward)formula 3,0,896.918,11485940,1,0,2096,4.19318e+07,17,1046,10800,1.06127e+08,1512
FORMULA ResAllocation-PT-R003C100-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF(AX((((r_24_0>=1)&&(r_25_0>=1))&&(p_25_1>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((r_24_0>=1)&&(r_25_0>=1))&&(p_25_1>=1)))))))] = FALSE
(forward)formula 4,0,908.123,11485940,1,0,2096,4.19318e+07,22,1509,10807,1.06127e+08,2119
FORMULA ResAllocation-PT-R003C100-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E(((AF((p_66_2>=1)) + (((((r_98_1>=1)&&(r_99_1>=1))&&(p_99_2>=1))&&(r_33_0>=1))&&(r_34_0>=1))) + (((((r_11_0>=1)&&(r_12_0>=1))&&(r_24_0>=1))&&(r_25_0>=1))&&(p_25_1>=1))) U ((((r_24_0>=1)&&(r_25_0>=1))&&(p_25_1>=1))&&(((r_33_1<1)||(p_34_0<1))||(r_34_1<1))))
=> equivalent forward existential formula: [(FwdU(Init,((!(EG(!((p_66_2>=1)))) + (((((r_98_1>=1)&&(r_99_1>=1))&&(p_99_2>=1))&&(r_33_0>=1))&&(r_34_0>=1))) + (((((r_11_0>=1)&&(r_12_0>=1))&&(r_24_0>=1))&&(r_25_0>=1))&&(p_25_1>=1)))) * ((((r_24_0>=1)&&(r_25_0>=1))&&(p_25_1>=1))&&(((r_33_1<1)||(p_34_0<1))||(r_34_1<1))))] != FALSE
(forward)formula 5,0,1012.52,11485940,1,0,3866,4.19318e+07,35,2471,10823,1.06127e+08,4347
FORMULA ResAllocation-PT-R003C100-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A((EX((p_91_0>=1)) + ((((r_37_2<1)||(p_38_1<1))||(r_38_2<1))&&(((r_51_2<1)||(p_52_1<1))||(r_52_2<1)))) U (((p_5_0<1)&&((r_46_2<1)||(r_47_2<1)))||(((((r_40_0>=1)&&(r_41_0>=1))&&(p_41_1>=1))||(((r_11_1>=1)&&(p_12_0>=1))&&(r_12_1>=1)))&&((p_78_2>=1)||(p_26_2>=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!((((p_5_0<1)&&((r_46_2<1)||(r_47_2<1)))||(((((r_40_0>=1)&&(r_41_0>=1))&&(p_41_1>=1))||(((r_11_1>=1)&&(p_12_0>=1))&&(r_12_1>=1)))&&((p_78_2>=1)||(p_26_2>=1)))))))) * !(E(!((((p_5_0<1)&&((r_46_2<1)||(r_47_2<1)))||(((((r_40_0>=1)&&(r_41_0>=1))&&(p_41_1>=1))||(((r_11_1>=1)&&(p_12_0>=1))&&(r_12_1>=1)))&&((p_78_2>=1)||(p_26_2>=1))))) U (!((EX((p_91_0>=1)) + ((((r_37_2<1)||(p_38_1<1))||(r_38_2<1))&&(((r_51_2<1)||(p_52_1<1))||(r_52_2<1))))) * !((((p_5_0<1)&&((r_46_2<1)||(r_47_2<1)))||(((((r_40_0>=1)&&(r_41_0>=1))&&(p_41_1>=1))||(((r_11_1>=1)&&(p_12_0>=1))&&(r_12_1>=1)))&&((p_78_2>=1)||(p_26_2>=1)))))))))] != FALSE
(forward)formula 6,0,1091.25,11567860,1,0,4736,5.19728e+07,43,2841,10865,1.06127e+08,5389
FORMULA ResAllocation-PT-R003C100-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(AF((((r_11_1>=1)&&(p_12_0>=1))&&(r_12_1>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((((r_11_1>=1)&&(p_12_0>=1))&&(r_12_1>=1))))] != FALSE
Hit Full ! (commute/partial/dont) 393/0/7
(forward)formula 7,1,1091.47,11567860,1,0,4739,5.19981e+07,51,2844,11473,1.06127e+08,5393
FORMULA ResAllocation-PT-R003C100-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EG((!(AX(((r_69_0>=1)&&(r_70_0>=1)))) + ((p_97_0>=1)&&((((r_84_2<1)||(r_85_2<1))||(r_48_2<1))||(r_49_2<1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(!(EX(!(((r_69_0>=1)&&(r_70_0>=1)))))) + ((p_97_0>=1)&&((((r_84_2<1)||(r_85_2<1))||(r_48_2<1))||(r_49_2<1)))))] != FALSE
(forward)formula 8,1,1094.13,11567860,1,0,4877,5.21592e+07,57,3282,11485,1.06127e+08,5835
FORMULA ResAllocation-PT-R003C100-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF(((((r_11_0<1)||(r_12_0<1))&&(p_29_0>=1))&&(p_98_2>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((r_11_0<1)||(r_12_0<1))&&(p_29_0>=1))&&(p_98_2>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 390/0/10
(forward)formula 9,0,1095.87,11569908,1,0,4878,5.23749e+07,65,3285,12040,1.06127e+08,5839
FORMULA ResAllocation-PT-R003C100-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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="ResAllocation-PT-R003C100"
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 ResAllocation-PT-R003C100, 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 r193-csrt-159033389200692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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