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.r066-tajo-158922814800753.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 DoubleExponent-PT-002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814800753
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.4K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 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 33K 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 DoubleExponent-PT-002-00
FORMULA_NAME DoubleExponent-PT-002-01
FORMULA_NAME DoubleExponent-PT-002-02
FORMULA_NAME DoubleExponent-PT-002-03
FORMULA_NAME DoubleExponent-PT-002-04
FORMULA_NAME DoubleExponent-PT-002-05
FORMULA_NAME DoubleExponent-PT-002-06
FORMULA_NAME DoubleExponent-PT-002-07
FORMULA_NAME DoubleExponent-PT-002-08
FORMULA_NAME DoubleExponent-PT-002-09
FORMULA_NAME DoubleExponent-PT-002-10
FORMULA_NAME DoubleExponent-PT-002-11
FORMULA_NAME DoubleExponent-PT-002-12
FORMULA_NAME DoubleExponent-PT-002-13
FORMULA_NAME DoubleExponent-PT-002-14
FORMULA_NAME DoubleExponent-PT-002-15

=== Now, execution of the tool begins

BK_START 1590133862821

[2020-05-22 07:51:08] [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-22 07:51:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 07:51:09] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2020-05-22 07:51:09] [INFO ] Transformed 110 places.
[2020-05-22 07:51:09] [INFO ] Transformed 98 transitions.
[2020-05-22 07:51:09] [INFO ] Parsed PT model containing 110 places and 98 transitions in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3343 resets, run finished after 348 ms. (steps per millisecond=287 ) properties seen :[0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1]
// Phase 1: matrix 98 rows 110 cols
[2020-05-22 07:51:09] [INFO ] Computed 14 place invariants in 26 ms
[2020-05-22 07:51:09] [INFO ] [Real]Absence check using 5 positive place invariants in 24 ms returned unsat
[2020-05-22 07:51:09] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2020-05-22 07:51:09] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 07:51:09] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 9 ms returned sat
[2020-05-22 07:51:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:10] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2020-05-22 07:51:10] [INFO ] Deduced a trap composed of 16 places in 133 ms
[2020-05-22 07:51:11] [INFO ] Deduced a trap composed of 33 places in 1011 ms
[2020-05-22 07:51:12] [INFO ] Deduced a trap composed of 68 places in 905 ms
[2020-05-22 07:51:13] [INFO ] Deduced a trap composed of 26 places in 1145 ms
[2020-05-22 07:51:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3428 ms
[2020-05-22 07:51:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 55 ms returned sat
[2020-05-22 07:51:13] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 31 ms returned sat
[2020-05-22 07:51:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:13] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-05-22 07:51:14] [INFO ] Deduced a trap composed of 42 places in 473 ms
[2020-05-22 07:51:15] [INFO ] Deduced a trap composed of 16 places in 842 ms
[2020-05-22 07:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1397 ms
[2020-05-22 07:51:15] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned unsat
[2020-05-22 07:51:15] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned unsat
[2020-05-22 07:51:15] [INFO ] [Real]Absence check using 5 positive place invariants in 61 ms returned unsat
[2020-05-22 07:51:15] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2020-05-22 07:51:15] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned unsat
[2020-05-22 07:51:15] [INFO ] [Real]Absence check using 5 positive place invariants in 28 ms returned unsat
[2020-05-22 07:51:15] [INFO ] [Real]Absence check using 5 positive place invariants in 22 ms returned unsat
[2020-05-22 07:51:15] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned unsat
[2020-05-22 07:51:15] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
[2020-05-22 07:51:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2020-05-22 07:51:15] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-22 07:51:15] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-05-22 07:51:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:15] [INFO ] [Real]Absence check using state equation in 56 ms returned unsat
[2020-05-22 07:51:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2020-05-22 07:51:16] [INFO ] [Real]Absence check using 5 positive place invariants in 55 ms returned unsat
[2020-05-22 07:51:16] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned unsat
[2020-05-22 07:51:16] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-22 07:51:16] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:16] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-05-22 07:51:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-05-22 07:51:16] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:51:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:16] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2020-05-22 07:51:16] [INFO ] Deduced a trap composed of 30 places in 53 ms
[2020-05-22 07:51:17] [INFO ] Deduced a trap composed of 18 places in 492 ms
[2020-05-22 07:51:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 582 ms
[2020-05-22 07:51:17] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 10 ms.
[2020-05-22 07:51:17] [INFO ] Added : 93 causal constraints over 19 iterations in 350 ms. Result :sat
[2020-05-22 07:51:17] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned unsat
[2020-05-22 07:51:17] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
Successfully simplified 19 atomic propositions for a total of 21 simplifications.
[2020-05-22 07:51:17] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2020-05-22 07:51:17] [INFO ] Flatten gal took : 71 ms
FORMULA DoubleExponent-PT-002-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 07:51:17] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 07:51:17] [INFO ] Applying decomposition
[2020-05-22 07:51:17] [INFO ] Flatten gal took : 42 ms
[2020-05-22 07:51:18] [INFO ] Input system was already deterministic with 98 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 98 rows 110 cols
[2020-05-22 07:51:18] [INFO ] Computed 14 place invariants in 12 ms
inv : p1 + p14 + p15 + p16 + p17 + p18 + p19 + p2 + p20 + p21 + p22 + p23 + p24 + p25 + p3 + p4 + p5 + p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 = 1
inv : 2*p1 + p10 + p100 + p11 + p17 + 2*p2 + p29 + p3 + p32 + p4 + p5 = 2
inv : p69 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 = 0
inv : -p102 - p19 - p20 + p55 - p57 + p58 - p60 + p62 + p81 + p88 + p91 + p93 = 0
inv : p108 - p110 - p66 - p67 = 0
inv : 3*p1 + p100 + p101 + p102 + p103 + p105 + p107 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 3*p2 + p20 + p21 + p23 + p25 + p26 + p27 + p28 + p29 + 3*p3 + p30 + p31 + p32 + p33 + p35 + p37 + p38 + p39 + 2*p4 + p40 + p41 + p42 + p43 + p44 + p45 + p47 + p49 + 2*p5 + p50 + 2*p51 + p52 + 2*p53 + p54 + 2*p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p96 + p97 + p98 + p99 = 3
inv : p71 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 = 0
inv : p1 + p100 + p101 + p102 + p103 + p105 + p106 + p107 + p14 + p15 + p16 + p17 + p18 + p19 + p2 + p20 + p21 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p3 + p30 + p31 + p32 + p33 + p34 + p35 + p37 + p4 - p48 + p5 + p50 + p51 + p52 + p53 + p54 + p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p96 + p97 + p98 + p99 = 1
inv : p1 + p100 + p101 + p102 + p103 + p105 + p107 + p14 + p15 + p16 + p17 + p18 + p19 + p2 + p20 + p21 + p23 + p25 + p26 + p27 + p28 + p29 + p3 + p30 + p31 + p32 + p33 + p34 + p35 + p37 + p38 + p39 + p4 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p49 + p5 + p50 + p51 + p52 + p53 + p54 + p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p96 + p97 + p98 + p99 = 1
inv : -p102 - p20 + p56 - p57 + p59 - p60 + p64 + p76 + p79 + p81 + p93 = 0
inv : -p1 + p104 - p14 - p15 - p16 - p17 - p18 - p19 - p2 - p20 - p21 - p23 - p24 - p25 - p26 - p27 - p28 - p29 - p3 - p30 - p31 - p32 - p33 - p34 - p35 - p37 - p4 + p48 - p5 - p50 - p51 - p52 - p53 - p54 - p6 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p7 - p70 - p72 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 = -1
inv : p109 - p110 - p67 = 0
inv : p36 + p48 - p50 - p51 - p52 - p53 - p54 = 0
inv : 2*p1 + p15 + p2 + p3 + p4 + p41 + p44 + p8 + p9 + p98 = 2
Total of 14 invariants.
[2020-05-22 07:51:18] [INFO ] Computed 14 place invariants in 13 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/graph10185058271104110798.txt, -o, /tmp/graph10185058271104110798.bin, -w, /tmp/graph10185058271104110798.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/graph10185058271104110798.bin, -l, -1, -v, -w, /tmp/graph10185058271104110798.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 07:51:18] [INFO ] Decomposing Gal with order
[2020-05-22 07:51:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 07:51:18] [INFO ] Removed a total of 21 redundant transitions.
[2020-05-22 07:51:18] [INFO ] Flatten gal took : 59 ms
[2020-05-22 07:51:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 16 ms.
[2020-05-22 07:51:18] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 24 ms
[2020-05-22 07:51:18] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 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, --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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 4 LTL properties
Checking formula 0 : !((!(G("(gu40.p9<=gu40.p101)"))))
Formula 0 simplified : G"(gu40.p9<=gu40.p101)"
[2020-05-22 07:51:19] [INFO ] Proved 110 variables to be positive in 1154 ms
[2020-05-22 07:51:19] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2020-05-22 07:51:19] [INFO ] Computation of disable matrix completed :0/98 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:51:19] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:51:19] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2020-05-22 07:51:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:51:19] [INFO ] Computing symmetric co enabling matrix : 98 transitions.
Reverse transition relation is NOT exact ! Due to transitions gi3.gi1.gi0.gi4.t16, gi3.gi1.gi0.gi4.t19, gi3.gi1.gi0.gi4.t94, gi3.gi1.gi0.gi4.t97, gi3.gi1.gi0.gi5.gu15.t30, gi3.gi1.gi0.gi5.t25, gi3.gi1.gi0.gi6.gu19.t42, gi3.gi1.gi0.gi6.t37, gi3.gi1.gi0.gi8.gu36.t72, gi3.gi1.gi0.gi8.t67, gi3.gi1.gi1.gi0.gu9.t49, gi3.gi1.gi1.gi2.gu42.t84, gi3.gi1.gi1.gi2.t79, gi3.gi1.gi1.t61, gi3.gi1.t73, gi3.gi1.t85, t51, t58, t7, t88, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/77/20/97
Computing Next relation with stutter on 396 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
283 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.89991,82408,1,0,208,200442,220,128,3019,124206,291
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(F((X(!(X(X(!(X("(gu29.p63<=gu29.p69)")))))))&&("(gu30.p79<=gu30.p7)")))))
Formula 1 simplified : !F("(gu30.p79<=gu30.p7)" & X!XX!X"(gu29.p63<=gu29.p69)")
Computing Next relation with stutter on 396 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 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,2.90539,84272,1,0,208,200472,234,131,3030,124287,321
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G("(gi3.gi1.gi0.gi8.gu32.p74>=1)"))))
Formula 2 simplified : !XG"(gi3.gi1.gi0.gi8.gu32.p74>=1)"
Computing Next relation with stutter on 396 deadlock states
[2020-05-22 07:51:22] [INFO ] Computation of co-enabling matrix(28/98) took 2539 ms. Total solver calls (SAT/UNSAT): 2407(3/2404)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
205 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,4.9534,129172,1,0,1953,434056,246,1898,3196,470578,2988
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(F(X(F(X("(gi3.gi1.gi0.gi4.gu13.p16>=1)")))))))
Formula 3 simplified : FXFX"(gi3.gi1.gi0.gi4.gu13.p16>=1)"
Computing Next relation with stutter on 396 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,4.96896,129680,1,0,1963,434891,252,1913,3197,473640,3033
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-15 FALSE 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.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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-22 07:51:24] [INFO ] Built C files in 6084ms 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 1590133884495

--------------------
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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r066-tajo-158922814800753"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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