About the Execution of ITS-Tools for Railroad-PT-005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15741.890 | 7714.00 | 17759.00 | 235.10 | FTFTTFTTTTTFFTTF | 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.r141-smll-158961510800289.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510800289
=====================================================================
--------------------
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 1590072642898
[2020-05-21 14:50:45] [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-21 14:50:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 14:50:45] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2020-05-21 14:50:45] [INFO ] Transformed 68 places.
[2020-05-21 14:50:45] [INFO ] Transformed 56 transitions.
[2020-05-21 14:50:45] [INFO ] Parsed PT model containing 68 places and 56 transitions in 132 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/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 477 ms. (steps per millisecond=209 ) properties seen :[0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 51 rows 52 cols
[2020-05-21 14:50:46] [INFO ] Computed 26 place invariants in 7 ms
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned unsat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive and 14 generalized place invariants in 16 ms returned unsat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive and 14 generalized place invariants in 3 ms returned unsat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned unsat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned unsat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive and 14 generalized place invariants in 7 ms returned unsat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-21 14:50:46] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-21 14:50:47] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
Successfully simplified 14 atomic propositions for a total of 18 simplifications.
[2020-05-21 14:50:47] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-05-21 14:50:47] [INFO ] Flatten gal took : 70 ms
FORMULA Railroad-PT-005-13 TRUE 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-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 14:50:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-21 14:50:47] [INFO ] Flatten gal took : 24 ms
[2020-05-21 14:50:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Railroad-PT-005-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 14:50:47] [INFO ] Applying decomposition
[2020-05-21 14:50:47] [INFO ] Flatten gal took : 23 ms
[2020-05-21 14:50:47] [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/graph5629323612763089997.txt, -o, /tmp/graph5629323612763089997.bin, -w, /tmp/graph5629323612763089997.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/graph5629323612763089997.bin, -l, -1, -v, -w, /tmp/graph5629323612763089997.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 51 rows 52 cols
[2020-05-21 14:50:47] [INFO ] Computed 26 place invariants in 5 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:50:47] [INFO ] Computed 26 place invariants in 7 ms
[2020-05-21 14:50:47] [INFO ] Decomposing Gal with order
[2020-05-21 14:50:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 14:50:47] [INFO ] Removed a total of 84 redundant transitions.
[2020-05-21 14:50:47] [INFO ] Proved 52 variables to be positive in 181 ms
[2020-05-21 14:50:47] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2020-05-21 14:50:47] [INFO ] Computation of disable matrix completed :0/51 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 14:50:47] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 14:50:47] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2020-05-21 14:50:47] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 14:50:47] [INFO ] Flatten gal took : 127 ms
[2020-05-21 14:50:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 20 ms.
[2020-05-21 14:50:47] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-21 14:50:47] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 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 5 LTL properties
Checking formula 0 : !((G(F(!(G(F(F("(gu5.pl_P18_1<=0)"))))))))
Formula 0 simplified : !GF!GF"(gu5.pl_P18_1<=0)"
Reverse transition relation is NOT exact ! Due to transitions tr_T18_1, tr_T24_2, tr_T24_3, tr_T24_4, tr_T24_5, tr_T3_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/35/6/41
[2020-05-21 14:50:48] [INFO ] Computing symmetric co enabling matrix : 51 transitions.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
65 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.690006,33476,1,0,224,67649,112,95,1675,77195,340
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Railroad-PT-005-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((X(G("(gu12.pl_P34_4<=gu12.pl_P40_5)")))||(F("(gu12.pl_P34_4>gu12.pl_P40_5)")))))
Formula 1 simplified : !G(XG"(gu12.pl_P34_4<=gu12.pl_P40_5)" | F"(gu12.pl_P34_4>gu12.pl_P40_5)")
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 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.736203,35588,1,0,225,69540,124,95,1724,83410,355
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Railroad-PT-005-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G(F(X(G("(gu3.pl_P15_1<=gu3.pl_P8_1)")))))))
Formula 2 simplified : !XGFXG"(gu3.pl_P15_1<=gu3.pl_P8_1)"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
22 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.957715,39780,1,0,256,86566,137,116,1729,115506,438
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Railroad-PT-005-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X(("(gu5.pl_P18_1<=gu5.pl_P5_1)")U(G("(gu5.pl_P18_1<=gu5.pl_P5_1)"))))||(("(gu6.pl_P23_1<=gu6.pl_P2_1)")U(X("(gu5.pl_P5_1<=gu5.pl_P26_1)")))))
Formula 3 simplified : !(X("(gu5.pl_P18_1<=gu5.pl_P5_1)" U G"(gu5.pl_P18_1<=gu5.pl_P5_1)") | ("(gu6.pl_P23_1<=gu6.pl_P2_1)" U X"(gu5.pl_P5_1<=gu5.pl_P26_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.962023,40840,1,0,256,86566,163,116,1752,115506,451
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Railroad-PT-005-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(X(F("(gi3.gi1.gu4.pl_P17_1<=0)"))))U(!(G(((!(X("(gu6.pl_P19_1<=0)")))||("(gu6.pl_P19_1<=gu6.pl_P2_1)"))&&("(gu6.pl_P19_1<=gu6.pl_P2_1)"))))))
Formula 4 simplified : !(GXF"(gi3.gi1.gu4.pl_P17_1<=0)" U !G("(gu6.pl_P19_1<=gu6.pl_P2_1)" & ("(gu6.pl_P19_1<=gu6.pl_P2_1)" | !X"(gu6.pl_P19_1<=0)")))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.03939,42892,1,0,296,95124,172,138,1757,131118,573
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Railroad-PT-005-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-21 14:50:49] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-21 14:50:49] [WARNING] Script execution failed on command (assert (= 1 (+ (select s0 8) (select s0 13) (select s0 28)))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (= 1 (+ (select s0 8) (select s0 13) (select s0 28)))")
[(declare-fun s0 () (Array Int Int)), (assert (= 1 (+ (select s0 8) (select s0 13) (select s0 28)))), (assert (= (+ (select s0 17) (select s0 37) 0) (+ (select s0 25) (select s0 45)))), (assert (= 1 (+ (select s0 8) (select s0 16) (select s0 28)))), (assert (and (>= (select s0 8) 1) (>= (select s0 25) 1))), (assert (>= (select s0 8) 0)), (assert (>= (select s0 13) 0)), (assert (>= (select s0 16) 0)), (assert (>= (select s0 17) 0)), (assert (>= (select s0 25) 0)), (assert (>= (select s0 28) 0)), (assert (>= (select s0 37) 0)), (assert (>= (select s0 45) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@48026e22
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@48026e22
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:450)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 14:50:49] [INFO ] Built C files in 1788ms 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 1590072650612
--------------------
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="Railroad-PT-005"
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 Railroad-PT-005, 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 r141-smll-158961510800289"
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 [ "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 ;