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-158961510800290.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 Railroad-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510800290
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.7K Apr 12 08:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 08:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 09:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 11 09:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 14:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 14:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 9 21:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 9 21:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 30K 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 Railroad-PT-005-00
FORMULA_NAME Railroad-PT-005-01
FORMULA_NAME Railroad-PT-005-02
FORMULA_NAME Railroad-PT-005-03
FORMULA_NAME Railroad-PT-005-04
FORMULA_NAME Railroad-PT-005-05
FORMULA_NAME Railroad-PT-005-06
FORMULA_NAME Railroad-PT-005-07
FORMULA_NAME Railroad-PT-005-08
FORMULA_NAME Railroad-PT-005-09
FORMULA_NAME Railroad-PT-005-10
FORMULA_NAME Railroad-PT-005-11
FORMULA_NAME Railroad-PT-005-12
FORMULA_NAME Railroad-PT-005-13
FORMULA_NAME Railroad-PT-005-14
FORMULA_NAME Railroad-PT-005-15

=== Now, execution of the tool begins

BK_START 1590072668974

[2020-05-21 14:51:12] [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 14:51:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 14:51:12] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2020-05-21 14:51:12] [INFO ] Transformed 68 places.
[2020-05-21 14:51:12] [INFO ] Transformed 56 transitions.
[2020-05-21 14:51:12] [INFO ] Parsed PT model containing 68 places and 56 transitions in 166 ms.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 5 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 581 ms. (steps per millisecond=172 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 51 rows 52 cols
[2020-05-21 14:51:13] [INFO ] Computed 26 place invariants in 11 ms
[2020-05-21 14:51:13] [INFO ] [Real]Absence check using 12 positive place invariants in 29 ms returned sat
[2020-05-21 14:51:13] [INFO ] [Real]Absence check using 12 positive and 14 generalized place invariants in 16 ms returned unsat
[2020-05-21 14:51:13] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2020-05-21 14:51:13] [INFO ] [Real]Absence check using 12 positive and 14 generalized place invariants in 6 ms returned unsat
[2020-05-21 14:51:13] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2020-05-21 14:51:13] [INFO ] [Real]Absence check using 12 positive and 14 generalized place invariants in 5 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-21 14:51:13] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-21 14:51:13] [INFO ] Flatten gal took : 75 ms
FORMULA Railroad-PT-005-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 14:51:13] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 14:51:13] [INFO ] Applying decomposition
[2020-05-21 14:51:13] [INFO ] Flatten gal took : 34 ms
[2020-05-21 14:51:13] [INFO ] Input system was already deterministic with 51 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/graph16859701367359810372.txt, -o, /tmp/graph16859701367359810372.bin, -w, /tmp/graph16859701367359810372.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/graph16859701367359810372.bin, -l, -1, -v, -w, /tmp/graph16859701367359810372.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 14:51:14] [INFO ] Decomposing Gal with order
[2020-05-21 14:51:14] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 51 rows 52 cols
[2020-05-21 14:51:14] [INFO ] Computed 26 place invariants in 6 ms
inv : pl_P0_2 - pl_P32_1 + pl_P40_2 = 0
inv : pl_P12_1 + pl_P15_1 + pl_P31_1 = 1
inv : pl_P26_1 - pl_P29_3 = 0
inv : pl_P0_4 + pl_P18_1 + pl_P40_4 + pl_P41_1 = 1
inv : pl_P13_1 + pl_P19_1 + pl_P32_1 = 1
inv : pl_P25_1 - pl_P8_1 = 0
inv : -pl_P29_3 + pl_P34_1 + pl_P35_1 - pl_P36_1 + pl_P7_3 = 0
inv : pl_P10_1 + pl_P23_1 + pl_P35_1 + pl_P36_1 + pl_P7_1 = 1
inv : pl_P20_1 + pl_P5_1 + pl_P8_1 = 1
inv : pl_P16_1 + pl_P17_1 + pl_P6_1 = 1
inv : pl_P28_1 - pl_P41_1 = 0
inv : -pl_P23_1 + pl_P2_1 - pl_P36_1 + pl_P42_1 = 0
inv : -pl_P23_1 + pl_P29_1 + pl_P29_3 + pl_P33_1 - pl_P35_1 - pl_P36_1 - pl_P7_1 = 0
inv : pl_P0_3 - pl_P31_1 + pl_P40_3 = 0
inv : pl_P13_1 + pl_P22_1 + pl_P32_1 = 1
inv : pl_P23_1 + pl_P30_1 + pl_P36_1 = 1
inv : pl_P0_1 + pl_P40_1 - pl_P6_1 = 0
inv : -pl_P18_1 - pl_P20_1 - pl_P29_3 + pl_P31_1 + pl_P32_1 + pl_P34_3 + 2*pl_P34_4 + 3*pl_P34_5 + 4*pl_P34_6 + pl_P35_1 - pl_P36_1 - pl_P40_1 - pl_P40_2 - pl_P40_3 - pl_P40_4 - pl_P40_5 - pl_P41_1 + pl_P42_1 + pl_P6_1 + pl_P7_3 - pl_P8_1 = 2
inv : pl_P11_1 - pl_P23_1 + pl_P29_3 + pl_P33_1 - pl_P35_1 - pl_P36_1 - pl_P7_1 = 0
inv : pl_P33_1 - pl_P36_1 + pl_P39_1 + pl_P7_3 = 0
inv : pl_P17_1 + pl_P4_1 + pl_P6_1 = 1
inv : pl_P15_1 + pl_P21_1 + pl_P31_1 = 1
inv : pl_P23_1 + pl_P29_2 - pl_P33_1 + pl_P35_1 + pl_P36_1 + pl_P7_1 = 1
inv : pl_P0_5 + pl_P20_1 + pl_P40_5 + pl_P8_1 = 1
inv : pl_P18_1 + pl_P27_1 + pl_P41_1 = 1
inv : pl_P18_1 + pl_P20_1 + 5*pl_P29_3 - pl_P31_1 - pl_P32_1 + 4*pl_P34_2 + 3*pl_P34_3 + 2*pl_P34_4 + pl_P34_5 - 5*pl_P35_1 + 5*pl_P36_1 + pl_P40_1 + pl_P40_2 + pl_P40_3 + pl_P40_4 + pl_P40_5 + pl_P41_1 - pl_P42_1 - pl_P6_1 - 5*pl_P7_3 + pl_P8_1 = 2
Total of 26 invariants.
[2020-05-21 14:51:14] [INFO ] Computed 26 place invariants in 7 ms
[2020-05-21 14:51:14] [INFO ] Removed a total of 60 redundant transitions.
[2020-05-21 14:51:14] [INFO ] Flatten gal took : 120 ms
[2020-05-21 14:51:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 12 ms.
[2020-05-21 14:51:14] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2020-05-21 14:51:14] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 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 9 LTL properties
Checking formula 0 : !(((X(((("((i5.u11.pl_P36_1>=1)&&(u6.pl_P7_3>=1))")U("(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_2>=1))&&(i2.u7.pl_P42_1>=1))"))&&("(((i5.u11.pl_P23_1<1)||(i5.u10.pl_P34_5<1))||(i5.u3.pl_P40_5<1))"))||("(((i5.u11.pl_P23_1>=1)&&(i5.u10.pl_P34_5>=1))&&(i5.u3.pl_P40_5>=1))")))||(("(((i5.u11.pl_P23_1>=1)&&(i5.u10.pl_P34_5>=1))&&(i5.u3.pl_P40_5>=1))")U(X(G("(((i5.u11.pl_P23_1>=1)&&(i5.u10.pl_P34_5>=1))&&(i5.u3.pl_P40_5>=1))"))))))
Formula 0 simplified : !(X("(((i5.u11.pl_P23_1>=1)&&(i5.u10.pl_P34_5>=1))&&(i5.u3.pl_P40_5>=1))" | ("(((i5.u11.pl_P23_1<1)||(i5.u10.pl_P34_5<1))||(i5.u3.pl_P40_5<1))" & ("((i5.u11.pl_P36_1>=1)&&(u6.pl_P7_3>=1))" U "(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_2>=1))&&(i2.u7.pl_P42_1>=1))"))) | ("(((i5.u11.pl_P23_1>=1)&&(i5.u10.pl_P34_5>=1))&&(i5.u3.pl_P40_5>=1))" U XG"(((i5.u11.pl_P23_1>=1)&&(i5.u10.pl_P34_5>=1))&&(i5.u3.pl_P40_5>=1))"))
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 17 ordering constraints for composite.
built 5 ordering constraints for composite.
[2020-05-21 14:51:14] [INFO ] Proved 52 variables to be positive in 233 ms
[2020-05-21 14:51:14] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2020-05-21 14:51:14] [INFO ] Computation of disable matrix completed :0/51 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 14:51:14] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 14:51:14] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2020-05-21 14:51:14] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions tr_T18_1, tr_T24_2, tr_T24_4, tr_T24_5, tr_T3_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/35/5/40
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
6 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.103322,18600,1,0,2128,440,771,2672,370,695,6565
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Railroad-PT-005-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G((((G("(((i3.u2.pl_P0_4>=1)&&(i3.u5.pl_P27_1>=1))&&(i2.u7.pl_P2_1>=1))"))||("(i3.u2.pl_P0_4<1)"))||("(i3.u5.pl_P27_1<1)"))||("(i2.u7.pl_P2_1<1)")))))
Formula 1 simplified : !FG("(i2.u7.pl_P2_1<1)" | "(i3.u2.pl_P0_4<1)" | "(i3.u5.pl_P27_1<1)" | G"(((i3.u2.pl_P0_4>=1)&&(i3.u5.pl_P27_1>=1))&&(i2.u7.pl_P2_1>=1))")
3 unique states visited
2 strongly connected components in search stack
4 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.149736,20184,1,0,4731,441,864,4861,374,703,12959
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Railroad-PT-005-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((G("((u6.pl_P29_2>=1)&&(u6.pl_P33_1>=1))"))U(X(G(F(G("(((i5.u11.pl_P23_1>=1)&&(i5.u10.pl_P34_5>=1))&&(i1.u1.pl_P40_3>=1))"))))))U("((u6.pl_P29_2>=1)&&(u6.pl_P33_1>=1))")))
Formula 2 simplified : !((G"((u6.pl_P29_2>=1)&&(u6.pl_P33_1>=1))" U XGFG"(((i5.u11.pl_P23_1>=1)&&(i5.u10.pl_P34_5>=1))&&(i1.u1.pl_P40_3>=1))") U "((u6.pl_P29_2>=1)&&(u6.pl_P33_1>=1))")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.159624,20580,1,0,4885,449,913,5042,378,743,13603
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Railroad-PT-005-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G(!(X("(((i5.u11.pl_P23_1<1)||(i5.u11.pl_P34_4<1))||(i3.u2.pl_P40_4<1))"))))&&(F("(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_2>=1))&&(i6.u12.pl_P40_1>=1))"))))
Formula 3 simplified : !(G!X"(((i5.u11.pl_P23_1<1)||(i5.u11.pl_P34_4<1))||(i3.u2.pl_P40_4<1))" & F"(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_2>=1))&&(i6.u12.pl_P40_1>=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.16446,20772,1,0,4885,449,938,5042,380,744,13641
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Railroad-PT-005-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(F("(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_3>=1))&&(i1.u1.pl_P40_3>=1))")))U("(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_2>=1))&&(i5.u3.pl_P40_5>=1))")))
Formula 4 simplified : !(!F"(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_3>=1))&&(i1.u1.pl_P40_3>=1))" U "(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_2>=1))&&(i5.u3.pl_P40_5>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.209763,21532,1,0,7069,449,981,7465,380,748,19201
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Railroad-PT-005-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((((!(X((!(("(((i6.u12.pl_P0_1>=1)&&(i2.u7.pl_P2_1>=1))&&(i6.u4.pl_P6_1>=1))")U("(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_2>=1))&&(i3.u2.pl_P40_4>=1))")))U(G(F(G("(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_3>=1))&&(i3.u2.pl_P40_4>=1))")))))))&&("(i5.u11.pl_P23_1>=1)"))&&("(i5.u11.pl_P34_2>=1)"))&&("(i3.u2.pl_P40_4>=1)"))))
Formula 5 simplified : !F("(i3.u2.pl_P40_4>=1)" & "(i5.u11.pl_P23_1>=1)" & "(i5.u11.pl_P34_2>=1)" & !X(!("(((i6.u12.pl_P0_1>=1)&&(i2.u7.pl_P2_1>=1))&&(i6.u4.pl_P6_1>=1))" U "(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_2>=1))&&(i3.u2.pl_P40_4>=1))") U GFG"(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_3>=1))&&(i3.u2.pl_P40_4>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.232991,22292,1,0,8058,449,1009,8261,381,749,21445
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Railroad-PT-005-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X("(((i5.u11.pl_P23_1>=1)&&(i5.u10.pl_P34_6>=1))&&(i0.u0.pl_P40_2>=1))"))U("(((((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_4>=1))&&(i2.u7.pl_P42_1>=1))&&(i6.u4.pl_P16_1>=1))&&(i6.u4.pl_P4_1>=1))")))
Formula 6 simplified : !(X"(((i5.u11.pl_P23_1>=1)&&(i5.u10.pl_P34_6>=1))&&(i0.u0.pl_P40_2>=1))" U "(((((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_4>=1))&&(i2.u7.pl_P42_1>=1))&&(i6.u4.pl_P16_1>=1))&&(i6.u4.pl_P4_1>=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.236305,22556,1,0,8058,449,1050,8261,385,749,21479
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Railroad-PT-005-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(!(G("(((((((i2.u7.pl_P30_1<1)||(u6.pl_P7_1<1))||((i2.u7.pl_P30_1>=1)&&(u6.pl_P7_1>=1)))&&(i5.u11.pl_P23_1>=1))&&(i5.u10.pl_P34_6>=1))&&(i0.u0.pl_P40_2>=1))||(((i0.u0.pl_P0_2>=1)&&(i2.u7.pl_P2_1>=1))&&(i0.u9.pl_P32_1>=1)))")))))
Formula 7 simplified : !X!G"(((((((i2.u7.pl_P30_1<1)||(u6.pl_P7_1<1))||((i2.u7.pl_P30_1>=1)&&(u6.pl_P7_1>=1)))&&(i5.u11.pl_P23_1>=1))&&(i5.u10.pl_P34_6>=1))&&(i0.u0.pl_P40_2>=1))||(((i0.u0.pl_P0_2>=1)&&(i2.u7.pl_P2_1>=1))&&(i0.u9.pl_P32_1>=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.238257,22556,1,0,8058,449,1094,8261,385,749,21519
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Railroad-PT-005-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G((!((X("(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_3>=1))&&(i5.u3.pl_P40_5>=1))"))U("(((((i3.u2.pl_P0_4>=1)&&(i3.u5.pl_P27_1>=1))&&(i2.u7.pl_P2_1>=1))&&(i6.u4.pl_P16_1>=1))&&(i6.u4.pl_P4_1>=1))")))&&(X("((i6.u4.pl_P16_1>=1)&&(i6.u4.pl_P4_1>=1))")))))
Formula 8 simplified : !G(!(X"(((i5.u11.pl_P23_1>=1)&&(i5.u11.pl_P34_3>=1))&&(i5.u3.pl_P40_5>=1))" U "(((((i3.u2.pl_P0_4>=1)&&(i3.u5.pl_P27_1>=1))&&(i2.u7.pl_P2_1>=1))&&(i6.u4.pl_P16_1>=1))&&(i6.u4.pl_P4_1>=1))") & X"((i6.u4.pl_P16_1>=1)&&(i6.u4.pl_P4_1>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.244021,22556,1,0,8058,449,1130,8261,386,749,21547
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Railroad-PT-005-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-21 14:51:17] [INFO ] Computing symmetric co enabling matrix : 51 transitions.
[2020-05-21 14:51:17] [INFO ] Computation of co-enabling matrix(2/51) took 261 ms. Total solver calls (SAT/UNSAT): 116(69/47)
[2020-05-21 14:51:20] [INFO ] Computation of co-enabling matrix(39/51) took 3288 ms. Total solver calls (SAT/UNSAT): 1038(776/262)
[2020-05-21 14:51:20] [INFO ] Computation of Finished co-enabling matrix. took 3640 ms. Total solver calls (SAT/UNSAT): 1072(801/271)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:460)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:574)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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 14:51:20] [INFO ] Built C files in 6951ms 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 1590072682167

--------------------
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="Railroad-PT-005"
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 Railroad-PT-005, 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-158961510800290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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