fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r030-blw3-149440266800339
Last Updated
June 27, 2017

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
1217.860 40225.00 84062.00 141.10 FTTTFTFTFTFFFTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
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 r030-blw3-149440266800339
=====================================================================


--------------------
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-0
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-1
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
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-2
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-3
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-4
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-5
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-6
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-7
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-8
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1496274831018


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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 : !((X((X(G(("p12>=1")&&("p192>=1"))))U(X(F(("p50>=1")&&("p10>=1")))))))
Formula 0 simplified : !X(XG("p12>=1" & "p192>=1") U XF("p10>=1" & "p50>=1"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 699 rows 153 cols
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
543 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.48688,199416,1,0,612,1.26628e+06,25,608,3429,984864,1529
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F((F("p102>=1"))U(("p68>=1")U("p45>=1")))))
Formula 1 simplified : !F(F"p102>=1" U ("p68>=1" U "p45>=1"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.48746,199520,1,0,612,1.26628e+06,34,608,3430,984864,1533
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(X(G(G(X(("p6>=1")&&("p24>=1"))))))))
Formula 2 simplified : !XXGX("p6>=1" & "p24>=1")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
856 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.0507,449220,1,0,1211,3.04505e+06,53,1207,3742,2.42294e+06,2748
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((("p90>=1")&&("p15>=1")))
Formula 3 simplified : !("p15>=1" & "p90>=1")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.0514,449480,1,0,1211,3.04505e+06,61,1207,3747,2.42294e+06,2750
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((X(G(X("p129>=1"))))U(X(G(X("p122>=1"))))))
Formula 4 simplified : !(XGX"p129>=1" U XGX"p122>=1")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
155 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,15.6146,483472,1,0,1366,3.28697e+06,76,1511,3755,2.57953e+06,3223
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((F(X(G(("p174>=1")&&("p87>=1")))))U(X(("p4>=1")&&("p104>=1")))))
Formula 5 simplified : !(FXG("p87>=1" & "p174>=1") U X("p4>=1" & "p104>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
658 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,22.1939,637164,1,0,2417,4.3777e+06,104,2415,3767,3.47121e+06,5649
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(G((G(("p4>=1")&&("p116>=1")))U(F("p176>=1"))))))
Formula 6 simplified : !G(G("p4>=1" & "p116>=1") U F"p176>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
99 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.1768,676844,1,0,2569,4.70263e+06,113,2721,3768,3.672e+06,6425
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("p69>=1"))
Formula 7 simplified : !"p69>=1"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,23.1772,676844,1,0,2569,4.70263e+06,116,2721,3769,3.672e+06,6427
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((("p6>=1")&&("p150>=1")))
Formula 8 simplified : !("p6>=1" & "p150>=1")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,23.1778,676928,1,0,2569,4.70263e+06,122,2721,3773,3.672e+06,6429
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(("p192>=1")&&("p64>=1"))))
Formula 9 simplified : !G("p64>=1" & "p192>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
299 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.1771,785004,1,0,3176,5.44868e+06,135,3328,3780,4.33438e+06,7654
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((F(("p48>=1")&&("p144>=1")))U(("p116>=1")&&("p58>=1"))))
Formula 10 simplified : !(F("p48>=1" & "p144>=1") U ("p58>=1" & "p116>=1"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,26.1786,785192,1,0,3176,5.44868e+06,155,3328,3795,4.33438e+06,7658
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((("p4>=1")&&("p116>=1")))
Formula 11 simplified : !("p4>=1" & "p116>=1")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,26.1791,785352,1,0,3176,5.44868e+06,159,3328,3798,4.33438e+06,7660
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X(G(("p92>=1")U(X(("p184>=1")&&("p46>=1")))))))
Formula 12 simplified : !XG("p92>=1" U X("p46>=1" & "p184>=1"))
157 unique states visited
157 strongly connected components in search stack
158 transitions explored
157 items max in DFS search stack
144 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,27.6221,828892,1,0,3478,5.65406e+06,170,3931,3804,4.65401e+06,9329
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 : !((F(("p198>=1")&&("p99>=1"))))
Formula 13 simplified : !F("p99>=1" & "p198>=1")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,27.6229,828940,1,0,3478,5.65406e+06,184,3931,3809,4.65401e+06,9333
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(F(G("p142>=1")))))
Formula 14 simplified : !XFG"p142>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
232 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,29.9411,904272,1,0,4234,6.16616e+06,197,4842,3810,5.14494e+06,11774
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 : !((("p24>=1")&&("p8>=1")))
Formula 15 simplified : !("p8>=1" & "p24>=1")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,29.9419,904532,1,0,4234,6.16616e+06,203,4842,3814,5.14494e+06,11776
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-200-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496274871243

--------------------
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
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
May 31, 2017 11:53:52 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2017 11:53:52 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 174 ms
May 31, 2017 11:53:52 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 199 places.
May 31, 2017 11:53:52 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 699 transitions.
May 31, 2017 11:53:53 PM 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
May 31, 2017 11:53:53 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Found a total of 46 constant array cells/variables (out of 199 variables) in type Eratosthenes_PT_200
May 31, 2017 11:53:53 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: p103,p41,p13,p5,p179,p109,p191,p181,p193,p107,p37,p59,p151,p29,p199,p113,p139,p53,p97,p31,p197,p149,p89,p73,p47,p167,p61,p2,p131,p23,p137,p7,p19,p163,p3,p43,p83,p101,p173,p157,p17,p67,p127,p71,p11,p79,
May 31, 2017 11:53:53 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 46 constant variables :p103, p41, p13, p5, p179, p109, p191, p181, p193, p107, p37, p59, p151, p29, p199, p113, p139, p53, p97, p31, p197, p149, p89, p73, p47, p167, p61, p2, p131, p23, p137, p7, p19, p163, p3, p43, p83, p101, p173, p157, p17, p67, p127, p71, p11, p79
May 31, 2017 11:53:53 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 332 expressions due to constant valuations.
May 31, 2017 11:53:53 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 491 ms
May 31, 2017 11:53:53 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 47 ms
May 31, 2017 11:53:53 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
May 31, 2017 11:53:54 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 0 place invariants in 41 ms
May 31, 2017 11:53:54 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 153 variables to be positive in 125 ms
May 31, 2017 11:53:54 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 699 transitions.
May 31, 2017 11:53:54 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/699 took 30 ms. Total solver calls (SAT/UNSAT): 6(6/0)
May 31, 2017 11:53:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :17/699 took 1064 ms. Total solver calls (SAT/UNSAT): 123(123/0)
May 31, 2017 11:53:56 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :33/699 took 2225 ms. Total solver calls (SAT/UNSAT): 248(248/0)
May 31, 2017 11:53:57 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :46/699 took 3313 ms. Total solver calls (SAT/UNSAT): 369(369/0)
May 31, 2017 11:53:58 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :55/699 took 4344 ms. Total solver calls (SAT/UNSAT): 472(472/0)
May 31, 2017 11:53:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :73/699 took 5496 ms. Total solver calls (SAT/UNSAT): 587(587/0)
May 31, 2017 11:54:01 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :90/699 took 6663 ms. Total solver calls (SAT/UNSAT): 700(700/0)
May 31, 2017 11:54:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :106/699 took 7749 ms. Total solver calls (SAT/UNSAT): 818(818/0)
May 31, 2017 11:54:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :116/699 took 8750 ms. Total solver calls (SAT/UNSAT): 916(916/0)
May 31, 2017 11:54:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :128/699 took 9761 ms. Total solver calls (SAT/UNSAT): 1021(1021/0)
May 31, 2017 11:54:05 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :140/699 took 10937 ms. Total solver calls (SAT/UNSAT): 1128(1128/0)
May 31, 2017 11:54:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :147/699 took 11990 ms. Total solver calls (SAT/UNSAT): 1228(1228/0)
May 31, 2017 11:54:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :163/699 took 13069 ms. Total solver calls (SAT/UNSAT): 1338(1338/0)
May 31, 2017 11:54:08 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :176/699 took 14080 ms. Total solver calls (SAT/UNSAT): 1450(1450/0)
May 31, 2017 11:54:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :183/699 took 15111 ms. Total solver calls (SAT/UNSAT): 1546(1546/0)
May 31, 2017 11:54:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :201/699 took 16133 ms. Total solver calls (SAT/UNSAT): 1658(1658/0)
May 31, 2017 11:54:11 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :213/699 took 17265 ms. Total solver calls (SAT/UNSAT): 1769(1769/0)
May 31, 2017 11:54:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :226/699 took 18306 ms. Total solver calls (SAT/UNSAT): 1880(1880/0)
May 31, 2017 11:54:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :237/699 took 19436 ms. Total solver calls (SAT/UNSAT): 1991(1991/0)
May 31, 2017 11:54:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :252/699 took 20472 ms. Total solver calls (SAT/UNSAT): 2097(2097/0)
May 31, 2017 11:54:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :268/699 took 21551 ms. Total solver calls (SAT/UNSAT): 2211(2211/0)
May 31, 2017 11:54:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :280/699 took 22564 ms. Total solver calls (SAT/UNSAT): 2316(2316/0)
May 31, 2017 11:54:17 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :296/699 took 23564 ms. Total solver calls (SAT/UNSAT): 2431(2431/0)
May 31, 2017 11:54:19 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :306/699 took 24673 ms. Total solver calls (SAT/UNSAT): 2550(2550/0)
May 31, 2017 11:54:20 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :322/699 took 25712 ms. Total solver calls (SAT/UNSAT): 2677(2677/0)
May 31, 2017 11:54:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :340/699 took 26773 ms. Total solver calls (SAT/UNSAT): 2813(2813/0)
May 31, 2017 11:54:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :359/699 took 27899 ms. Total solver calls (SAT/UNSAT): 2938(2938/0)
May 31, 2017 11:54:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :373/699 took 29003 ms. Total solver calls (SAT/UNSAT): 3075(3075/0)
May 31, 2017 11:54:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :388/699 took 30068 ms. Total solver calls (SAT/UNSAT): 3203(3203/0)
May 31, 2017 11:54:25 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :403/699 took 31119 ms. Total solver calls (SAT/UNSAT): 3343(3343/0)
May 31, 2017 11:54:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :424/699 took 32154 ms. Total solver calls (SAT/UNSAT): 3460(3460/0)
May 31, 2017 11:54:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :434/699 took 33264 ms. Total solver calls (SAT/UNSAT): 3571(3571/0)
May 31, 2017 11:54:28 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :449/699 took 34482 ms. Total solver calls (SAT/UNSAT): 3703(3703/0)
May 31, 2017 11:54:29 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :463/699 took 35620 ms. Total solver calls (SAT/UNSAT): 3839(3839/0)
May 31, 2017 11:54:30 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states

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

tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-200.tgz
mv Eratosthenes-PT-200 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
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 r030-blw3-149440266800339"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;