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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.110 3600000.00 3620518.00 7150.10 FFFFFFTFF??????? 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-159033389200722.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-R020C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389200722
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 3.3K May 14 00:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 00:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 17:36 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.4K 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.2K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 13 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:35 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 85K 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-R020C002-00
FORMULA_NAME ResAllocation-PT-R020C002-01
FORMULA_NAME ResAllocation-PT-R020C002-02
FORMULA_NAME ResAllocation-PT-R020C002-03
FORMULA_NAME ResAllocation-PT-R020C002-04
FORMULA_NAME ResAllocation-PT-R020C002-05
FORMULA_NAME ResAllocation-PT-R020C002-06
FORMULA_NAME ResAllocation-PT-R020C002-07
FORMULA_NAME ResAllocation-PT-R020C002-08
FORMULA_NAME ResAllocation-PT-R020C002-09
FORMULA_NAME ResAllocation-PT-R020C002-10
FORMULA_NAME ResAllocation-PT-R020C002-11
FORMULA_NAME ResAllocation-PT-R020C002-12
FORMULA_NAME ResAllocation-PT-R020C002-13
FORMULA_NAME ResAllocation-PT-R020C002-14
FORMULA_NAME ResAllocation-PT-R020C002-15

=== Now, execution of the tool begins

BK_START 1590556234481

[2020-05-27 05:10:36] [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 05:10:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:10:36] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-05-27 05:10:36] [INFO ] Transformed 80 places.
[2020-05-27 05:10:36] [INFO ] Transformed 42 transitions.
[2020-05-27 05:10:36] [INFO ] Parsed PT model containing 80 places and 42 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 862 resets, run finished after 254 ms. (steps per millisecond=393 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 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]
// Phase 1: matrix 42 rows 80 cols
[2020-05-27 05:10:36] [INFO ] Computed 40 place invariants in 5 ms
[2020-05-27 05:10:37] [INFO ] [Real]Absence check using 40 positive place invariants in 47 ms returned sat
[2020-05-27 05:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:37] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2020-05-27 05:10:37] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 9 ms.
[2020-05-27 05:10:37] [INFO ] Added : 33 causal constraints over 7 iterations in 85 ms. Result :sat
[2020-05-27 05:10:37] [INFO ] [Real]Absence check using 40 positive place invariants in 22 ms returned sat
[2020-05-27 05:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:37] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-05-27 05:10:37] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 4 ms.
[2020-05-27 05:10:37] [INFO ] Added : 19 causal constraints over 4 iterations in 30 ms. Result :sat
[2020-05-27 05:10:37] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2020-05-27 05:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:37] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2020-05-27 05:10:37] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 5 ms.
[2020-05-27 05:10:37] [INFO ] Added : 18 causal constraints over 4 iterations in 55 ms. Result :sat
[2020-05-27 05:10:37] [INFO ] [Real]Absence check using 40 positive place invariants in 17 ms returned sat
[2020-05-27 05:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:37] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2020-05-27 05:10:37] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-27 05:10:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2020-05-27 05:10:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2020-05-27 05:10:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:38] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2020-05-27 05:10:38] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-05-27 05:10:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2020-05-27 05:10:38] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 9 ms.
[2020-05-27 05:10:38] [INFO ] Added : 29 causal constraints over 6 iterations in 73 ms. Result :sat
[2020-05-27 05:10:38] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2020-05-27 05:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:38] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-05-27 05:10:38] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 11 ms.
[2020-05-27 05:10:38] [INFO ] Added : 19 causal constraints over 4 iterations in 33 ms. Result :sat
[2020-05-27 05:10:38] [INFO ] Flatten gal took : 60 ms
[2020-05-27 05:10:38] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
[2020-05-27 05:10:38] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-27 05:10:38] [INFO ] Flatten gal took : 17 ms
[2020-05-27 05:10:38] [INFO ] Input system was already deterministic with 42 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/graph5744780693690234749.txt, -o, /tmp/graph5744780693690234749.bin, -w, /tmp/graph5744780693690234749.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/graph5744780693690234749.bin, -l, -1, -v, -w, /tmp/graph5744780693690234749.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 05:10:38] [INFO ] Decomposing Gal with order
[2020-05-27 05:10:38] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 42 rows 80 cols
[2020-05-27 05:10:38] [INFO ] Computed 40 place invariants in 2 ms
inv : p_0_2 + r_0_2 + p_1_2 = 1
inv : p_0_11 + r_0_11 + p_1_11 = 1
inv : p_1_0 + r_1_0 = 1
inv : p_1_10 + r_1_10 = 1
inv : p_1_12 + r_1_12 = 1
inv : p_0_10 + r_0_10 + p_1_10 = 1
inv : p_1_7 + r_1_7 = 1
inv : p_0_3 + r_0_3 + p_1_3 = 1
inv : p_0_19 + r_0_19 + p_1_19 = 1
inv : p_0_12 + r_0_12 + p_1_12 = 1
inv : p_1_15 + r_1_15 = 1
inv : p_1_3 + r_1_3 = 1
inv : p_0_9 + r_0_9 + p_1_9 = 1
inv : p_1_4 + r_1_4 = 1
inv : p_1_14 + r_1_14 = 1
inv : p_1_1 + r_1_1 = 1
inv : p_1_9 + r_1_9 = 1
inv : p_0_8 + r_0_8 + p_1_8 = 1
inv : p_1_17 + r_1_17 = 1
inv : p_1_11 + r_1_11 = 1
inv : p_0_15 + r_0_15 + p_1_15 = 1
inv : p_0_7 + r_0_7 + p_1_7 = 1
inv : p_0_6 + r_0_6 + p_1_6 = 1
inv : p_1_6 + r_1_6 = 1
inv : p_1_16 + r_1_16 = 1
inv : p_0_5 + r_0_5 + p_1_5 = 1
inv : p_1_19 + r_1_19 = 1
inv : p_0_13 + r_0_13 + p_1_13 = 1
inv : p_0_4 + r_0_4 + p_1_4 = 1
inv : p_0_0 + r_0_0 + p_1_0 = 1
inv : p_0_18 + r_0_18 + p_1_18 = 1
inv : p_0_17 + r_0_17 + p_1_17 = 1
inv : p_1_8 + r_1_8 = 1
inv : p_1_2 + r_1_2 = 1
inv : p_1_18 + r_1_18 = 1
inv : p_0_1 + r_0_1 + p_1_1 = 1
inv : p_0_14 + r_0_14 + p_1_14 = 1
inv : p_0_16 + r_0_16 + p_1_16 = 1
inv : p_1_5 + r_1_5 = 1
inv : p_1_13 + r_1_13 = 1
Total of 40 invariants.
[2020-05-27 05:10:38] [INFO ] Computed 40 place invariants in 3 ms
[2020-05-27 05:10:38] [INFO ] Flatten gal took : 62 ms
[2020-05-27 05:10:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-27 05:10:38] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-27 05:10:38] [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 16 LTL properties
Checking formula 0 : !((X(((((X("(((i1.i0.u2.r_0_2<1)||(i1.i0.u22.r_1_2<1))||(i1.i0.u23.p_1_3<1))"))U((G(("((i4.i1.u14.p_0_14>=1)&&(i4.i1.u15.r_0_15>=1))")U("(i5.i1.u19.p_0_19>=1)")))||("((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))")))&&("(i1.i0.u2.r_0_2>=1)"))&&("(i1.i0.u22.r_1_2>=1)"))&&("(i1.i0.u23.p_1_3>=1)"))))
Formula 0 simplified : !X("(i1.i0.u2.r_0_2>=1)" & "(i1.i0.u22.r_1_2>=1)" & "(i1.i0.u23.p_1_3>=1)" & (X"(((i1.i0.u2.r_0_2<1)||(i1.i0.u22.r_1_2<1))||(i1.i0.u23.p_1_3<1))" U ("((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))" | G("((i4.i1.u14.p_0_14>=1)&&(i4.i1.u15.r_0_15>=1))" U "(i5.i1.u19.p_0_19>=1)"))))
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.t_1_0, i5.i1.u19.t_0_20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/2/42
Computing Next relation with stutter on 19 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5 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.093309,19752,1,0,3162,32,725,5618,51,37,6251
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X((F(G(F(G("((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))")))))||(F("((i0.u1.p_0_1>=1)&&(i1.i0.u2.r_0_2>=1))"))))))
Formula 1 simplified : !GX(FGFG"((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))" | F"((i0.u1.p_0_1>=1)&&(i1.i0.u2.r_0_2>=1))")
Computing Next relation with stutter on 19 deadlock states
[2020-05-27 05:10:39] [INFO ] Proved 80 variables to be positive in 378 ms
[2020-05-27 05:10:39] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2020-05-27 05:10:39] [INFO ] Computation of disable matrix completed :0/42 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:10:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:10:39] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2020-05-27 05:10:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
122 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,1.30743,55128,1,0,78232,32,763,73383,51,37,55838
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F(G("((i1.i1.u5.p_0_5>=1)&&(i2.u6.r_0_6>=1))")))&&(G(X("(((i4.i1.u15.r_0_15>=1)&&(i4.i1.u35.r_1_15>=1))&&(i5.i0.u36.p_1_16>=1))")))))
Formula 2 simplified : !(FG"((i1.i1.u5.p_0_5>=1)&&(i2.u6.r_0_6>=1))" & GX"(((i4.i1.u15.r_0_15>=1)&&(i4.i1.u35.r_1_15>=1))&&(i5.i0.u36.p_1_16>=1))")
Computing Next relation with stutter on 19 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
76 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,2.07031,75720,1,0,124313,32,820,112357,51,37,79525
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X(((G("(((i3.u10.r_0_10>=1)&&(i3.u30.r_1_10>=1))&&(i3.u31.p_1_11>=1))"))&&("(i3.u11.p_0_11>=1)"))&&("(i4.i0.u12.r_0_12>=1)")))||(F("(((i2.u7.r_0_7>=1)&&(i2.u27.r_1_7>=1))&&(i2.u28.p_1_8>=1))"))))
Formula 3 simplified : !(X("(i3.u11.p_0_11>=1)" & "(i4.i0.u12.r_0_12>=1)" & G"(((i3.u10.r_0_10>=1)&&(i3.u30.r_1_10>=1))&&(i3.u31.p_1_11>=1))") | F"(((i2.u7.r_0_7>=1)&&(i2.u27.r_1_7>=1))&&(i2.u28.p_1_8>=1))")
Computing Next relation with stutter on 19 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,2.08817,76508,1,0,125992,32,899,114796,51,37,82371
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((((G((!((F("(((i5.i0.u17.r_0_17<1)||(i5.i0.u37.r_1_17<1))||(i5.i1.u38.p_1_18<1))"))U("(i0.u20.p_1_0>=1)")))&&(!(F("(((i0.u0.r_0_0>=1)&&(i0.u20.r_1_0>=1))&&(i0.u21.p_1_1>=1))")))))&&("(i4.i1.u15.r_0_15>=1)"))&&("(i4.i1.u35.r_1_15>=1)"))&&("(i5.i0.u36.p_1_16>=1)"))))
Formula 4 simplified : !X("(i4.i1.u15.r_0_15>=1)" & "(i4.i1.u35.r_1_15>=1)" & "(i5.i0.u36.p_1_16>=1)" & G(!(F"(((i5.i0.u17.r_0_17<1)||(i5.i0.u37.r_1_17<1))||(i5.i1.u38.p_1_18<1))" U "(i0.u20.p_1_0>=1)") & !F"(((i0.u0.r_0_0>=1)&&(i0.u20.r_1_0>=1))&&(i0.u21.p_1_1>=1))"))
Computing Next relation with stutter on 19 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,2.09133,76772,1,0,125992,32,951,114796,51,37,82461
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(!(G("(((i5.i1.u18.r_0_18>=1)&&(i5.i1.u38.r_1_18>=1))&&(i5.i1.u39.p_1_19>=1))"))))U("((i0.u1.p_0_1>=1)&&(i1.i0.u2.r_0_2>=1))")))
Formula 5 simplified : !(F!G"(((i5.i1.u18.r_0_18>=1)&&(i5.i1.u38.r_1_18>=1))&&(i5.i1.u39.p_1_19>=1))" U "((i0.u1.p_0_1>=1)&&(i1.i0.u2.r_0_2>=1))")
Computing Next relation with stutter on 19 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,2.10462,77300,1,0,127583,32,984,116612,51,37,85303
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(((F(("((i5.i0.u16.p_0_16>=1)&&(i5.i0.u17.r_0_17>=1))")U("(((i1.i1.u5.r_0_5>=1)&&(i1.i1.u25.r_1_5>=1))&&(i2.u26.p_1_6>=1))")))&&("(i0.u20.p_1_0>=1)"))U(X(("(i0.u20.p_1_0>=1)")U("(((i1.i1.u5.r_0_5<1)||(i1.i1.u25.r_1_5<1))||(i2.u26.p_1_6<1))"))))))
Formula 6 simplified : !F(("(i0.u20.p_1_0>=1)" & F("((i5.i0.u16.p_0_16>=1)&&(i5.i0.u17.r_0_17>=1))" U "(((i1.i1.u5.r_0_5>=1)&&(i1.i1.u25.r_1_5>=1))&&(i2.u26.p_1_6>=1))")) U X("(i0.u20.p_1_0>=1)" U "(((i1.i1.u5.r_0_5<1)||(i1.i1.u25.r_1_5<1))||(i2.u26.p_1_6<1))"))
Computing Next relation with stutter on 19 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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,2.10564,77300,1,0,127583,32,1004,116612,51,37,85328
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(F((!((X(("(i0.u0.r_0_0>=1)")U("((i0.u1.p_0_1>=1)&&(i1.i0.u2.r_0_2>=1))")))U("((i0.u1.p_0_1<1)||(i1.i0.u2.r_0_2<1))")))U(F("(i0.u0.r_0_0>=1)"))))))
Formula 7 simplified : !GF(!(X("(i0.u0.r_0_0>=1)" U "((i0.u1.p_0_1>=1)&&(i1.i0.u2.r_0_2>=1))") U "((i0.u1.p_0_1<1)||(i1.i0.u2.r_0_2<1))") U F"(i0.u0.r_0_0>=1)")
Computing Next relation with stutter on 19 deadlock states
[2020-05-27 05:10:41] [INFO ] Computing symmetric co enabling matrix : 42 transitions.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
71 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,2.80466,98684,1,0,176918,32,1028,143858,51,37,120064
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((G("((i0.u0.r_0_0>=1)||((i5.i0.u17.p_0_17>=1)&&(i5.i1.u18.r_0_18>=1)))"))U("(((i0.u0.r_0_0>=1)&&(i0.u20.r_1_0>=1))&&(i0.u21.p_1_1>=1))"))))
Formula 8 simplified : !X(G"((i0.u0.r_0_0>=1)||((i5.i0.u17.p_0_17>=1)&&(i5.i1.u18.r_0_18>=1)))" U "(((i0.u0.r_0_0>=1)&&(i0.u20.r_1_0>=1))&&(i0.u21.p_1_1>=1))")
Computing Next relation with stutter on 19 deadlock states
[2020-05-27 05:10:42] [INFO ] Computation of Finished co-enabling matrix. took 780 ms. Total solver calls (SAT/UNSAT): 101(20/81)
[2020-05-27 05:10:42] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2020-05-27 05:10:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:10:42] [INFO ] Built C files in 3426ms 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]
175 unique states visited
175 strongly connected components in search stack
175 transitions explored
175 items max in DFS search stack
84 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,3.64897,117692,1,0,229039,32,1052,184056,51,37,158119
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(X(G((F("((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))"))||((((((G("(((i1.i0.u3.r_0_3>=1)&&(i1.i0.u23.r_1_3>=1))&&(i1.i1.u24.p_1_4>=1))"))||("(i1.i1.u4.r_0_4<1)"))||("(i1.i1.u24.r_1_4<1)"))||("(i1.i1.u25.p_1_5<1)"))&&("(i0.u0.p_0_0>=1)"))&&("(i0.u1.r_0_1>=1)")))))))
Formula 9 simplified : XG(F"((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))" | ("(i0.u0.p_0_0>=1)" & "(i0.u1.r_0_1>=1)" & ("(i1.i1.u4.r_0_4<1)" | "(i1.i1.u24.r_1_4<1)" | "(i1.i1.u25.p_1_5<1)" | G"(((i1.i0.u3.r_0_3>=1)&&(i1.i0.u23.r_1_3>=1))&&(i1.i1.u24.p_1_4>=1))")))
Computing Next relation with stutter on 19 deadlock states
Compilation finished in 1139 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 43 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X([](( <>((LTLAP3==true))) || ( ( ( ( ( ( []((LTLAP27==true))) || ( (LTLAP28==true)) ) || ( (LTLAP29==true)) ) || ( (LTLAP30==true)) ) && ( (LTLAP31==true) ) ) && ( (LTLAP32==true) )) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X([](( <>((LTLAP3==true))) || ( ( ( ( ( ( []((LTLAP27==true))) || ( (LTLAP28==true)) ) || ( (LTLAP29==true)) ) || ( (LTLAP30==true)) ) && ( (LTLAP31==true) ) ) && ( (LTLAP32==true) )) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X([](( <>((LTLAP3==true))) || ( ( ( ( ( ( []((LTLAP27==true))) || ( (LTLAP28==true)) ) || ( (LTLAP29==true)) ) || ( (LTLAP30==true)) ) && ( (LTLAP31==true) ) ) && ( (LTLAP32==true) )) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-27 05:30:40] [INFO ] Flatten gal took : 166 ms
[2020-05-27 05:30:40] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 39 ms
[2020-05-27 05:30:40] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 10 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, --gen-order, FOLLOW], 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 --gen-order FOLLOW
Read 7 LTL properties
Checking formula 0 : !((!(X(G((F("((p_0_0>=1)&&(r_0_1>=1))"))||((((((G("(((r_0_3>=1)&&(r_1_3>=1))&&(p_1_4>=1))"))||("(r_0_4<1)"))||("(r_1_4<1)"))||("(p_1_5<1)"))&&("(p_0_0>=1)"))&&("(r_0_1>=1)")))))))
Formula 0 simplified : XG(F"((p_0_0>=1)&&(r_0_1>=1))" | ("(p_0_0>=1)" & "(r_0_1>=1)" & ("(p_1_5<1)" | "(r_0_4<1)" | "(r_1_4<1)" | G"(((r_0_3>=1)&&(r_1_3>=1))&&(p_1_4>=1))")))
Reverse transition relation is NOT exact ! Due to transitions t_0_20, t_1_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/2/42
Computing Next relation with stutter on 19 deadlock states
Detected timeout of ITS tools.
[2020-05-27 05:50:40] [INFO ] Flatten gal took : 47 ms
[2020-05-27 05:50:40] [INFO ] Input system was already deterministic with 42 transitions.
[2020-05-27 05:50:41] [INFO ] Transformed 80 places.
[2020-05-27 05:50:41] [INFO ] Transformed 42 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:41] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-27 05:50:41] [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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 7 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((!(X(G((F("((p_0_0>=1)&&(r_0_1>=1))"))||((((((G("(((r_0_3>=1)&&(r_1_3>=1))&&(p_1_4>=1))"))||("(r_0_4<1)"))||("(r_1_4<1)"))||("(p_1_5<1)"))&&("(p_0_0>=1)"))&&("(r_0_1>=1)")))))))
Formula 0 simplified : XG(F"((p_0_0>=1)&&(r_0_1>=1))" | ("(p_0_0>=1)" & "(r_0_1>=1)" & ("(p_1_5<1)" | "(r_0_4<1)" | "(r_1_4<1)" | G"(((r_0_3>=1)&&(r_1_3>=1))&&(p_1_4>=1))")))
Reverse transition relation is NOT exact ! Due to transitions t20, t21, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/2/42
Computing Next relation with stutter on 19 deadlock states

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
+ [[ 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-R020C002"
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-R020C002, 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-159033389200722"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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