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

About the Execution of ITS-Tools for ShieldIIPs-PT-001A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.390 3919.00 9393.00 96.00 TFTFTTTFTTFFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033475100041.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-001A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475100041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 2.9K May 14 00:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 00:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 17:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 17:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 07:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 07:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 9.0K May 12 20:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1590561054313

[2020-05-27 06:30:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 06:30:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 06:30:56] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2020-05-27 06:30:56] [INFO ] Transformed 28 places.
[2020-05-27 06:30:56] [INFO ] Transformed 27 transitions.
[2020-05-27 06:30:56] [INFO ] Found NUPN structural information;
[2020-05-27 06:30:56] [INFO ] Parsed PT model containing 28 places and 27 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 304 resets, run finished after 164 ms. (steps per millisecond=609 ) properties seen :[1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 27 rows 28 cols
[2020-05-27 06:30:56] [INFO ] Computed 10 place invariants in 3 ms
[2020-05-27 06:30:56] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2020-05-27 06:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 06:30:56] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-27 06:30:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 06:30:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned unsat
[2020-05-27 06:30:56] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2020-05-27 06:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 06:30:56] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-05-27 06:30:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 06:30:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-27 06:30:56] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2020-05-27 06:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 06:30:56] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-05-27 06:30:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 06:30:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned unsat
[2020-05-27 06:30:56] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2020-05-27 06:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 06:30:56] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-05-27 06:30:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 06:30:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned unsat
[2020-05-27 06:30:57] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2020-05-27 06:30:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2020-05-27 06:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 06:30:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-05-27 06:30:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 06:30:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-27 06:30:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2020-05-27 06:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 06:30:57] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-05-27 06:30:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 06:30:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-27 06:30:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2020-05-27 06:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 06:30:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-05-27 06:30:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 06:30:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 28 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2020-05-27 06:30:57] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-27 06:30:57] [INFO ] Flatten gal took : 47 ms
FORMULA ShieldIIPs-PT-001A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001A-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001A-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001A-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001A-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 06:30: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 06:30:57] [INFO ] Applying decomposition
[2020-05-27 06:30:57] [INFO ] Flatten gal took : 4 ms
[2020-05-27 06:30:57] [INFO ] Input system was already deterministic with 27 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/graph6645053144326699047.txt, -o, /tmp/graph6645053144326699047.bin, -w, /tmp/graph6645053144326699047.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 27 rows 28 cols
[2020-05-27 06:30:57] [INFO ] Computed 10 place invariants in 1 ms
inv : p0 + p24 + p25 + p26 + p27 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p14 + p15 + p16 + p17 = 1
inv : p0 + p20 + p21 + p22 + p23 = 1
inv : p0 + p12 + p13 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p18 + p19 = 1
inv : p0 + p10 + p11 = 1
inv : p0 + p5 + p8 + p9 = 1
Total of 10 invariants.
[2020-05-27 06:30:57] [INFO ] Computed 10 place invariants in 1 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph6645053144326699047.bin, -l, -1, -v, -w, /tmp/graph6645053144326699047.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 06:30:57] [INFO ] Decomposing Gal with order
[2020-05-27 06:30:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 06:30:57] [INFO ] Removed a total of 16 redundant transitions.
[2020-05-27 06:30:57] [INFO ] Flatten gal took : 92 ms
[2020-05-27 06:30:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2020-05-27 06:30:57] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-27 06:30:57] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
[2020-05-27 06:30:57] [INFO ] Proved 28 variables to be positive in 196 ms
[2020-05-27 06:30:57] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2020-05-27 06:30:57] [INFO ] Computation of disable matrix completed :0/27 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 06:30:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 06:30:57] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2020-05-27 06:30:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)

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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 8 LTL properties
Checking formula 0 : !((X((("((i1.u6.p16==0)||(u9.p24==1))")U("((i0.u4.p11==0)||(i1.u2.p5==1))"))&&("((u9.p26==0)||(i2.u8.p23==1))"))))
Formula 0 simplified : !X("((u9.p26==0)||(i2.u8.p23==1))" & ("((i1.u6.p16==0)||(u9.p24==1))" U "((i0.u4.p11==0)||(i1.u2.p5==1))"))
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t0, t20, t21, u9.t5, u9.t6, i1.u6.t1, i1.u6.t2, i1.u6.t9, i2.t12, i2.u8.t3, i2.u8.t4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/8/11/19
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
3 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.040902,17416,1,0,1494,148,349,2917,123,305,2265
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-001A-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X(X(G(F(!(F(X("((i0.u0.p1==0)||(i4.u1.p3==1))"))))))))))
Formula 1 simplified : !FXXGF!FX"((i0.u0.p1==0)||(i4.u1.p3==1))"
Computing Next relation with stutter on 1 deadlock states
7 unique states visited
6 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
3 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.07591,18460,1,0,3349,149,441,6378,129,327,6111
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldIIPs-PT-001A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(!(G(X("(i2.u8.p20==1)"))))))
Formula 2 simplified : !X!GX"(i2.u8.p20==1)"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.076862,18724,1,0,3353,149,463,6379,130,327,6161
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-001A-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((X(F(((F("((i0.u0.p2==0)||(i4.u1.p4==1))"))&&("(i0.u0.p2!=0)"))&&("(i4.u1.p4!=1)"))))U("((i0.u0.p2==0)||(i4.u1.p4==1))"))))
Formula 3 simplified : !X(XF("(i0.u0.p2!=0)" & "(i4.u1.p4!=1)" & F"((i0.u0.p2==0)||(i4.u1.p4==1))") U "((i0.u0.p2==0)||(i4.u1.p4==1))")
Computing Next relation with stutter on 1 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,0.078609,19048,1,0,3353,149,478,6379,131,327,6180
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-001A-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X("(i1.u2.p6==1)"))))
Formula 4 simplified : !FX"(i1.u2.p6==1)"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.091868,19312,1,0,5184,150,506,7828,132,329,9093
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-001A-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(F((!(F(("((i1.u2.p6==0)||(i0.u4.p11==1))")U(G("((i0.u0.p1==0)||(i4.u1.p3==1))")))))||(!(F("((u9.p24==0)||(i2.u8.p22==1))")))))))
Formula 5 simplified : F(!F("((i1.u2.p6==0)||(i0.u4.p11==1))" U G"((i0.u0.p1==0)||(i4.u1.p3==1))") | !F"((u9.p24==0)||(i2.u8.p22==1))")
Computing Next relation with stutter on 1 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 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.151241,21792,1,0,9954,151,521,14998,133,335,15710
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldIIPs-PT-001A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F(!((((F("((i1.u2.p7==0)||(i1.u2.p6==1))"))||("(i0.u0.p2==0)"))||("(i1.u6.p14==1)"))U(F("((i1.u2.p5==0)||(u9.p25==1))")))))))
Formula 6 simplified : !XF!(("(i0.u0.p2==0)" | "(i1.u6.p14==1)" | F"((i1.u2.p7==0)||(i1.u2.p6==1))") U F"((i1.u2.p5==0)||(u9.p25==1))")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
10 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.255822,26060,1,0,19691,151,545,26638,133,335,26915
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldIIPs-PT-001A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!((X(!(X("((i4.u7.p19==0)||(i4.u1.p3==1))"))))U(((X("(i1.u6.p14==1)"))&&("(i1.u6.p16==1)"))&&("((i2.u8.p21==0)||(i2.u3.p8==1))")))))
Formula 7 simplified : X!X"((i4.u7.p19==0)||(i4.u1.p3==1))" U ("((i2.u8.p21==0)||(i2.u3.p8==1))" & "(i1.u6.p16==1)" & X"(i1.u6.p14==1)")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.259957,27188,1,0,19691,151,588,26638,134,335,26983
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-001A-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
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 06:30:58] [INFO ] Built C files in 643ms 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 1590561058232

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

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

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