About the Execution of ITS-Tools for GPPP-PT-C0001N0000000100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.410 | 507620.00 | 525108.00 | 1299.10 | TTTFFFFFTFTTFFTT | 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.r081-smll-158922977900433.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 GPPP-PT-C0001N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922977900433
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 4 09:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 09:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 3 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 3 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 3 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000100-00
FORMULA_NAME GPPP-PT-C0001N0000000100-01
FORMULA_NAME GPPP-PT-C0001N0000000100-02
FORMULA_NAME GPPP-PT-C0001N0000000100-03
FORMULA_NAME GPPP-PT-C0001N0000000100-04
FORMULA_NAME GPPP-PT-C0001N0000000100-05
FORMULA_NAME GPPP-PT-C0001N0000000100-06
FORMULA_NAME GPPP-PT-C0001N0000000100-07
FORMULA_NAME GPPP-PT-C0001N0000000100-08
FORMULA_NAME GPPP-PT-C0001N0000000100-09
FORMULA_NAME GPPP-PT-C0001N0000000100-10
FORMULA_NAME GPPP-PT-C0001N0000000100-11
FORMULA_NAME GPPP-PT-C0001N0000000100-12
FORMULA_NAME GPPP-PT-C0001N0000000100-13
FORMULA_NAME GPPP-PT-C0001N0000000100-14
FORMULA_NAME GPPP-PT-C0001N0000000100-15
=== Now, execution of the tool begins
BK_START 1589745112607
[2020-05-17 19:51:55] [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-17 19:51:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-17 19:51:55] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2020-05-17 19:51:55] [INFO ] Transformed 33 places.
[2020-05-17 19:51:55] [INFO ] Transformed 22 transitions.
[2020-05-17 19:51:55] [INFO ] Parsed PT model containing 33 places and 22 transitions in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 404 ms. (steps per millisecond=247 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1]
// Phase 1: matrix 22 rows 33 cols
[2020-05-17 19:51:56] [INFO ] Computed 13 place invariants in 9 ms
[2020-05-17 19:51:56] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned unsat
[2020-05-17 19:51:56] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2020-05-17 19:51:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned unsat
[2020-05-17 19:51:56] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2020-05-17 19:51:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2020-05-17 19:51:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 19:51:56] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-17 19:51:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 19:51:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 416 ms returned unsat
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-05-17 19:51:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 19:51:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 19:51:57] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2020-05-17 19:51:57] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 8 ms.
[2020-05-17 19:51:57] [INFO ] Added : 20 causal constraints over 4 iterations in 64 ms. Result :sat
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 10 ms returned unsat
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-05-17 19:51:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 19:51:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 19:51:57] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2020-05-17 19:51:57] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 6 ms.
[2020-05-17 19:51:57] [INFO ] Added : 20 causal constraints over 4 iterations in 47 ms. Result :sat
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 19:51:57] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-05-17 19:51:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 19:51:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 15 ms returned sat
[2020-05-17 19:51:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 19:51:58] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-05-17 19:51:58] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 6 ms.
[2020-05-17 19:51:58] [INFO ] Added : 21 causal constraints over 5 iterations in 52 ms. Result :sat
[2020-05-17 19:51:58] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-17 19:51:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
[2020-05-17 19:51:58] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-17 19:51:58] [INFO ] Flatten gal took : 54 ms
FORMULA GPPP-PT-C0001N0000000100-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-17 19:51:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-17 19:51:58] [INFO ] Flatten gal took : 14 ms
[2020-05-17 19:51:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA GPPP-PT-C0001N0000000100-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-17 19:51:58] [INFO ] Applying decomposition
[2020-05-17 19:51:58] [INFO ] Flatten gal took : 31 ms
[2020-05-17 19:51:58] [INFO ] Input system was already deterministic with 22 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/graph16540662701200863310.txt, -o, /tmp/graph16540662701200863310.bin, -w, /tmp/graph16540662701200863310.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 22 rows 33 cols
[2020-05-17 19:51:58] [INFO ] Computed 13 place invariants in 4 ms
inv : 2*GSSG + GSH = 200
inv : 24*S7P - 24*GAP - 68*E4P - 44*F6P - 11*G6P - 48*FBP - 24*DHAP - 8*_1_3_BPG + 4*ADP - 4*_3PG - 4*_2PG - 4*PEP - 7*Gluc + 11*b2 + 16*c2 = 0
inv : b1 + b2 = 3
inv : Xu5P - 2*R5P - S7P - E4P + a2 = 0
inv : NADH - _1_3_BPG - _3PG - _2PG - PEP - Pyr = 0
inv : -14*S7P + 14*GAP + 42*E4P + 28*F6P + 7*G6P + 28*FBP + 14*DHAP + 4*_1_3_BPG + 4*_3PG + 4*_2PG + 4*PEP + 4*Pyr + 28*start + 4*Lac + 7*Gluc - 7*b2 - 10*c2 = 28
inv : NADplus + _1_3_BPG + _3PG + _2PG + PEP + Pyr = 200
inv : 2*Ru5P + 6*R5P + 9*S7P - 3*GAP - 9*E4P - 6*F6P - 6*FBP - 3*DHAP + 2*b2 - 2*a2 + 3*c2 = 0
inv : NADPplus + NADPH = 200
inv : 4*ATP - 24*S7P + 24*GAP + 68*E4P + 44*F6P + 11*G6P + 48*FBP + 24*DHAP + 8*_1_3_BPG + 4*_3PG + 4*_2PG + 4*PEP + 28*start + 7*Gluc - 11*b2 - 16*c2 = 1628
inv : a1 + a2 = 2
inv : 4*Pi + 14*S7P - 14*GAP - 42*E4P - 28*F6P - 7*G6P - 28*FBP - 14*DHAP - 7*Gluc + 7*b2 + 10*c2 = 0
inv : c1 + c2 = 7
Total of 13 invariants.
[2020-05-17 19:51:58] [INFO ] Computed 13 place invariants in 5 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph16540662701200863310.bin, -l, -1, -v, -w, /tmp/graph16540662701200863310.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-17 19:51:58] [INFO ] Decomposing Gal with order
[2020-05-17 19:51:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-17 19:51:58] [INFO ] Proved 33 variables to be positive in 99 ms
[2020-05-17 19:51:58] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2020-05-17 19:51:58] [INFO ] Computation of disable matrix completed :0/22 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 19:51:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 19:51:58] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2020-05-17 19:51:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 19:51:58] [INFO ] Removed a total of 4 redundant transitions.
[2020-05-17 19:51:58] [INFO ] Flatten gal took : 87 ms
[2020-05-17 19:51:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-17 19:51:58] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-17 19:51:58] [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 8 LTL properties
Checking formula 0 : !((!(X(F(G((("(gi5.gi1.gu9.b1>=3)")U("(gu8.Xu5P>gu8.start)"))&&(G(!(F(("(gu10.a2<=gu10.c1)")U("(gi5.gi1.gu9.b1>=3)")))))))))))
Formula 0 simplified : XFG(("(gi5.gi1.gu9.b1>=3)" U "(gu8.Xu5P>gu8.start)") & G!F("(gu10.a2<=gu10.c1)" U "(gi5.gi1.gu9.b1>=3)"))
[2020-05-17 19:51:59] [INFO ] Computing symmetric co enabling matrix : 22 transitions.
[2020-05-17 19:52:01] [INFO ] Computation of Finished co-enabling matrix. took 1448 ms. Total solver calls (SAT/UNSAT): 165(150/15)
[2020-05-17 19:52:01] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2020-05-17 19:52:02] [INFO ] Computation of Completed DNA matrix. took 1439 ms. Total solver calls (SAT/UNSAT): 49(0/49)
[2020-05-17 19:52:02] [INFO ] Built C files in 4063ms 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]
Compilation finished in 718 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 64 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X(<>([](( ((LTLAP0==true))U((LTLAP1==true)) ) && ( [](!( <>(((LTLAP2==true))U((LTLAP0==true)))) ) ))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X(<>([](( ((LTLAP0==true))U((LTLAP1==true)) ) && ( [](!( <>(((LTLAP2==true))U((LTLAP0==true)))) ) ))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X(<>([](( ((LTLAP0==true))U((LTLAP1==true)) ) && ( [](!( <>(((LTLAP2==true))U((LTLAP0==true)))) ) ))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions Transketolase2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1637 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,16.4087,255664,1,0,1051,1.21425e+06,76,26,1709,1.15658e+06,2585
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!((G("(gu6.FBP>=1)"))U("(gu0.Pi>=1)")))&&(!(X("(gu6.DHAP<=gu6.Gluc)")))))
Formula 1 simplified : !(!(G"(gu6.FBP>=1)" U "(gu0.Pi>=1)") & !X"(gu6.DHAP<=gu6.Gluc)")
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,16.4201,256772,1,0,1053,1.21435e+06,90,26,1717,1.1567e+06,2603
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G("(gi1.gu3.S7P<=gi1.gu3.GSSG)")))
Formula 2 simplified : !G"(gi1.gu3.S7P<=gi1.gu3.GSSG)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
46609 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,482.514,2955452,1,0,1946,1.62961e+07,22,842,1245,1.97352e+07,2552
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F((!(G("(gu8.Xu5P<=gu8._2PG)")))&&((!(X(F("(gu8.Xu5P<=gu8._2PG)"))))||("(gu4.R5P<1)"))))))
Formula 3 simplified : !GF(!G"(gu8.Xu5P<=gu8._2PG)" & ("(gu4.R5P<1)" | !XF"(gu8.Xu5P<=gu8._2PG)"))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
506 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,487.575,2955808,1,0,1946,1.62961e+07,43,842,1381,1.97352e+07,2586
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X((G("(gu6.DHAP<=gu6.c2)"))U(F(F("(gu6.DHAP<=gu6.c2)")))))))
Formula 4 simplified : !FX(G"(gu6.DHAP<=gu6.c2)" U F"(gu6.DHAP<=gu6.c2)")
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,487.576,2955808,1,0,1946,1.62961e+07,52,842,1384,1.97352e+07,2593
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000100-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(((F(!(F(G("(gi5.gu1.NADH>=1)")))))||(G("(gu4.Lac>gu4.R5P)")))&&((F("(gi5.gu1.NADH>=1)"))||("(gu6.DHAP>=2)")))))
Formula 5 simplified : !F((F!FG"(gi5.gu1.NADH>=1)" | G"(gu4.Lac>gu4.R5P)") & ("(gu6.DHAP>=2)" | F"(gi5.gu1.NADH>=1)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
18 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,487.752,2956204,1,0,1946,1.62961e+07,70,842,1393,1.97352e+07,2912
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F((!(G(F("(gi1.gu3.GSSG>=3)"))))U(!(F(X("(gi1.gu3.GSSG>=3)"))))))))
Formula 6 simplified : !GF(!GF"(gi1.gu3.GSSG>=3)" U !FX"(gi1.gu3.GSSG>=3)")
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
30 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,488.065,2956204,1,0,1946,1.62961e+07,75,842,1395,1.97352e+07,2923
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(X("(gu0._1_3_BPG<=gu0.Pi)")))))
Formula 7 simplified : !XXX"(gu0._1_3_BPG<=gu0.Pi)"
4 unique states visited
0 strongly connected components in search stack
3 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,488.067,2956204,1,0,1946,1.62961e+07,78,842,1398,1.97352e+07,2928
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000100-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1589745620227
--------------------
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="GPPP-PT-C0001N0000000100"
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 GPPP-PT-C0001N0000000100, 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 r081-smll-158922977900433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000100.tgz
mv GPPP-PT-C0001N0000000100 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 ;