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.r030-smll-155225126500007.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 CSRepetitions-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-155225126500007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 4.8K Feb 9 08:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 9 08:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 5 06:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 5 06:48 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 107 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 345 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 23:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K Feb 4 23:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 2 01:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 2 01:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Jan 29 14:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Jan 29 14:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-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 CSRepetitions-COL-02-LTLFireability-00
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-01
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-02
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-03
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-04
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-05
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-06
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-07
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-08
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-09
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-10
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-11
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-12
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-13
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-14
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552429202118

22:20:05.729 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
22:20:05.734 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
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 : !((X(X(F(("(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))")U("(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))"))))))
Formula 0 simplified : !XXF"(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))"
Reverse transition relation is NOT exact ! Due to transitions prepareRequest_0, prepareRequest_1, prepareRequest_2, prepareRequest_3, loseRequest_0, loseRequest_1, loseRequest_2, loseRequest_3, sendAnswer_0, sendAnswer_1, sendAnswer_2, sendAnswer_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2/12/14
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
13 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.1527,19476,1,0,82,17282,54,45,675,19049,113
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G("(((((requestBufferSlots_0>=1)&&(clientSending_0>=1))||((requestBufferSlots_0>=1)&&(clientSending_1>=1)))||((requestBufferSlots_0>=1)&&(clientSending_2>=1)))||((requestBufferSlots_0>=1)&&(clientSending_3>=1)))")))
Formula 1 simplified : !G"(((((requestBufferSlots_0>=1)&&(clientSending_0>=1))||((requestBufferSlots_0>=1)&&(clientSending_1>=1)))||((requestBufferSlots_0>=1)&&(clientSending_2>=1)))||((requestBufferSlots_0>=1)&&(clientSending_3>=1)))"
Computing Next relation with stutter on 1 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 28 rows 23 cols
invariant :clientSending_2 + clientWaiting_2 = 1
invariant :clientSending_3 + clientWaiting_3 = 1
invariant :clientSending_0 + clientWaiting_0 = 1
invariant :serverWaiting_1 + serverAnwering_1 + serverAnwering_3 + serverAnwering_5 + serverAnwering_7 = 1
invariant :clientSending_1 + clientWaiting_1 = 1
invariant :serverWaiting_0 + serverAnwering_0 + serverAnwering_2 + serverAnwering_4 + serverAnwering_6 = 1
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.262148,22264,1,0,82,31053,66,47,709,35462,129
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F("((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))")))
Formula 2 simplified : !F"((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=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,0.263319,22264,1,0,82,31053,75,47,717,35462,133
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))"))
Formula 3 simplified : !"(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=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
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.265767,22524,1,0,82,31053,75,47,717,35464,135
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X((G("((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=1))"))U("(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))")))))
Formula 4 simplified : !GX(G"((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=1))" U "(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))")
Computing Next relation with stutter on 1 deadlock states
11 unique states visited
11 strongly connected components in search stack
12 transitions explored
11 items max in DFS search stack
8 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.340227,24980,1,0,115,41875,87,75,756,46600,239
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))"))
Formula 5 simplified : !"((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=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,0.341276,24980,1,0,115,41875,87,75,756,46600,239
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))"))
Formula 6 simplified : !"((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=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,0.342197,25244,1,0,115,41875,87,75,756,46600,239
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(((((requestBufferSlots_0>=1)&&(clientSending_0>=1))||((requestBufferSlots_0>=1)&&(clientSending_1>=1)))||((requestBufferSlots_0>=1)&&(clientSending_2>=1)))||((requestBufferSlots_0>=1)&&(clientSending_3>=1)))"))
Formula 7 simplified : !"(((((requestBufferSlots_0>=1)&&(clientSending_0>=1))||((requestBufferSlots_0>=1)&&(clientSending_1>=1)))||((requestBufferSlots_0>=1)&&(clientSending_2>=1)))||((requestBufferSlots_0>=1)&&(clientSending_3>=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
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.343453,25244,1,0,115,41875,87,75,756,46600,239
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G(F(F("((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))"))))U(F(("((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=1))")U("((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=1))")))))
Formula 8 simplified : !(GF"((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))" U F"((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=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,0.349401,25244,1,0,135,42240,94,89,757,47314,287
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(G(G("(((((requestBufferSlots_0>=1)&&(clientSending_0>=1))||((requestBufferSlots_0>=1)&&(clientSending_1>=1)))||((requestBufferSlots_0>=1)&&(clientSending_2>=1)))||((requestBufferSlots_0>=1)&&(clientSending_3>=1)))")))))
Formula 9 simplified : !G"(((((requestBufferSlots_0>=1)&&(clientSending_0>=1))||((requestBufferSlots_0>=1)&&(clientSending_1>=1)))||((requestBufferSlots_0>=1)&&(clientSending_2>=1)))||((requestBufferSlots_0>=1)&&(clientSending_3>=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
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.351648,25416,1,0,135,42240,94,89,757,47314,287
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(G(F("(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))"))))U(F(X(G("(((((requestBufferSlots_0>=1)&&(clientSending_0>=1))||((requestBufferSlots_0>=1)&&(clientSending_1>=1)))||((requestBufferSlots_0>=1)&&(clientSending_2>=1)))||((requestBufferSlots_0>=1)&&(clientSending_3>=1)))"))))))
Formula 10 simplified : !(FGF"(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))" U FXG"(((((requestBufferSlots_0>=1)&&(clientSending_0>=1))||((requestBufferSlots_0>=1)&&(clientSending_1>=1)))||((requestBufferSlots_0>=1)&&(clientSending_2>=1)))||((requestBufferSlots_0>=1)&&(clientSending_3>=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
33 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.684705,33252,1,0,192,87789,101,149,757,104841,434
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((((X("(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))"))U(X("((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))")))U(X(("(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))")U("(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))")))))
Formula 11 simplified : !((X"(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))" U X"((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))") U X("(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))" U "(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))"))
Computing Next relation with stutter on 1 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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.745193,34908,1,0,200,93526,116,156,797,112204,468
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(G(X(X(X("(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))")))))))
Formula 12 simplified : !GXXX"(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=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
23 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.977031,42560,1,0,234,137828,119,186,797,160239,552
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(F("(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))"))))
Formula 13 simplified : !GF"(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
12 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.09037,46752,1,0,256,164534,119,207,797,182832,606
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=1))"))
Formula 14 simplified : !"((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=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
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.09109,46752,1,0,256,164534,119,207,797,182832,606
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(F(X(G(X("((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=1))")))))))
Formula 15 simplified : !XFXGX"((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=1))"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
3 strongly connected components in search stack
5 transitions explored
4 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,1.12815,47784,1,0,258,169395,119,211,797,190022,619
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 1552429209574

--------------------
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 12, 2019 10:20:05 PM 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 12, 2019 10:20:05 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 12, 2019 10:20:05 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1149 ms
Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 6 places.
Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 12, 2019 10:20:06 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 9 ms
Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 29 ms
Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 12 ms
Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to requestBufferSlots_0 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientSending_0 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientSending_1 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientSending_2 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientSending_3 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to requestBuffer_0 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to requestBuffer_1 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to requestBuffer_2 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to requestBuffer_3 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverWaiting_0 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverWaiting_1 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientWaiting_0 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientWaiting_1 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientWaiting_2 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientWaiting_3 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_0 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_1 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_2 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_3 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_4 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_5 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_6 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_7 in partition

Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.application.MccTranslator applyOrder
WARNING: Could not apply decomposition. Using flat GAL structure.
java.lang.ArrayIndexOutOfBoundsException: -1
at org.eclipse.emf.common.util.BasicEList.get(BasicEList.java:348)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:439)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:145)
at fr.lip6.move.gal.application.MccTranslator.applyOrder(MccTranslator.java:129)
at fr.lip6.move.gal.application.MccTranslator.flattenSpec(MccTranslator.java:156)
at fr.lip6.move.gal.application.Application.start(Application.java:236)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:40)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:137)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:107)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:400)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.lang.reflect.Method.invoke(Method.java:498)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:595)
at org.eclipse.equinox.launcher.Main.run(Main.java:1501)
at org.eclipse.equinox.launcher.Main.main(Main.java:1474)
Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 9 ms
Mar 12, 2019 10:20:06 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Mar 12, 2019 10:20:06 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Mar 12, 2019 10:20:06 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 14 transitions. Expanding to a total of 38 deterministic transitions.
Mar 12, 2019 10:20:07 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 6 ms.
Mar 12, 2019 10:20:07 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 6 place invariants in 12 ms
Mar 12, 2019 10:20:07 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 23 variables to be positive in 163 ms
Mar 12, 2019 10:20:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 28 transitions.
Mar 12, 2019 10:20:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/28 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 12, 2019 10:20:07 PM 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 12, 2019 10:20:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 28 transitions.
Mar 12, 2019 10:20:07 PM 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 12, 2019 10:20:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 28 transitions.
Mar 12, 2019 10:20:08 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Mar 12, 2019 10:20:08 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (= 1 (+ (select s0 9) (select s0 15) (select s0 17) (select s0 19) (select s0 21)))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (= 1 (+ (select s0 9) (select s0 15) (select s0 17) (select s0 19) (select s0 21)))")
[(declare-fun s0 () (Array Int Int)), (assert (= 1 (+ (select s0 9) (select s0 15) (select s0 17) (select s0 19) (select s0 21)))), (assert (and (>= (select s0 8) 1) (>= (select s0 9) 1))), (assert (>= (select s0 8) 0)), (assert (>= (select s0 9) 0)), (assert (>= (select s0 15) 0)), (assert (>= (select s0 17) 0)), (assert (>= (select s0 19) 0)), (assert (>= (select s0 21) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@4b27aa7d
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@4b27aa7d
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:448)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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 12, 2019 10:20:08 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1297ms 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="CSRepetitions-COL-02"
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 CSRepetitions-COL-02, 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-smll-155225126500007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-02 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 ;