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.r111-csrt-158961257700513.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 Parking-PT-104, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257700513
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.2K Apr 11 23:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 11 23:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 10 22:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 10 22:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 10 07:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 10 07:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 9 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 23K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1590000655922

[2020-05-20 18:50:58] [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-20 18:50:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:50:58] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2020-05-20 18:50:58] [INFO ] Transformed 65 places.
[2020-05-20 18:50:58] [INFO ] Transformed 97 transitions.
[2020-05-20 18:50:58] [INFO ] Found NUPN structural information;
[2020-05-20 18:50:58] [INFO ] Parsed PT model containing 65 places and 97 transitions in 121 ms.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5960 resets, run finished after 266 ms. (steps per millisecond=375 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 56 rows 65 cols
[2020-05-20 18:50:59] [INFO ] Computed 16 place invariants in 5 ms
[2020-05-20 18:50:59] [INFO ] [Real]Absence check using 15 positive place invariants in 40 ms returned sat
[2020-05-20 18:50:59] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 3 ms returned sat
[2020-05-20 18:50:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:50:59] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2020-05-20 18:50:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:50:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 34 ms returned unsat
[2020-05-20 18:50:59] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2020-05-20 18:50:59] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-20 18:50:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:50:59] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2020-05-20 18:50:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:50:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 29 ms returned sat
[2020-05-20 18:50:59] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-20 18:50:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:50:59] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2020-05-20 18:50:59] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-05-20 18:50:59] [INFO ] [Nat]Added 12 Read/Feed constraints in 16 ms returned sat
[2020-05-20 18:50:59] [INFO ] Computed and/alt/rep : 55/191/55 causal constraints in 31 ms.
[2020-05-20 18:51:00] [INFO ] Added : 53 causal constraints over 11 iterations in 236 ms. Result :sat
[2020-05-20 18:51:00] [INFO ] [Real]Absence check using 15 positive place invariants in 61 ms returned sat
[2020-05-20 18:51:00] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 17 ms returned sat
[2020-05-20 18:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:00] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2020-05-20 18:51:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2020-05-20 18:51:00] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:00] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-05-20 18:51:00] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2020-05-20 18:51:00] [INFO ] Computed and/alt/rep : 55/191/55 causal constraints in 6 ms.
[2020-05-20 18:51:00] [INFO ] Added : 53 causal constraints over 11 iterations in 161 ms. Result :sat
[2020-05-20 18:51:00] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2020-05-20 18:51:00] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-20 18:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:00] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-05-20 18:51:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned unsat
[2020-05-20 18:51:00] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2020-05-20 18:51:00] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:00] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-20 18:51:00] [INFO ] [Real]Added 12 Read/Feed constraints in 3 ms returned sat
[2020-05-20 18:51:00] [INFO ] Computed and/alt/rep : 55/191/55 causal constraints in 9 ms.
[2020-05-20 18:51:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 20 ms returned sat
[2020-05-20 18:51:01] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:01] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-05-20 18:51:01] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2020-05-20 18:51:01] [INFO ] Computed and/alt/rep : 55/191/55 causal constraints in 8 ms.
[2020-05-20 18:51:01] [INFO ] Added : 55 causal constraints over 11 iterations in 179 ms. Result :sat
[2020-05-20 18:51:01] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2020-05-20 18:51:01] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-20 18:51:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:01] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2020-05-20 18:51:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned unsat
[2020-05-20 18:51:01] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2020-05-20 18:51:01] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-20 18:51:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:01] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-05-20 18:51:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned unsat
[2020-05-20 18:51:01] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2020-05-20 18:51:01] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:01] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-05-20 18:51:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-05-20 18:51:01] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-20 18:51:01] [INFO ] Flatten gal took : 53 ms
FORMULA Parking-PT-104-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-20 18:51:01] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
[2020-05-20 18:51:01] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-20 18:51:01] [INFO ] Flatten gal took : 12 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/graph8071888397551156077.txt, -o, /tmp/graph8071888397551156077.bin, -w, /tmp/graph8071888397551156077.weights], workingDir=null]
[2020-05-20 18:51:02] [INFO ] Input system was already deterministic with 56 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph8071888397551156077.bin, -l, -1, -v, -w, /tmp/graph8071888397551156077.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 18:51:02] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 65 cols
[2020-05-20 18:51:02] [INFO ] Computed 16 place invariants in 2 ms
inv : -4*p0 + p17 + p18 + p19 + p20 + p21 + p22 + p23 - p32 - p40 - p48 - p58 - p60 = -4
inv : p0 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p61 + p62 + p63 + p64 = 1
inv : 5*p0 + p24 + p32 + p40 + p48 + p58 + p60 = 5
inv : p0 + p15 + p16 = 1
inv : p0 + p59 + p60 = 1
inv : p0 + p11 + p12 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p7 + p8 = 1
[2020-05-20 18:51:02] [INFO ] Rewriting arrays to variables to allow decomposition.
inv : p0 + p9 + p10 = 1
inv : p0 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 = 1
Total of 16 invariants.
[2020-05-20 18:51:02] [INFO ] Computed 16 place invariants in 27 ms
[2020-05-20 18:51:02] [INFO ] Removed a total of 2 redundant transitions.
[2020-05-20 18:51:02] [INFO ] Flatten gal took : 160 ms
[2020-05-20 18:51:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-20 18:51:02] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 28 ms
[2020-05-20 18:51:02] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 9 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]

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 7 LTL properties
Checking formula 0 : !((X(X(G(F(!(G("((u17.p40==0)||(i1.u8.p20==1))"))))))))
Formula 0 simplified : !XXGF!G"((u17.p40==0)||(i1.u8.p20==1))"
built 18 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t92, t93, t94, t95, u18.t4, u18.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/50/6/56
Computing Next relation with stutter on 16 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
7 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.12908,18724,1,0,4211,1824,903,4901,479,4052,11031
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-104-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((((X("((i4.u5.p39==0)||(i5.u12.p42==1))"))&&("((i0.u10.p33==0)||(u17.p23==1))"))U("((u18.p29==0)||(i2.u9.p28==1))"))U("((i0.u10.p33!=0)&&(u17.p23!=1))")))
Formula 1 simplified : !((("((i0.u10.p33==0)||(u17.p23==1))" & X"((i4.u5.p39==0)||(i5.u12.p42==1))") U "((u18.p29==0)||(i2.u9.p28==1))") U "((i0.u10.p33!=0)&&(u17.p23!=1))")
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 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.163286,21384,1,0,6943,1933,1000,7898,485,5528,18237
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-104-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(X(G(X("((i4.u11.p36==0)||(i4.u11.p35==1))")))))))
Formula 2 simplified : !FXXGX"((i4.u11.p36==0)||(i4.u11.p35==1))"
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 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.16746,21384,1,0,7213,1939,1032,8243,491,5606,19138
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Parking-PT-104-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G("((i5.u13.p45==0)||(i6.u3.p8==1))")))
Formula 3 simplified : !G"((i5.u13.p45==0)||(i6.u3.p8==1))"
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.18801,21876,1,0,9025,1953,1056,10735,491,5861,22978
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Parking-PT-104-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(G(((X(F("((i0.u4.p9==0)||(i4.u5.p39==1))")))||("(i0.u4.p9==0)"))||("(i4.u5.p39==1)"))))))
Formula 4 simplified : !XFG("(i0.u4.p9==0)" | "(i4.u5.p39==1)" | XF"((i0.u4.p9==0)||(i4.u5.p39==1))")
Computing Next relation with stutter on 16 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4 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.226309,23080,1,0,11550,1959,1107,13210,493,5942,28403
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Parking-PT-104-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((G(!(F(((X(F("((i1.u8.p20==0)||(u18.p64==1))")))||("(i5.u6.p14==0)"))||("(i5.u13.p43==1)")))))U("((i5.u12.p41==0)||(i5.u12.p42==1))"))))
Formula 5 simplified : !X(G!F("(i5.u6.p14==0)" | "(i5.u13.p43==1)" | XF"((i1.u8.p20==0)||(u18.p64==1))") U "((i5.u12.p41==0)||(i5.u12.p42==1))")
Computing Next relation with stutter on 16 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.231611,23936,1,0,11550,1959,1151,13210,495,5942,28420
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Parking-PT-104-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(X("((i5.u13.p44==0)||(i0.u4.p10==1))")))&&(F("((u18.p22==0)||(i1.u0.p17==1))"))))
Formula 6 simplified : !(!X"((i5.u13.p44==0)||(i0.u4.p10==1))" & F"((u18.p22==0)||(i1.u0.p17==1))")
Computing Next relation with stutter on 16 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,0.247464,23936,1,0,11608,1960,1164,13256,495,5956,28607
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Parking-PT-104-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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-20 18:51:02] [INFO ] Built C files in 763ms 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 1590000663460

--------------------
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="Parking-PT-104"
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 Parking-PT-104, 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 r111-csrt-158961257700513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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