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)
.........................
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 81K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is ResAllocation-PT-R020C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-qhx2-152732141000153
=====================================================================

--------------------
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 ResAllocation-PT-R020C002-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1528325950153

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.201805241334/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], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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
Read 16 LTL properties
Checking formula 0 : !((X(F(F(G("(r_0_17>=2)"))))))
Formula 0 simplified : !XFG"(r_0_17>=2)"
Reverse transition relation is NOT exact ! Due to transitions t_0_20, t_1_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/2/42
Computing Next relation with stutter on 19 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
80 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.876668,39356,1,0,336,127903,114,566,2369,188632,1570
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(G(G("(r_1_9>=3)"))))))
Formula 1 simplified : !XXG"(r_1_9>=3)"
Computing Next relation with stutter on 19 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.928785,40328,1,0,337,131575,126,567,2450,193704,1586
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(("(r_1_16>=1)")U("(r_0_5<=r_1_15)")))))
Formula 2 simplified : !GF("(r_1_16>=1)" U "(r_0_5<=r_1_15)")
Computing Next relation with stutter on 19 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
49 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.42342,50336,1,0,459,196849,135,629,2455,259480,1897
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F(F(F("(r_1_10>=1)"))))))
Formula 3 simplified : !GF"(r_1_10>=1)"
Computing Next relation with stutter on 19 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
56 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.99145,60092,1,0,868,249863,144,941,2456,325357,2683
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((F("(r_0_13<=p_0_13)"))U("(p_1_19<=p_0_7)"))))
Formula 4 simplified : !F(F"(r_0_13<=p_0_13)" U "(p_1_19<=p_0_7)")
Computing Next relation with stutter on 19 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,1.99249,60092,1,0,868,249863,153,941,2459,325358,2687
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(r_0_4>=1)"))
Formula 5 simplified : !"(r_0_4>=1)"
Computing Next relation with stutter on 19 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,1.9933,60356,1,0,868,249863,156,941,2460,325358,2689
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F("(p_1_10>=2)"))))
Formula 6 simplified : !GF"(p_1_10>=2)"
Computing Next relation with stutter on 19 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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,1.99406,60356,1,0,868,249863,165,941,2462,325360,2695
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((("(r_1_9<=r_0_5)")U("(p_0_10<=r_1_18)"))U(("(p_0_11<=r_0_14)")U("(p_0_2<=p_1_0)"))))
Formula 7 simplified : !(("(r_1_9<=r_0_5)" U "(p_0_10<=r_1_18)") U ("(p_0_11<=r_0_14)" U "(p_0_2<=p_1_0)"))
Computing Next relation with stutter on 19 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,2.00243,61388,1,0,868,249863,198,941,2496,325360,2703
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X("(r_1_10<=p_0_8)"))U("(r_1_4<=r_0_17)")))
Formula 8 simplified : !(X"(r_1_10<=p_0_8)" U "(r_1_4<=r_0_17)")
Computing Next relation with stutter on 19 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,2.00317,61388,1,0,868,249863,201,941,2499,325360,2705
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F(F("(r_1_8<=r_1_3)")))))
Formula 9 simplified : !XF"(r_1_8<=r_1_3)"
Computing Next relation with stutter on 19 deadlock states
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,2.00372,61388,1,0,868,249863,210,941,2502,325362,2709
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("(p_0_12>=3)"))
Formula 10 simplified : !"(p_0_12>=3)"
Computing Next relation with stutter on 19 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,2.00437,61388,1,0,868,249869,213,941,2504,325372,2713
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((("(r_0_13<=r_1_4)")U(X("(r_0_19<=r_1_11)"))))
Formula 11 simplified : !("(r_0_13<=r_1_4)" U X"(r_0_19<=r_1_11)")
Computing Next relation with stutter on 19 deadlock states
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,2.00568,61388,1,0,868,249869,225,941,2515,325374,2721
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X("(p_1_0>=1)")))
Formula 12 simplified : !X"(p_1_0>=1)"
Computing Next relation with stutter on 19 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,2.0064,61388,1,0,868,249884,228,941,2516,325394,2725
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(G(F(F("(p_0_5<=r_1_4)"))))))
Formula 13 simplified : !XGF"(p_0_5<=r_1_4)"
Computing Next relation with stutter on 19 deadlock states
2 unique states visited
0 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,2.00718,61388,1,0,868,249884,231,941,2520,325396,2727
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(F(G("(r_0_10<=r_0_4)")))))
Formula 14 simplified : !XFG"(r_0_10<=r_0_4)"
Computing Next relation with stutter on 19 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 42 rows 80 cols
invariant :p_0_1 + r_0_1 + -1'r_1_1 = 0
invariant :p_0_2 + r_0_2 + -1'r_1_2 = 0
invariant :p_1_8 + r_1_8 = 1
invariant :p_1_11 + r_1_11 = 1
invariant :p_0_7 + r_0_7 + -1'r_1_7 = 0
invariant :p_0_14 + r_0_14 + -1'r_1_14 = 0
invariant :p_1_17 + r_1_17 = 1
invariant :p_0_17 + r_0_17 + -1'r_1_17 = 0
invariant :p_1_7 + r_1_7 = 1
invariant :p_1_15 + r_1_15 = 1
invariant :p_1_14 + r_1_14 = 1
invariant :p_1_2 + r_1_2 = 1
invariant :p_1_4 + r_1_4 = 1
invariant :p_0_9 + r_0_9 + -1'r_1_9 = 0
invariant :p_0_6 + r_0_6 + -1'r_1_6 = 0
invariant :p_0_16 + r_0_16 + -1'r_1_16 = 0
invariant :p_1_0 + r_1_0 = 1
invariant :p_1_9 + r_1_9 = 1
invariant :p_1_6 + r_1_6 = 1
invariant :p_0_3 + r_0_3 + -1'r_1_3 = 0
invariant :p_0_18 + r_0_18 + -1'r_1_18 = 0
invariant :p_1_12 + r_1_12 = 1
invariant :p_0_12 + r_0_12 + -1'r_1_12 = 0
invariant :p_0_15 + r_0_15 + -1'r_1_15 = 0
invariant :p_1_3 + r_1_3 = 1
invariant :p_1_1 + r_1_1 = 1
invariant :p_1_5 + r_1_5 = 1
invariant :p_0_8 + r_0_8 + -1'r_1_8 = 0
invariant :p_1_18 + r_1_18 = 1
invariant :p_1_19 + r_1_19 = 1
invariant :p_0_19 + r_0_19 + -1'r_1_19 = 0
invariant :p_1_16 + r_1_16 = 1
invariant :p_1_10 + r_1_10 = 1
invariant :p_0_4 + r_0_4 + -1'r_1_4 = 0
invariant :p_0_10 + r_0_10 + -1'r_1_10 = 0
invariant :p_0_13 + r_0_13 + -1'r_1_13 = 0
invariant :p_0_11 + r_0_11 + -1'r_1_11 = 0
invariant :p_0_0 + r_0_0 + -1'r_1_0 = 0
invariant :p_0_5 + r_0_5 + -1'r_1_5 = 0
invariant :p_1_13 + r_1_13 = 1
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
408 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,6.08855,135068,1,0,2558,668081,244,2377,2524,1.01797e+06,5615
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F((G("(p_1_11>=2)"))U("(p_0_15>=1)"))))
Formula 15 simplified : !F(G"(p_1_11>=2)" U "(p_0_15>=1)")
Computing Next relation with stutter on 19 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
40 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,6.48699,140880,1,0,2970,696677,253,2897,2525,1.06112e+06,6672
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1528325968384

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 06, 2018 10:59:16 PM fr.lip6.move.gal.application.Application start
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/, -louvain, -smt]
Jun 06, 2018 10:59:16 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 10:59:17 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 90 ms
Jun 06, 2018 10:59:17 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 80 places.
Jun 06, 2018 10:59:17 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 42 transitions.
Jun 06, 2018 10:59:17 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 16 ms
Jun 06, 2018 10:59:17 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 161 ms
Jun 06, 2018 10:59:17 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
Jun 06, 2018 10:59:17 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 06, 2018 10:59:20 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 42 transitions.
Jun 06, 2018 10:59:21 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 40 place invariants in 50 ms
Jun 06, 2018 10:59:22 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 80 variables to be positive in 1192 ms
Jun 06, 2018 10:59:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 42 transitions.
Jun 06, 2018 10:59:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/42 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 10:59:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 10:59:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 42 transitions.
Jun 06, 2018 10:59:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 10:59:26 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Jun 06, 2018 10:59:26 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Jun 06, 2018 10:59:26 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 8) 1) (>= (select s0 11) 1)) (= (store (store (store (store s0 10 (+ (select s0 10) 1)) 11 (- (select s0 11) 1)) 8 (- (select s0 8) 1)) 9 (+ (select s0 9) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 8) 1) (>= (select s0 11) 1)) (= (store (store (store (store s0 10 (+ (select s0 10) 1)) 11 (- (select s0 11) 1)) 8 (- (select s0 8) 1)) 9 (+ (select s0 9) 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)
Jun 06, 2018 10:59:27 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 7236ms 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="ResAllocation-PT-R020C002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsl"
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/ResAllocation-PT-R020C002.tgz
mv ResAllocation-PT-R020C002 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is ResAllocation-PT-R020C002, 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 r189-qhx2-152732141000153"
echo "====================================================================="
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 '' LTLCardinality.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 ;