Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r195-csrt-155246554700619.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is HouseConstruction-PT-00002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r195-csrt-155246554700619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.3K Feb 11 01:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 11 01:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 7 01:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 7 01:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 23:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 3 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 3 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jan 31 03:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Jan 31 03:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-00002-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-00002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553746067834

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 18 rows 26 cols

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X("(p2>=1)")))
Formula 0 simplified : !X"(p2>=1)"
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.036673,16700,1,0,39,2686,54,23,671,2213,46
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(F("(p22>=1)"))))
Formula 1 simplified : !GF"(p22>=1)"
Computing Next relation with stutter on 1 deadlock states
39 unique states visited
39 strongly connected components in search stack
40 transitions explored
39 items max in DFS search stack
4 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.075331,18680,1,0,138,10417,67,159,705,10673,449
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((F(X(G("(p7>=1)"))))U("((p20>=1)&&(p19>=1))")))
Formula 2 simplified : !(FXG"(p7>=1)" U "((p20>=1)&&(p19>=1))")
Computing Next relation with stutter on 1 deadlock states
28 unique states visited
27 strongly connected components in search stack
28 transitions explored
27 items max in DFS search stack
11 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.19127,23264,1,0,893,29325,85,734,709,47181,1995
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(G((X("((p9>=1)&&(p8>=1))"))U(F("(p17>=1)"))))))
Formula 3 simplified : !XG(X"((p9>=1)&&(p8>=1))" U F"(p17>=1)")
Computing Next relation with stutter on 1 deadlock states
39 unique states visited
39 strongly connected components in search stack
40 transitions explored
39 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.204767,23908,1,0,946,32580,94,787,710,50086,2163
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((true))
Formula 4 simplified : 0
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,0.204922,23908,1,0,946,32580,94,787,710,50086,2163
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((false))
Formula 5 simplified : 1
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 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.205374,23908,1,0,946,32580,96,787,710,50086,2166
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(G(("((p4>=1)&&(p15>=1))")U(G("(p11>=1)"))))))
Formula 6 simplified : !XG("((p4>=1)&&(p15>=1))" U G"(p11>=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
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.207667,24508,1,0,946,32591,114,787,724,50120,2178
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G(G(G(X(F("((p9>=1)&&(p8>=1))")))))))
Formula 7 simplified : !GXF"((p9>=1)&&(p8>=1))"
Computing Next relation with stutter on 1 deadlock states
39 unique states visited
39 strongly connected components in search stack
40 transitions explored
39 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.208281,24508,1,0,946,32591,123,787,727,50120,2184
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F(G(X(G(X("(p6>=1)")))))))
Formula 8 simplified : !FGXGX"(p6>=1)"
Computing Next relation with stutter on 1 deadlock states
39 unique states visited
38 strongly connected components in search stack
41 transitions explored
39 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.209266,24644,1,0,946,32591,128,787,728,50120,2187
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(G(F(("(p11>=1)")U("((p4>=1)&&(p15>=1))"))))))
Formula 9 simplified : !GF("(p11>=1)" U "((p4>=1)&&(p15>=1))")
Computing Next relation with stutter on 1 deadlock states
39 unique states visited
39 strongly connected components in search stack
40 transitions explored
39 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.215231,24880,1,0,1010,33507,135,851,728,51255,2367
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(G(F(X(X("(p5>=1)")))))))
Formula 10 simplified : !GFXX"(p5>=1)"
Computing Next relation with stutter on 1 deadlock states
40 unique states visited
40 strongly connected components in search stack
41 transitions explored
40 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.21593,24880,1,0,1010,33507,144,851,729,51255,2373
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(X(G(X(G("(p18>=1)")))))))
Formula 11 simplified : !XXGXG"(p18>=1)"
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.217088,24880,1,0,1012,33531,150,853,730,51310,2387
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((G(X(F("((p4>=1)&&(p15>=1))"))))U(G("(((p10>=1)&&(p13>=1))&&(p12>=1))"))))
Formula 12 simplified : !(GXF"((p4>=1)&&(p15>=1))" U G"(((p10>=1)&&(p13>=1))&&(p12>=1))")
Computing Next relation with stutter on 1 deadlock states
35 unique states visited
35 strongly connected components in search stack
35 transitions explored
35 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.253861,25700,1,0,1138,38543,156,991,736,57189,2872
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F("(p11>=1)")))
Formula 13 simplified : !F"(p11>=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
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.262461,26228,1,0,1261,40392,163,1071,736,59306,3140
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F((G(F("((p20>=1)&&(p19>=1))")))U(G(G("(p22>=1)"))))))
Formula 14 simplified : !F(GF"((p20>=1)&&(p19>=1))" U G"(p22>=1)")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
6 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.323787,28524,1,0,1449,52142,173,1235,736,76466,3619
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(X(("((p21>=1)&&(p23>=1))")U("(p16>=1)")))))
Formula 15 simplified : !FX("((p21>=1)&&(p23>=1))" U "(p16>=1)")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.342805,28788,1,0,1579,53927,182,1313,737,78782,3902
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00002-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
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 1553746071092

--------------------
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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -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 28, 2019 4:07:49 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 28, 2019 4:07:49 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 26 ms
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 26 places.
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 18 transitions.
Mar 28, 2019 4:07:50 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 9 ms
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 20 ms
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 7 ms
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 18 transitions.
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 26 places.
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 18 transitions.
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 18 transitions.
Mar 28, 2019 4:07:50 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Mar 28, 2019 4:07:50 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 0 place invariants in 4 ms
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 26 variables to be positive in 68 ms
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 18 transitions.
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/18 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 18 transitions.
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 28, 2019 4:07:50 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Mar 28, 2019 4:07:50 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 15) 1) (= (store (store s0 14 (+ (select s0 14) 1)) 15 (- (select s0 15) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 15) 1) (= (store (store s0 14 (+ (select s0 14) 1)) 15 (- (select s0 15) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 28, 2019 4:07:50 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 478ms 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="HouseConstruction-PT-00002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsm"
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-3954"
echo " Executing tool itstoolsm"
echo " Input is HouseConstruction-PT-00002, 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 r195-csrt-155246554700619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00002.tgz
mv HouseConstruction-PT-00002 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 '' 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 ;