About the Execution of ITS-Tools for CircularTrains-PT-012
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.410 | 4973.00 | 10648.00 | 315.30 | TFTFTFTFFFFTFTFF | normal |
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-158901930500049.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r036-smll-158901930500049
=====================================================================
--------------------
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 1589662888836
[2020-05-16 21:01:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-16 21:01:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 21:01:31] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2020-05-16 21:01:31] [INFO ] Transformed 24 places.
[2020-05-16 21:01:31] [INFO ] Transformed 12 transitions.
[2020-05-16 21:01:31] [INFO ] Parsed PT model containing 24 places and 12 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 353 ms. (steps per millisecond=283 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 12 rows 24 cols
[2020-05-16 21:01:31] [INFO ] Computed 13 place invariants in 7 ms
[2020-05-16 21:01:31] [INFO ] [Real]Absence check using 5 positive place invariants in 19 ms returned sat
[2020-05-16 21:01:31] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 12 ms returned unsat
[2020-05-16 21:01:31] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2020-05-16 21:01:31] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2020-05-16 21:01:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2020-05-16 21:01:31] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-16 21:01:31] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 3 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 7 simplifications.
[2020-05-16 21:01:32] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-16 21:01:32] [INFO ] Flatten gal took : 35 ms
FORMULA CircularTrains-PT-012-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 21:01:32] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-16 21:01:32] [INFO ] Applying decomposition
[2020-05-16 21:01:32] [INFO ] Flatten gal took : 5 ms
[2020-05-16 21:01:32] [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/graph2989817965580855960.txt, -o, /tmp/graph2989817965580855960.bin, -w, /tmp/graph2989817965580855960.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/graph2989817965580855960.bin, -l, -1, -v, -w, /tmp/graph2989817965580855960.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 21:01:32] [INFO ] Decomposing Gal with order
[2020-05-16 21:01:32] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 12 rows 24 cols
[2020-05-16 21:01:32] [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:32] [INFO ] Computed 13 place invariants in 3 ms
[2020-05-16 21:01:32] [INFO ] Proved 24 variables to be positive in 66 ms
[2020-05-16 21:01:32] [INFO ] Flatten gal took : 70 ms
[2020-05-16 21:01:32] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2020-05-16 21:01:32] [INFO ] Computation of disable matrix completed :0/12 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 21:01:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 21:01:32] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2020-05-16 21:01:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 21:01:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-16 21:01:32] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-16 21:01:32] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 11 LTL properties
Checking formula 0 : !((G(F("(gi2.gu3.Section_11<=gi2.gu4.F12)"))))
Formula 0 simplified : !GF"(gi2.gu3.Section_11<=gi2.gu4.F12)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.040928,16868,1,0,33,3166,24,1,552,1721,84
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(F(X(F(G(F(!((G("(gi0.gu0.F1<=gi0.gu0.Section_8)"))U("(gi3.gu6.Section_5<=gi3.gu6.F9)"))))))))))
Formula 1 simplified : FXFGF!(G"(gi0.gu0.F1<=gi0.gu0.Section_8)" U "(gi3.gu6.Section_5<=gi3.gu6.F9)")
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.066736,18628,1,0,76,7190,40,16,569,8055,182
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((!(F(G("(gi2.gu4.F10>=1)"))))||(!(F(!((G("(gi4.gu8.F7>gi4.gu8.Section_12)"))U(F("(gi4.gu8.F5<=gi4.gu5.Section_3)"))))))))
Formula 2 simplified : !(!FG"(gi2.gu4.F10>=1)" | !F!(G"(gi4.gu8.F7>gi4.gu8.Section_12)" U F"(gi4.gu8.F5<=gi4.gu5.Section_3)"))
2 unique states visited
0 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.073938,19464,1,0,104,8122,53,17,578,8858,256
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(!(("(gu1.Section_2<=gi2.gu3.Section_11)")U("(gi4.gu5.F6<=gi4.gu5.Section_3)")))))
Formula 3 simplified : !F!("(gu1.Section_2<=gi2.gu3.Section_11)" U "(gi4.gu5.F6<=gi4.gu5.Section_3)")
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.099467,20248,1,0,186,11761,70,51,589,15543,425
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(G(!(("(gi3.gu7.Section_7<=gi3.gu7.Section_1)")U("(gi4.gu8.F5>=1)"))))))
Formula 4 simplified : !XG!("(gi3.gu7.Section_7<=gi3.gu7.Section_1)" U "(gi4.gu8.F5>=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.101456,20504,1,0,186,11820,78,51,590,15672,434
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 : !(((!(G("(gi2.gu4.F10<=gi2.gu4.F12)")))U(X((!(F(((F("(gi0.gu2.F8>=2)"))&&("(gu1.F2<=gu1.Section_2)"))U("(gi0.gu2.F8>=2)"))))&&("(gi4.gu8.Section_12<=gi4.gu8.F11)")))))
Formula 5 simplified : !(!G"(gi2.gu4.F10<=gi2.gu4.F12)" U X("(gi4.gu8.Section_12<=gi4.gu8.F11)" & !F(("(gu1.F2<=gu1.Section_2)" & F"(gi0.gu2.F8>=2)") U "(gi0.gu2.F8>=2)")))
56 unique states visited
6 strongly connected components in search stack
58 transitions explored
21 items max in DFS search stack
12 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.227,24024,1,0,1137,24542,116,315,614,42222,2519
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(X(G(!(X("(gi2.gu3.Section_11<=gi2.gu3.Section_6)")))))))
Formula 6 simplified : !XXG!X"(gi2.gu3.Section_11<=gi2.gu3.Section_6)"
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.235645,24288,1,0,1166,25480,122,325,618,43920,2578
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F((!(X(G("(gi2.gu3.Section_6>=1)"))))&&("(gi4.gu8.Section_12>gi3.gu7.Section_7)")))))
Formula 7 simplified : !XF("(gi4.gu8.Section_12>gi3.gu7.Section_7)" & !XG"(gi2.gu3.Section_6>=1)")
5 unique states visited
3 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.266628,24816,1,0,1297,28882,137,358,625,49539,2859
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(((X("(gi4.gu8.Section_12>gi4.gu8.F5)"))&&(F(("((gi3.gu6.Section_5>=2)||(gi4.gu8.Section_12<=gi4.gu8.F5))")U("(gi0.gu0.F1>gi0.gu0.Section_4)"))))&&("(gi0.gu0.F1>gi0.gu0.Section_4)"))))
Formula 8 simplified : !G("(gi0.gu0.F1>gi0.gu0.Section_4)" & X"(gi4.gu8.Section_12>gi4.gu8.F5)" & F("((gi3.gu6.Section_5>=2)||(gi4.gu8.Section_12<=gi4.gu8.F5))" U "(gi0.gu0.F1>gi0.gu0.Section_4)"))
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.268225,25080,1,0,1297,28892,152,358,641,49539,2868
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(F(G(X(("(gi3.gu7.Section_7>gi3.gu6.F9)")U("(gi0.gu0.Section_8>=1)")))))))
Formula 9 simplified : FGX("(gi3.gu7.Section_7>gi3.gu6.F9)" U "(gi0.gu0.Section_8>=1)")
2 unique states visited
0 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.282756,25344,1,0,1368,30858,169,371,650,52259,3066
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("(gu1.Section_10<=gu1.Section_2)")U((X(X(G("(gu1.Section_10<=gu1.Section_2)"))))&&((G("(gu1.Section_10<=gu1.Section_2)"))U("(gi2.gu4.F12<=gi4.gu8.F5)")))))
Formula 10 simplified : !("(gu1.Section_10<=gu1.Section_2)" U (XXG"(gu1.Section_10<=gu1.Section_2)" & (G"(gu1.Section_10<=gu1.Section_2)" U "(gi2.gu4.F12<=gi4.gu8.F5)")))
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.319677,26396,1,0,1456,33526,191,403,666,56426,3260
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-16 21:01:32] [WARNING] Script execution failed on command (assert (not (<= (select s0 9) (select s0 21)))) with error
[2020-05-16 21:01:32] [WARNING] Script execution failed on command (assert (<= (select s1 9) (select s1 21))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (<= (select s1 9) (select s1 21))")
[2020-05-16 21:01:32] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 14) 1) (>= (select s0 21) 1)) (= (store (store (store (store s0 21 (- (select s0 21) 1)) 7 (+ (select s0 7) 1)) 4 (+ (select s0 4) 1)) 14 (- (select s0 14) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 14) 1) (>= (select s0 21) 1)) (= (store (store (store (store s0 21 (- (select s0 21) 1)) 7 (+ (select s0 7) 1)) 4 (+ (select s0 4) 1)) 14 (- (select s0 14) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
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:32] [INFO ] Built C files in 585ms 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 1589662893809
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-012"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CircularTrains-PT-012, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r036-smll-158901930500049"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;