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-159033389100650.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-R003C005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389100650
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 4.3K May 14 00:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 00:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 17:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 17:33 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.3K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 13 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 13 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 07:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 07:33 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 35K 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-R003C005-00
FORMULA_NAME ResAllocation-PT-R003C005-01
FORMULA_NAME ResAllocation-PT-R003C005-02
FORMULA_NAME ResAllocation-PT-R003C005-03
FORMULA_NAME ResAllocation-PT-R003C005-04
FORMULA_NAME ResAllocation-PT-R003C005-05
FORMULA_NAME ResAllocation-PT-R003C005-06
FORMULA_NAME ResAllocation-PT-R003C005-07
FORMULA_NAME ResAllocation-PT-R003C005-08
FORMULA_NAME ResAllocation-PT-R003C005-09
FORMULA_NAME ResAllocation-PT-R003C005-10
FORMULA_NAME ResAllocation-PT-R003C005-11
FORMULA_NAME ResAllocation-PT-R003C005-12
FORMULA_NAME ResAllocation-PT-R003C005-13
FORMULA_NAME ResAllocation-PT-R003C005-14
FORMULA_NAME ResAllocation-PT-R003C005-15

=== Now, execution of the tool begins

BK_START 1590538914589

[2020-05-27 00:21:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 00:21:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 00:21:56] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2020-05-27 00:21:56] [INFO ] Transformed 30 places.
[2020-05-27 00:21:56] [INFO ] Transformed 20 transitions.
[2020-05-27 00:21:56] [INFO ] Parsed PT model containing 30 places and 20 transitions in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 427 steps, including 32 resets, run visited all 33 properties in 9 ms. (steps per millisecond=47 )
[2020-05-27 00:21:57] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-27 00:21:57] [INFO ] Flatten gal took : 41 ms
FORMULA ResAllocation-PT-R003C005-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C005-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C005-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C005-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 00:21:57] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 00:21:57] [INFO ] Applying decomposition
[2020-05-27 00:21:57] [INFO ] Flatten gal took : 5 ms
[2020-05-27 00:21:57] [INFO ] Input system was already deterministic with 20 transitions.
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/graph13790686902747703403.txt, -o, /tmp/graph13790686902747703403.bin, -w, /tmp/graph13790686902747703403.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/graph13790686902747703403.bin, -l, -1, -v, -w, /tmp/graph13790686902747703403.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 00:21:57] [INFO ] Decomposing Gal with order
[2020-05-27 00:21:57] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 20 rows 30 cols
[2020-05-27 00:21:57] [INFO ] Computed 15 place invariants in 7 ms
inv : p_0_1 + r_0_1 + p_1_1 = 1
inv : p_1_0 + r_1_0 + p_2_0 = 1
inv : p_1_2 + r_1_2 + p_2_2 = 1
inv : p_4_0 + r_4_0 = 1
inv : p_1_1 + r_1_1 + p_2_1 = 1
inv : p_4_2 + r_4_2 = 1
inv : p_2_2 + r_2_2 + p_3_2 = 1
inv : p_0_0 + r_0_0 + p_1_0 = 1
inv : p_0_2 + r_0_2 + p_1_2 = 1
inv : p_3_2 + r_3_2 + p_4_2 = 1
inv : p_3_0 + r_3_0 + p_4_0 = 1
inv : p_2_1 + r_2_1 + p_3_1 = 1
inv : p_4_1 + r_4_1 = 1
inv : p_2_0 + r_2_0 + p_3_0 = 1
inv : p_3_1 + r_3_1 + p_4_1 = 1
Total of 15 invariants.
[2020-05-27 00:21:57] [INFO ] Computed 15 place invariants in 12 ms
[2020-05-27 00:21:57] [INFO ] Flatten gal took : 35 ms
[2020-05-27 00:21:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-27 00:21:57] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-27 00:21:57] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((!(X(X(X(X((G(F(G(X("((i2.u3.r_1_0>=1)&&(i2.u6.r_2_0>=1))")))))U("(i2.u3.p_1_0>=1)"))))))))
Formula 0 simplified : XXXX(GFGX"((i2.u3.r_1_0>=1)&&(i2.u6.r_2_0>=1))" U "(i2.u3.p_1_0>=1)")
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
[2020-05-27 00:21:57] [INFO ] Proved 30 variables to be positive in 132 ms
[2020-05-27 00:21:57] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2020-05-27 00:21:57] [INFO ] Computation of disable matrix completed :0/20 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:21:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:21:57] [INFO ] Computing symmetric may enable matrix : 20 transitions.
Reverse transition relation is NOT exact ! Due to transitions t_1_0, t_2_3, t_3_0, i1.u2.t_0_3, i3.t_4_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/15/5/20
[2020-05-27 00:21:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Computing Next relation with stutter on 4 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.052175,18360,1,0,2163,26,412,2044,50,41,4570
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G((("(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))")U("(i0.u0.r_0_0>=1)"))&&(("((((i1.u5.r_1_2>=1)&&(i2.u7.p_2_1>=1))&&(i3.u8.r_2_2>=1))||(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1)))")U((("(((i1.u5.r_1_2>=1)&&(i2.u7.p_2_1>=1))&&(i3.u8.r_2_2>=1))")U("(((i2.u4.r_1_1>=1)&&(i2.u6.p_2_0>=1))&&(i2.u7.r_2_1>=1))"))||("(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))")))))))
Formula 1 simplified : !FG(("(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))" U "(i0.u0.r_0_0>=1)") & ("((((i1.u5.r_1_2>=1)&&(i2.u7.p_2_1>=1))&&(i3.u8.r_2_2>=1))||(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1)))" U ("(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))" | ("(((i1.u5.r_1_2>=1)&&(i2.u7.p_2_1>=1))&&(i3.u8.r_2_2>=1))" U "(((i2.u4.r_1_1>=1)&&(i2.u6.p_2_0>=1))&&(i2.u7.r_2_1>=1))"))))
Computing Next relation with stutter on 4 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.063447,19440,1,0,2358,26,533,2249,51,41,5362
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(!(F(((((F("((i1.u2.p_0_2>=1)||(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1)))"))&&(X("(i2.u3.p_1_0>=1)")))&&("(i2.u6.r_2_0>=1)"))&&("(i4.u9.r_3_0>=1)"))&&("(i4.u10.p_3_1>=1)")))))))
Formula 2 simplified : !FG!F("(i2.u6.r_2_0>=1)" & "(i4.u9.r_3_0>=1)" & "(i4.u10.p_3_1>=1)" & F"((i1.u2.p_0_2>=1)||(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1)))" & X"(i2.u3.p_1_0>=1)")
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.068925,19648,1,0,2439,26,588,2320,51,41,5686
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X(!(("(i3.u14.p_4_2>=1)")U("((i1.u2.r_0_2>=1)&&(i1.u5.r_1_2>=1))"))))))
Formula 3 simplified : !XX!("(i3.u14.p_4_2>=1)" U "((i1.u2.r_0_2>=1)&&(i1.u5.r_1_2>=1))")
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.071382,19648,1,0,2485,26,617,2364,51,41,5876
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(X(X("((i3.u8.r_2_2>=1)&&(i3.u11.r_3_2>=1))"))))))
Formula 4 simplified : !XFXX"((i3.u8.r_2_2>=1)&&(i3.u11.r_3_2>=1))"
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.073751,19648,1,0,2555,26,637,2465,51,41,6072
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((("(i0.u0.r_0_0>=1)")U(!(F("((i4.u9.r_3_0>=1)&&(i4.u12.r_4_0>=1))")))))
Formula 5 simplified : !("(i0.u0.r_0_0>=1)" U !F"((i4.u9.r_3_0>=1)&&(i4.u12.r_4_0>=1))")
Computing Next relation with stutter on 4 deadlock states
10 unique states visited
2 strongly connected components in search stack
11 transitions explored
10 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.087016,19648,1,0,3487,26,695,3499,51,41,8408
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((X(G("(((i1.u5.r_1_2>=1)&&(i2.u7.p_2_1>=1))&&(i3.u8.r_2_2>=1))")))&&(((F("(((i3.u11.r_3_2>=1)&&(i4.u13.p_4_1>=1))&&(i3.u14.r_4_2>=1))"))||(G("(((i1.u5.r_1_2>=1)&&(i2.u7.p_2_1>=1))&&(i3.u8.r_2_2>=1))")))||("(((i3.u11.r_3_2>=1)&&(i4.u13.p_4_1>=1))&&(i3.u14.r_4_2>=1))")))))
Formula 6 simplified : !X(XG"(((i1.u5.r_1_2>=1)&&(i2.u7.p_2_1>=1))&&(i3.u8.r_2_2>=1))" & ("(((i3.u11.r_3_2>=1)&&(i4.u13.p_4_1>=1))&&(i3.u14.r_4_2>=1))" | G"(((i1.u5.r_1_2>=1)&&(i2.u7.p_2_1>=1))&&(i3.u8.r_2_2>=1))" | F"(((i3.u11.r_3_2>=1)&&(i4.u13.p_4_1>=1))&&(i3.u14.r_4_2>=1))"))
Computing Next relation with stutter on 4 deadlock states
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.092645,20112,1,0,3815,26,772,3788,51,41,9333
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(("((((i0.u1.r_0_1<1)||(i2.u4.r_1_1<1))||(i1.u5.p_1_2<1))||(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1)))")U("(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))"))))
Formula 7 simplified : !X("((((i0.u1.r_0_1<1)||(i2.u4.r_1_1<1))||(i1.u5.p_1_2<1))||(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1)))" U "(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))")
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.100209,20372,1,0,4697,26,800,4544,51,41,11302
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(F(X("(((i2.u4.r_1_1>=1)&&(i2.u6.p_2_0>=1))&&(i2.u7.r_2_1>=1))"))))U(X(!(X((F("((i2.u3.r_1_0>=1)&&(i2.u6.r_2_0>=1))"))&&("(((i4.u10.r_3_1<1)||(i4.u12.p_4_0<1))||(i4.u13.r_4_1<1))")))))))
Formula 8 simplified : !(XFX"(((i2.u4.r_1_1>=1)&&(i2.u6.p_2_0>=1))&&(i2.u7.r_2_1>=1))" U X!X("(((i4.u10.r_3_1<1)||(i4.u12.p_4_0<1))||(i4.u13.r_4_1<1))" & F"((i2.u3.r_1_0>=1)&&(i2.u6.r_2_0>=1))"))
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.105677,20624,1,0,4988,26,842,4893,51,41,12063
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((("(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))")U(F(G(X(("((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1))")U("(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))"))))))||("(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))"))))
Formula 9 simplified : !G("(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))" | ("(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))" U FGX("((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1))" U "(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))")))
Computing Next relation with stutter on 4 deadlock states
7 unique states visited
4 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.118343,20884,1,0,6263,26,880,6095,51,41,14564
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X(X(("(i3.u8.p_2_2>=1)")U("(((i1.u2.r_0_2>=1)&&(i1.u5.r_1_2>=1))||(((i0.u1.r_0_1>=1)&&(i2.u4.r_1_1>=1))&&(i1.u5.p_1_2>=1)))"))))))
Formula 10 simplified : !XXX("(i3.u8.p_2_2>=1)" U "(((i1.u2.r_0_2>=1)&&(i1.u5.r_1_2>=1))||(((i0.u1.r_0_1>=1)&&(i2.u4.r_1_1>=1))&&(i1.u5.p_1_2>=1)))")
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.121752,21412,1,0,6475,26,912,6322,51,41,15429
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((((F("(((i0.u1.r_0_1<1)||(i2.u4.r_1_1<1))||(i1.u5.p_1_2<1))"))U("((i2.u3.p_1_0>=1)||(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1)))"))||(G(("(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))")U(X(G("(i0.u0.r_0_0>=1)")))))))
Formula 11 simplified : !((F"(((i0.u1.r_0_1<1)||(i2.u4.r_1_1<1))||(i1.u5.p_1_2<1))" U "((i2.u3.p_1_0>=1)||(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1)))") | G("(((i2.u6.r_2_0>=1)&&(i4.u9.r_3_0>=1))&&(i4.u10.p_3_1>=1))" U XG"(i0.u0.r_0_0>=1)"))
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
5 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.134155,21664,1,0,6963,26,988,6842,51,41,16643
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 00:21:57] [INFO ] Built C files in 356ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590538917921

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-R003C005"
export BK_EXAMINATION="LTLFireability"
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-R003C005, examination is LTLFireability"
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-159033389100650"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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