About the Execution of ITS-Tools for Eratosthenes-PT-200
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1677.160 | 63951.00 | 184474.00 | 512.70 | FFFTFTFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r074-smll-155234739300295.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3957
Executing tool itstools
Input is Eratosthenes-PT-200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-155234739300295
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 3.0K Feb 10 23:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 10 23:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 6 20:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 6 20:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 106 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 344 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 23:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 3 08:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 3 08:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Jan 31 01:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Jan 31 01:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 311K Mar 10 17:31 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 Eratosthenes-PT-200-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1552817526424
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/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.201903111103/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 16 LTL properties
Checking formula 0 : !((F(X(X(("((p25>=1)&&(p75>=1))")U("(p143>=1)"))))))
Formula 0 simplified : !FXX("((p25>=1)&&(p75>=1))" U "(p143>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 153
// Phase 1: matrix 153 rows 153 cols
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
593 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,5.99256,161756,1,0,612,1.1088e+06,20,608,3425,863364,1529
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G((X("((p56>=1)&&(p112>=1))"))U(G("((p16>=1)&&(p176>=1))")))))
Formula 1 simplified : !G(X"((p56>=1)&&(p112>=1))" U G"((p16>=1)&&(p176>=1))")
Computing Next relation with stutter on 1 deadlock states
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]
153 unique states visited
153 strongly connected components in search stack
153 transitions explored
153 items max in DFS search stack
636 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,12.3522,285392,1,0,1220,1.84995e+06,30,1217,3734,1.70552e+06,3817
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(X((X("(p62>=1)"))U(G("((p116>=1)&&(p58>=1))"))))))
Formula 2 simplified : !FX(X"(p62>=1)" U G"((p116>=1)&&(p58>=1))")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
263 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,14.9868,368628,1,0,2276,2.44474e+06,43,2126,3738,2.28729e+06,6254
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("(p138>=1)"))
Formula 3 simplified : !"(p138>=1)"
Computing Next relation with stutter on 1 deadlock states
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,14.9879,368892,1,0,2276,2.44474e+06,46,2126,3739,2.28729e+06,6256
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((((F("(p55>=1)"))U(X("(p39>=1)")))U(G(F("((p72>=1)&&(p6>=1))")))))
Formula 4 simplified : !((F"(p55>=1)" U X"(p39>=1)") U GF"((p72>=1)&&(p6>=1))")
Computing Next relation with stutter on 1 deadlock states
156 unique states visited
156 strongly connected components in search stack
157 transitions explored
156 items max in DFS search stack
224 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,17.2343,426096,1,0,2427,2.79996e+06,55,2731,3743,2.67462e+06,7934
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F("((p28>=1)&&(p4>=1))")))
Formula 5 simplified : !F"((p28>=1)&&(p4>=1))"
Computing Next relation with stutter on 1 deadlock states
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,17.2354,426096,1,0,2427,2.79996e+06,64,2731,3747,2.67462e+06,7938
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G("((p12>=1)&&(p36>=1))")))
Formula 6 simplified : !G"((p12>=1)&&(p36>=1))"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
582 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,23.0484,530904,1,0,3033,3.54165e+06,72,3337,3751,3.33243e+06,9165
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X("(p60>=1)")))
Formula 7 simplified : !X"(p60>=1)"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
237 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,25.4239,572352,1,0,3186,3.88282e+06,75,3640,3752,3.54164e+06,9628
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(G(F(("(p68>=1)")U("((p135>=1)&&(p15>=1))"))))))
Formula 8 simplified : !XGF("(p68>=1)" U "((p135>=1)&&(p15>=1))")
Computing Next relation with stutter on 1 deadlock states
156 unique states visited
156 strongly connected components in search stack
157 transitions explored
156 items max in DFS search stack
136 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,26.7907,607992,1,0,3337,4.18767e+06,84,3941,3756,3.72892e+06,10393
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((("((p108>=1)&&(p36>=1))")U(G(F(F("((p152>=1)&&(p8>=1))"))))))
Formula 9 simplified : !("((p108>=1)&&(p36>=1))" U GF"((p152>=1)&&(p8>=1))")
Computing Next relation with stutter on 1 deadlock states
156 unique states visited
156 strongly connected components in search stack
157 transitions explored
156 items max in DFS search stack
173 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,28.5221,647552,1,0,3488,4.5342e+06,93,4242,3760,3.93464e+06,11158
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((F(G(X("(p106>=1)"))))U(G(X(G("((p45>=1)&&(p9>=1))"))))))
Formula 10 simplified : !(FGX"(p106>=1)" U GXG"((p45>=1)&&(p9>=1))")
Computing Next relation with stutter on 1 deadlock states
157 unique states visited
156 strongly connected components in search stack
159 transitions explored
156 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,28.526,647708,1,0,3488,4.5342e+06,104,4242,3765,3.93464e+06,11166
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(("(p165>=1)")U(G(F("((p8>=1)&&(p48>=1))"))))))
Formula 11 simplified : !F("(p165>=1)" U GF"((p8>=1)&&(p48>=1))")
Computing Next relation with stutter on 1 deadlock states
156 unique states visited
156 strongly connected components in search stack
157 transitions explored
156 items max in DFS search stack
165 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,30.1826,687308,1,0,3639,4.88328e+06,113,4543,3768,4.1438e+06,11931
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X("((p40>=1)&&(p160>=1))")))
Formula 12 simplified : !X"((p40>=1)&&(p160>=1))"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
165 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,31.8306,727172,1,0,3791,5.23477e+06,116,4844,3772,4.35701e+06,12391
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G("((p26>=1)&&(p78>=1))")))
Formula 13 simplified : !G"((p26>=1)&&(p78>=1))"
Computing Next relation with stutter on 1 deadlock states
Compilation finished in 20236 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 70 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((LTLAP22==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
250 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,34.3327,790268,1,0,4397,5.69404e+06,122,5450,3776,4.78831e+06,13616
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((F("((p66>=1)&&(p22>=1))"))U(G("((p38>=1)&&(p76>=1))"))))
Formula 14 simplified : !(F"((p66>=1)&&(p22>=1))" U G"((p38>=1)&&(p76>=1))")
Computing Next relation with stutter on 1 deadlock states
LTSmin run took 13384 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>((LTLAP23==true)))U([]((LTLAP24==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
153 unique states visited
153 strongly connected components in search stack
153 transitions explored
153 items max in DFS search stack
605 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,40.3856,904824,1,0,5153,6.44451e+06,133,6355,3786,5.5062e+06,16649
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X("((p51>=1)&&(p102>=1))")))
Formula 15 simplified : !X"((p51>=1)&&(p102>=1))"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
150 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,41.8789,933336,1,0,5305,6.69154e+06,136,6656,3790,5.66391e+06,17109
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
LTSmin run took 13622 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1552817590375
--------------------
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/ -smt
+ 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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 17, 2019 10:12:08 AM fr.lip6.move.gal.application.Application start
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/, -smt]
Mar 17, 2019 10:12:08 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 17, 2019 10:12:08 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 141 ms
Mar 17, 2019 10:12:08 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 199 places.
Mar 17, 2019 10:12:08 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 699 transitions.
Mar 17, 2019 10:12:08 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 33 ms
Mar 17, 2019 10:12:09 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 21 fixed domain variables (out of 199 variables) in GAL type Eratosthenes_PT_200
Mar 17, 2019 10:12:09 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 21 constant array cells/variables (out of 199 variables) in type Eratosthenes_PT_200
Mar 17, 2019 10:12:09 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: p101,p131,p139,p179,p157,p197,p107,p109,p103,p199,p181,p127,p193,p163,p191,p167,p149,p151,p113,p137,p173,
Mar 17, 2019 10:12:09 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 46 fixed domain variables (out of 199 variables) in GAL type Eratosthenes_PT_200
Mar 17, 2019 10:12:09 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 46 constant array cells/variables (out of 199 variables) in type Eratosthenes_PT_200
Mar 17, 2019 10:12:09 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: p101,p131,p139,p179,p157,p67,p79,p43,p41,p197,p47,p11,p107,p7,p59,p97,p109,p103,p71,p199,p181,p23,p29,p83,p127,p193,p61,p31,p163,p191,p3,p89,p167,p149,p2,p151,p73,p13,p113,p53,p137,p5,p19,p37,p173,p17,
Mar 17, 2019 10:12:09 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 46 constant variables :p101=1, p131=1, p139=1, p179=1, p157=1, p67=1, p79=1, p43=1, p41=1, p197=1, p47=1, p11=1, p107=1, p7=1, p59=1, p97=1, p109=1, p103=1, p71=1, p199=1, p181=1, p23=1, p29=1, p83=1, p127=1, p193=1, p61=1, p31=1, p163=1, p191=1, p3=1, p89=1, p167=1, p149=1, p2=1, p151=1, p73=1, p13=1, p113=1, p53=1, p137=1, p5=1, p19=1, p37=1, p173=1, p17=1
Mar 17, 2019 10:12:09 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 332 expressions due to constant valuations.
Mar 17, 2019 10:12:09 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 214 ms
Mar 17, 2019 10:12:09 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
Mar 17, 2019 10:12:09 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Mar 17, 2019 10:12:09 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 699 transitions.
Mar 17, 2019 10:12:10 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 0 place invariants in 19 ms
Mar 17, 2019 10:12:10 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 153 variables to be positive in 307 ms
Mar 17, 2019 10:12:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 699 transitions.
Mar 17, 2019 10:12:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/699 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 10:12:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 78 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 10:12:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 699 transitions.
Mar 17, 2019 10:12:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 10:12:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 699 transitions.
Mar 17, 2019 10:12:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(101/699) took 2149 ms. Total solver calls (SAT/UNSAT): 1753(1753/0)
Mar 17, 2019 10:12:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(274/699) took 5155 ms. Total solver calls (SAT/UNSAT): 3931(3931/0)
Mar 17, 2019 10:12:19 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(488/699) took 8157 ms. Total solver calls (SAT/UNSAT): 5489(5489/0)
Mar 17, 2019 10:12:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 10321 ms. Total solver calls (SAT/UNSAT): 5965(5965/0)
Mar 17, 2019 10:12:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 699 transitions.
Mar 17, 2019 10:12:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 96 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 10:12:21 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 12464ms conformant to PINS in folder :/home/mcc/execution
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="Eratosthenes-PT-200"
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-3957"
echo " Executing tool itstools"
echo " Input is Eratosthenes-PT-200, 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 r074-smll-155234739300295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-200.tgz
mv Eratosthenes-PT-200 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; 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 '
echo "FORMULA_NAME $x"
done
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 ;