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.r036-smll-158901930500050.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 CircularTrains-PT-012, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r036-smll-158901930500050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.9K Mar 30 01:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 30 01:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 08:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 26 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 26 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 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 9.2K 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 CircularTrains-PT-012-00
FORMULA_NAME CircularTrains-PT-012-01
FORMULA_NAME CircularTrains-PT-012-02
FORMULA_NAME CircularTrains-PT-012-03
FORMULA_NAME CircularTrains-PT-012-04
FORMULA_NAME CircularTrains-PT-012-05
FORMULA_NAME CircularTrains-PT-012-06
FORMULA_NAME CircularTrains-PT-012-07
FORMULA_NAME CircularTrains-PT-012-08
FORMULA_NAME CircularTrains-PT-012-09
FORMULA_NAME CircularTrains-PT-012-10
FORMULA_NAME CircularTrains-PT-012-11
FORMULA_NAME CircularTrains-PT-012-12
FORMULA_NAME CircularTrains-PT-012-13
FORMULA_NAME CircularTrains-PT-012-14
FORMULA_NAME CircularTrains-PT-012-15

=== Now, execution of the tool begins

BK_START 1589662906884

[2020-05-16 21:01:49] [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-16 21:01:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 21:01:49] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2020-05-16 21:01:49] [INFO ] Transformed 24 places.
[2020-05-16 21:01:49] [INFO ] Transformed 12 transitions.
[2020-05-16 21:01:49] [INFO ] Parsed PT model containing 24 places and 12 transitions in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 290 ms. (steps per millisecond=344 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 12 rows 24 cols
[2020-05-16 21:01:49] [INFO ] Computed 13 place invariants in 4 ms
[2020-05-16 21:01:49] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2020-05-16 21:01:49] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 4 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-16 21:01:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-16 21:01:49] [INFO ] Flatten gal took : 36 ms
FORMULA CircularTrains-PT-012-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 21:01:49] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
[2020-05-16 21:01:49] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-16 21:01:49] [INFO ] Flatten gal took : 6 ms
[2020-05-16 21:01:49] [INFO ] Input system was already deterministic with 12 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/graph12947422312614154957.txt, -o, /tmp/graph12947422312614154957.bin, -w, /tmp/graph12947422312614154957.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/graph12947422312614154957.bin, -l, -1, -v, -w, /tmp/graph12947422312614154957.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 12 rows 24 cols
[2020-05-16 21:01:50] [INFO ] Computed 13 place invariants in 2 ms
inv : Section_6 + Section_5 + F5 = 2
inv : F3 + Section_3 - Section_5 - F4 = 0
inv : Section_11 + Section_10 + F10 = 1
inv : F1 - Section_3 - Section_10 + F8 + Section_5 - Section_7 + F5 + F11 + F4 = 4
inv : Section_2 + Section_3 + Section_10 - F8 - Section_5 + Section_7 - F5 - F11 - F4 + Section_1 = -3
inv : F6 - Section_5 + Section_7 - F5 = -1
inv : F7 + Section_8 + Section_7 = 1
inv : F12 + Section_10 + F10 - F11 + Section_1 = 0
inv : Section_4 + Section_5 + F4 = 1
inv : F9 + Section_10 - F8 - Section_8 = -1
inv : F2 - Section_10 + F8 + Section_5 - Section_7 + F5 + F11 + F4 - Section_1 = 5
inv : Section_12 - Section_10 - F10 + F11 = 1
inv : Section_9 + F8 + Section_8 = 2
Total of 13 invariants.
[2020-05-16 21:01:50] [INFO ] Computed 13 place invariants in 6 ms
[2020-05-16 21:01:50] [INFO ] Decomposing Gal with order
[2020-05-16 21:01:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 21:01:50] [INFO ] Flatten gal took : 34 ms
[2020-05-16 21:01:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-16 21:01:50] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-16 21:01:50] [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 15 LTL properties
Checking formula 0 : !((G(X("((i1.u5.F9>=1)&&(i1.u1.Section_8>=1))"))))
Formula 0 simplified : !GX"((i1.u5.F9>=1)&&(i1.u1.Section_8>=1))"
[2020-05-16 21:01:50] [INFO ] Proved 24 variables to be positive in 155 ms
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
[2020-05-16 21:01:50] [INFO ] Computing symmetric may disable matrix : 12 transitions.
built 7 ordering constraints for composite.
[2020-05-16 21:01:50] [INFO ] Computation of disable matrix completed :0/12 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 21:01:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 21:01:50] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2020-05-16 21:01:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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.039999,16744,1,0,1088,150,218,1394,111,359,2390
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F(X((X(G(X((F("((i1.u5.Section_9>=1)&&(i1.u6.F10>=1))"))||("((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))")))))&&("((((i0.u2.Section_2<1)||(i2.u0.F3<1))||(i1.u5.Section_9<1))||(i1.u6.F10<1))"))))))
Formula 1 simplified : !XFX("((((i0.u2.Section_2<1)||(i2.u0.F3<1))||(i1.u5.Section_9<1))||(i1.u6.F10<1))" & XGX("((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))" | F"((i1.u5.Section_9>=1)&&(i1.u6.F10>=1))"))
447 unique states visited
0 strongly connected components in search stack
883 transitions explored
23 items max in DFS search stack
19 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.220733,22268,1,0,7920,151,299,8459,118,373,21087
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F("(((i1.u1.F7>=1)&&(i2.u4.Section_6>=1))||((i0.u3.Section_11>=1)&&(i0.u2.F12>=1)))"))&&(!(F(((!(X(F("((i1.u1.F7>=1)&&(i2.u4.Section_6>=1))"))))&&("(i0.u3.Section_11>=1)"))&&("(i0.u2.F12>=1)"))))))
Formula 2 simplified : !(F"(((i1.u1.F7>=1)&&(i2.u4.Section_6>=1))||((i0.u3.Section_11>=1)&&(i0.u2.F12>=1)))" & !F("(i0.u2.F12>=1)" & "(i0.u3.Section_11>=1)" & !XF"((i1.u1.F7>=1)&&(i2.u4.Section_6>=1))"))
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.23332,23008,1,0,8794,151,341,9110,119,373,22779
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X("((((i2.u0.Section_4>=1)&&(i2.u4.F5>=1))||(i0.u2.Section_2<1))||(i2.u0.F3<1))"))||(!(X(!(G(((G("((i0.u2.Section_2>=1)&&(i2.u0.F3>=1))"))&&("(i2.u7.F6>=1)"))&&("(i2.u4.Section_5>=1)"))))))))
Formula 3 simplified : !(X"((((i2.u0.Section_4>=1)&&(i2.u4.F5>=1))||(i0.u2.Section_2<1))||(i2.u0.F3<1))" | !X!G("(i2.u4.Section_5>=1)" & "(i2.u7.F6>=1)" & G"((i0.u2.Section_2>=1)&&(i2.u0.F3>=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.23609,23420,1,0,8794,151,395,9110,119,373,22842
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(F(X(F("((i0.u3.Section_12>=1)&&(i0.u2.F1>=1))"))))))
Formula 4 simplified : FXF"((i0.u3.Section_12>=1)&&(i0.u2.F1>=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.24262,23684,1,0,9233,151,418,9503,119,373,23863
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X(F(("((i1.u5.Section_9>=1)&&(i1.u6.F10>=1))")U("((i1.u5.F9>=1)&&(i1.u1.Section_8>=1))"))))))
Formula 5 simplified : !XXF("((i1.u5.Section_9>=1)&&(i1.u6.F10>=1))" U "((i1.u5.F9>=1)&&(i1.u1.Section_8>=1))")
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.247909,23684,1,0,9666,151,429,9841,119,373,24757
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("((i0.u3.Section_11>=1)&&(i0.u2.F12>=1))")U((G(X(X(!(G(F("((i1.u1.F7<1)||(i2.u4.Section_6<1))")))))))||(("((i1.u1.F7>=1)&&(i2.u4.Section_6>=1))")U(F("((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))"))))))
Formula 6 simplified : !("((i0.u3.Section_11>=1)&&(i0.u2.F12>=1))" U (GXX!GF"((i1.u1.F7<1)||(i2.u4.Section_6<1))" | ("((i1.u1.F7>=1)&&(i2.u4.Section_6>=1))" U F"((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))")))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.255774,23996,1,0,10102,151,450,10135,119,373,25694
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F((!(X(F(G(!(X(X("((i1.u5.Section_10>=1)&&(i0.u3.F11>=1))"))))))))U("((i1.u5.F9>=1)&&(i1.u1.Section_8>=1))")))))
Formula 7 simplified : !XF(!XFG!XX"((i1.u5.Section_10>=1)&&(i0.u3.F11>=1))" U "((i1.u5.F9>=1)&&(i1.u1.Section_8>=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.25844,24248,1,0,10226,151,450,10268,119,373,25951
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("((i1.u5.F9>=1)&&(i1.u1.Section_8>=1))")))
Formula 8 simplified : !F"((i1.u5.F9>=1)&&(i1.u1.Section_8>=1))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.260306,24248,1,0,10298,151,450,10351,119,373,26134
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(X(G(X(F(((X(!(F(!(X("((i1.u5.Section_9>=1)&&(i1.u6.F10>=1))"))))))&&("(i2.u7.F6>=1)"))&&("(i2.u4.Section_5>=1)"))))))))
Formula 9 simplified : !FXGXF("(i2.u4.Section_5>=1)" & "(i2.u7.F6>=1)" & X!F!X"((i1.u5.Section_9>=1)&&(i1.u6.F10>=1))")
28 unique states visited
9 strongly connected components in search stack
30 transitions explored
28 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.282338,25208,1,0,11239,151,475,11220,119,373,28414
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F((G("((i2.u7.F6>=1)&&(i2.u4.Section_5>=1))"))U(F("((i0.u2.Section_2>=1)&&(i2.u0.F3>=1))"))))||((F("((i1.u5.F9>=1)&&(i1.u1.Section_8>=1))"))&&(G(X("((i1.u1.F7>=1)&&(i2.u4.Section_6>=1))"))))))
Formula 10 simplified : !(F(G"((i2.u7.F6>=1)&&(i2.u4.Section_5>=1))" U F"((i0.u2.Section_2>=1)&&(i2.u0.F3>=1))") | (F"((i1.u5.F9>=1)&&(i1.u1.Section_8>=1))" & GX"((i1.u1.F7>=1)&&(i2.u4.Section_6>=1))"))
15 unique states visited
0 strongly connected components in search stack
14 transitions explored
9 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.298953,25208,1,0,12184,151,526,12121,121,373,31014
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(G(F((X(F(G("((((i1.u1.F7<1)||(i2.u4.Section_6<1))&&(i2.u0.Section_4>=1))&&(i2.u4.F5>=1))"))))||(F("((i2.u0.Section_4>=1)&&(i2.u4.F5>=1))")))))))
Formula 11 simplified : GF(XFG"((((i1.u1.F7<1)||(i2.u4.Section_6<1))&&(i2.u0.Section_4>=1))&&(i2.u4.F5>=1))" | F"((i2.u0.Section_4>=1)&&(i2.u4.F5>=1))")
31 unique states visited
6 strongly connected components in search stack
31 transitions explored
31 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.315509,25696,1,0,12884,151,537,12783,121,373,32816
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F((((G("((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))"))&&("(i1.u6.F8>=1)"))&&("(i1.u1.Section_7>=1)"))&&((X(X("((i1.u6.F8>=1)&&(i1.u1.Section_7>=1))")))||(X("((i1.u5.Section_9<1)||(i1.u6.F10<1))"))))))
Formula 12 simplified : !F("(i1.u1.Section_7>=1)" & "(i1.u6.F8>=1)" & G"((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))" & (XX"((i1.u6.F8>=1)&&(i1.u1.Section_7>=1))" | X"((i1.u5.Section_9<1)||(i1.u6.F10<1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.336603,26136,1,0,13366,151,582,13258,121,373,34320
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((!(G("((i2.u0.Section_4>=1)&&(i2.u4.F5>=1))")))&&((G((X("((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))"))||("((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))")))U(("((i0.u3.Section_12>=1)&&(i0.u2.F1>=1))")U("((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))")))))
Formula 13 simplified : !(!G"((i2.u0.Section_4>=1)&&(i2.u4.F5>=1))" & (G("((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))" | X"((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))") U ("((i0.u3.Section_12>=1)&&(i0.u2.F1>=1))" U "((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))")))
12 unique states visited
0 strongly connected components in search stack
11 transitions explored
12 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.342211,26392,1,0,13517,151,602,13461,123,373,34928
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X((G("((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))"))U("((i0.u3.Section_12>=1)&&(i0.u2.F1>=1))"))))
Formula 14 simplified : !X(G"((i0.u2.F2>=1)&&(i0.u2.Section_1>=1))" U "((i0.u3.Section_12>=1)&&(i0.u2.F1>=1))")
15 unique states visited
15 strongly connected components in search stack
15 transitions explored
15 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.353667,26392,1,0,14160,151,614,14086,123,373,36675
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-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-16 21:01:50] [INFO ] Built C files in 606ms 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 1589662911577

--------------------
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="CircularTrains-PT-012"
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 CircularTrains-PT-012, 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 r036-smll-158901930500050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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