Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r141-smll-158961510700226.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 Raft-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510700226
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.1K Apr 12 07:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 07:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 11 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 10 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 24K Mar 24 05:38 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 Raft-PT-03-00
FORMULA_NAME Raft-PT-03-01
FORMULA_NAME Raft-PT-03-02
FORMULA_NAME Raft-PT-03-03
FORMULA_NAME Raft-PT-03-04
FORMULA_NAME Raft-PT-03-05
FORMULA_NAME Raft-PT-03-06
FORMULA_NAME Raft-PT-03-07
FORMULA_NAME Raft-PT-03-08
FORMULA_NAME Raft-PT-03-09
FORMULA_NAME Raft-PT-03-10
FORMULA_NAME Raft-PT-03-11
FORMULA_NAME Raft-PT-03-12
FORMULA_NAME Raft-PT-03-13
FORMULA_NAME Raft-PT-03-14
FORMULA_NAME Raft-PT-03-15

=== Now, execution of the tool begins

BK_START 1590053510542

[2020-05-21 09:31:53] [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-21 09:31:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 09:31:53] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2020-05-21 09:31:53] [INFO ] Transformed 53 places.
[2020-05-21 09:31:53] [INFO ] Transformed 98 transitions.
[2020-05-21 09:31:53] [INFO ] Found NUPN structural information;
[2020-05-21 09:31:53] [INFO ] Parsed PT model containing 53 places and 98 transitions in 164 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 554 ms. (steps per millisecond=180 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1]
[2020-05-21 09:31:54] [INFO ] Flow matrix only has 73 transitions (discarded 11 similar events)
// Phase 1: matrix 73 rows 53 cols
[2020-05-21 09:31:54] [INFO ] Computed 9 place invariants in 6 ms
[2020-05-21 09:31:54] [INFO ] [Real]Absence check using 9 positive place invariants in 30 ms returned sat
[2020-05-21 09:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:54] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2020-05-21 09:31:54] [INFO ] State equation strengthened by 34 read => feed constraints.
[2020-05-21 09:31:54] [INFO ] [Real]Added 34 Read/Feed constraints in 9 ms returned sat
[2020-05-21 09:31:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:31:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 21 ms returned sat
[2020-05-21 09:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:54] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-05-21 09:31:54] [INFO ] [Nat]Added 34 Read/Feed constraints in 13 ms returned sat
[2020-05-21 09:31:54] [INFO ] Computed and/alt/rep : 83/502/72 causal constraints in 16 ms.
[2020-05-21 09:31:54] [INFO ] Added : 68 causal constraints over 14 iterations in 287 ms. Result :sat
[2020-05-21 09:31:55] [INFO ] Deduced a trap composed of 10 places in 79 ms
[2020-05-21 09:31:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2020-05-21 09:31:55] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2020-05-21 09:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:55] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-05-21 09:31:55] [INFO ] [Real]Added 34 Read/Feed constraints in 14 ms returned sat
[2020-05-21 09:31:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:31:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2020-05-21 09:31:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:55] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2020-05-21 09:31:55] [INFO ] [Nat]Added 34 Read/Feed constraints in 20 ms returned sat
[2020-05-21 09:31:55] [INFO ] Computed and/alt/rep : 83/502/72 causal constraints in 15 ms.
[2020-05-21 09:31:55] [INFO ] Added : 68 causal constraints over 14 iterations in 233 ms. Result :sat
[2020-05-21 09:31:55] [INFO ] Deduced a trap composed of 10 places in 44 ms
[2020-05-21 09:31:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2020-05-21 09:31:55] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2020-05-21 09:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:55] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2020-05-21 09:31:55] [INFO ] [Real]Added 34 Read/Feed constraints in 8 ms returned sat
[2020-05-21 09:31:55] [INFO ] Computed and/alt/rep : 83/502/72 causal constraints in 17 ms.
[2020-05-21 09:31:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:31:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2020-05-21 09:31:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:55] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-05-21 09:31:55] [INFO ] [Nat]Added 34 Read/Feed constraints in 8 ms returned sat
[2020-05-21 09:31:55] [INFO ] Computed and/alt/rep : 83/502/72 causal constraints in 10 ms.
[2020-05-21 09:31:56] [INFO ] Added : 71 causal constraints over 15 iterations in 268 ms. Result :sat
[2020-05-21 09:31:56] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2020-05-21 09:31:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:56] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-21 09:31:56] [INFO ] [Real]Added 34 Read/Feed constraints in 8 ms returned sat
[2020-05-21 09:31:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:31:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2020-05-21 09:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:56] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2020-05-21 09:31:56] [INFO ] [Nat]Added 34 Read/Feed constraints in 6 ms returned sat
[2020-05-21 09:31:56] [INFO ] Computed and/alt/rep : 83/502/72 causal constraints in 11 ms.
[2020-05-21 09:31:56] [INFO ] Added : 68 causal constraints over 14 iterations in 234 ms. Result :sat
[2020-05-21 09:31:56] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2020-05-21 09:31:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:56] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-05-21 09:31:56] [INFO ] [Real]Added 34 Read/Feed constraints in 11 ms returned sat
[2020-05-21 09:31:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:31:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 16 ms returned sat
[2020-05-21 09:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:56] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2020-05-21 09:31:56] [INFO ] [Nat]Added 34 Read/Feed constraints in 8 ms returned sat
[2020-05-21 09:31:56] [INFO ] Computed and/alt/rep : 83/502/72 causal constraints in 7 ms.
[2020-05-21 09:31:56] [INFO ] Added : 65 causal constraints over 13 iterations in 180 ms. Result :sat
[2020-05-21 09:31:56] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2020-05-21 09:31:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:56] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-05-21 09:31:56] [INFO ] [Real]Added 34 Read/Feed constraints in 8 ms returned sat
[2020-05-21 09:31:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:31:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2020-05-21 09:31:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:57] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2020-05-21 09:31:57] [INFO ] [Nat]Added 34 Read/Feed constraints in 9 ms returned sat
[2020-05-21 09:31:57] [INFO ] Computed and/alt/rep : 83/502/72 causal constraints in 17 ms.
[2020-05-21 09:31:57] [INFO ] Added : 63 causal constraints over 13 iterations in 244 ms. Result :sat
[2020-05-21 09:31:57] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-21 09:31:57] [INFO ] Flatten gal took : 76 ms
FORMULA Raft-PT-03-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 09:31:57] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 09:31:57] [INFO ] Applying decomposition
[2020-05-21 09:31:57] [INFO ] Flatten gal took : 22 ms
[2020-05-21 09:31:57] [INFO ] Input system was already deterministic with 84 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/graph16478954200601352215.txt, -o, /tmp/graph16478954200601352215.bin, -w, /tmp/graph16478954200601352215.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/graph16478954200601352215.bin, -l, -1, -v, -w, /tmp/graph16478954200601352215.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 73 out of 84 initially.
// Phase 1: matrix 73 rows 53 cols
[2020-05-21 09:31:58] [INFO ] Computed 9 place invariants in 3 ms
inv : p0 + p21 + p22 + p23 + p24 + p25 = 1
inv : p0 + p11 + p12 + p13 + p14 + p15 = 1
inv : p0 + p41 + p42 + p43 + p44 + p45 = 1
inv : p0 + p16 + p17 + p18 + p19 + p20 = 1
inv : p0 + p26 + p27 + p28 + p29 + p30 = 1
inv : p0 + p36 + p37 + p38 + p39 + p40 = 1
inv : p0 + p6 + p7 + p8 + p9 + p10 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 = 1
inv : p0 + p31 + p32 + p33 + p34 + p35 = 1
Total of 9 invariants.
[2020-05-21 09:31:58] [INFO ] Computed 9 place invariants in 5 ms
[2020-05-21 09:31:58] [INFO ] Decomposing Gal with order
[2020-05-21 09:31:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 09:31:58] [INFO ] Removed a total of 52 redundant transitions.
[2020-05-21 09:31:58] [INFO ] Flatten gal took : 70 ms
[2020-05-21 09:31:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 12 ms.
[2020-05-21 09:31:58] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
[2020-05-21 09:31:58] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 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 13 LTL properties
[2020-05-21 09:31:58] [INFO ] Proved 53 variables to be positive in 224 ms
[2020-05-21 09:31:58] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2020-05-21 09:31:58] [INFO ] Computation of disable matrix completed :0/84 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Checking formula 0 : !(((X(!(F("((i0.u6.p35==1)&&(u10.p46==1))"))))||((F("((i0.u1.p6==1)&&(i2.u8.p45==1))"))&&(F("((u4.p23==1)&&(i0.u6.p35==1))")))))
Formula 0 simplified : !(X!F"((i0.u6.p35==1)&&(u10.p46==1))" | (F"((i0.u1.p6==1)&&(i2.u8.p45==1))" & F"((u4.p23==1)&&(i0.u6.p35==1))"))
[2020-05-21 09:31:58] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:31:58] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2020-05-21 09:31:58] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
built 16 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.u6.t18, i0.u6.t19, i0.u6.t20, i0.u6.t22, i2.u8.t6, i2.u8.t7, i2.u8.t8, i2.u8.t10, i3.u7.t12, i3.u7.t13, i3.u7.t14, i3.u7.t16, i6.t97, i6.u11.t95, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/49/14/63
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
8 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.122433,19036,1,0,4593,179,736,9289,186,818,9370
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Raft-PT-03-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((X(F(((("((i0.u6.p35==1)&&(u10.p46==1))")U(G("((u2.p14==1)&&(i0.u6.p35==1))")))U("((u2.p14==1)&&(i0.u6.p35==1))"))||("((u2.p14==1)&&(i0.u6.p35==1))"))))||(G("(i3.u7.p39==1)")))))
Formula 1 simplified : !X(XF("((u2.p14==1)&&(i0.u6.p35==1))" | (("((i0.u6.p35==1)&&(u10.p46==1))" U G"((u2.p14==1)&&(i0.u6.p35==1))") U "((u2.p14==1)&&(i0.u6.p35==1))")) | G"(i3.u7.p39==1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.139426,19844,1,0,5703,179,799,10928,188,839,12083
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Raft-PT-03-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X(G(F((G(("((u2.p15==1)&&(i3.u7.p40==1))")U("((i2.u3.p19==1)&&(i2.u8.p45==1))")))&&("(i6.u11.p50!=1)")))))))
Formula 2 simplified : !XXGF("(i6.u11.p50!=1)" & G("((u2.p15==1)&&(i3.u7.p40==1))" U "((i2.u3.p19==1)&&(i2.u8.p45==1))"))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.166376,21756,1,0,6654,179,921,13037,189,879,14384
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Raft-PT-03-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((((!(G(F(G("(i2.u8.p45==1)")))))&&(!(F("((u0.p5==1)&&(i0.u6.p35==1))"))))&&(X("((u0.p5==1)&&(i0.u6.p35==1))"))))
Formula 3 simplified : !(!GFG"(i2.u8.p45==1)" & !F"((u0.p5==1)&&(i0.u6.p35==1))" & X"((u0.p5==1)&&(i0.u6.p35==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.167939,21948,1,0,6654,179,923,13037,189,879,14387
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Raft-PT-03-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G(("(i2.u8.p44==1)")U((F(X("((i2.u8.p44==1)||(i3.u7.p37==1))")))&&(X(X("((i3.u7.p40==1)&&(u10.p46==1))"))))))))
Formula 4 simplified : !FG("(i2.u8.p44==1)" U (FX"((i2.u8.p44==1)||(i3.u7.p37==1))" & XX"((i3.u7.p40==1)&&(u10.p46==1))"))
4 unique states visited
4 strongly connected components in search stack
5 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,0.178859,22080,1,0,6809,179,950,13450,189,902,14710
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Raft-PT-03-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((!(F(G(F((!(G("(i0.u6.p32==1)")))||("(i6.u11.p50==1)"))))))||("(i0.u6.p33!=1)"))))
Formula 5 simplified : !G("(i0.u6.p33!=1)" | !FGF("(i6.u11.p50==1)" | !G"(i0.u6.p32==1)"))
10 unique states visited
4 strongly connected components in search stack
12 transitions explored
10 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.212995,22804,1,0,8909,179,1015,17110,193,977,20643
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Raft-PT-03-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((X(G("(((((u0.p5==1)&&(i0.u6.p35==1))||((u0.p1==1)&&(i3.u7.p40==1)))&&(u0.p1==1))&&(i3.u7.p40==1))")))&&(("((u0.p5==1)&&(i0.u6.p35==1))")U(G("((u2.p15==1)&&(i3.u7.p40==1))"))))))
Formula 6 simplified : !F(XG"(((((u0.p5==1)&&(i0.u6.p35==1))||((u0.p1==1)&&(i3.u7.p40==1)))&&(u0.p1==1))&&(i3.u7.p40==1))" & ("((u0.p5==1)&&(i0.u6.p35==1))" U G"((u2.p15==1)&&(i3.u7.p40==1))"))
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
9 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.313017,25684,1,0,15401,179,1145,26239,193,991,32825
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Raft-PT-03-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((G(X(!(G(F("((i0.u1.p10!=1)||(i0.u6.p35!=1))"))))))U(F("(i3.u7.p40==1)")))))
Formula 7 simplified : !X(GX!GF"((i0.u1.p10!=1)||(i0.u6.p35!=1))" U F"(i3.u7.p40==1)")
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.315705,25948,1,0,15401,179,1165,26239,194,991,32836
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Raft-PT-03-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(F("((i2.u8.p41==1)&&(i6.u11.p52==1))")))U(X("((u10.p49!=1)||(i6.u11.p50!=1))"))))
Formula 8 simplified : !(XF"((i2.u8.p41==1)&&(i6.u11.p52==1))" U X"((u10.p49!=1)||(i6.u11.p50!=1))")
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.317269,25948,1,0,15401,179,1186,26239,194,991,32849
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Raft-PT-03-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(X(G("((i2.u8.p45==1)&&(i6.u9.p48==1))")))))
Formula 9 simplified : !GXG"((i2.u8.p45==1)&&(i6.u9.p48==1))"
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.319826,25948,1,0,15499,179,1208,26359,194,991,33024
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Raft-PT-03-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(!(X(G(F("((((i3.u7.p38==1)&&(i6.u11.p52==1))&&(i3.u7.p36==1))||(i2.u8.p45==1))")))))))
Formula 10 simplified : !X!XGF"((((i3.u7.p38==1)&&(i6.u11.p52==1))&&(i3.u7.p36==1))||(i2.u8.p45==1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.362623,27268,1,0,18995,179,1243,30973,196,997,38263
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Raft-PT-03-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((X((F("(i0.u6.p34!=1)"))||(F("(i3.u7.p40!=1)"))))&&(F(G(F("((i2.u3.p16==1)&&(i2.u8.p45==1))"))))))
Formula 11 simplified : !(X(F"(i0.u6.p34!=1)" | F"(i3.u7.p40!=1)") & FGF"((i2.u3.p16==1)&&(i2.u8.p45==1))")
5 unique states visited
4 strongly connected components in search stack
6 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,0.369351,27532,1,0,19259,179,1294,31636,196,999,38777
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Raft-PT-03-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X("(i0.u6.p32==1)"))||((F((F("(i3.u7.p37==1)"))U(F("((u4.p25!=1)||(i2.u8.p45!=1))"))))U("(i3.u7.p37==1)"))))
Formula 12 simplified : !(X"(i0.u6.p32==1)" | (F(F"(i3.u7.p37==1)" U F"((u4.p25!=1)||(i2.u8.p45!=1))") U "(i3.u7.p37==1)"))
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.379873,27796,1,0,19965,179,1344,32503,196,1005,40447
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Raft-PT-03-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 09:31:58] [INFO ] Built C files in 860ms 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 1590053519911

--------------------
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="Raft-PT-03"
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 Raft-PT-03, 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 r141-smll-158961510700226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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