Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961389700009.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-COL-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961389700009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 9.9K Apr 27 15:14 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 Philosophers-COL-000010-00
FORMULA_NAME Philosophers-COL-000010-01
FORMULA_NAME Philosophers-COL-000010-02
FORMULA_NAME Philosophers-COL-000010-03
FORMULA_NAME Philosophers-COL-000010-04
FORMULA_NAME Philosophers-COL-000010-05
FORMULA_NAME Philosophers-COL-000010-06
FORMULA_NAME Philosophers-COL-000010-07
FORMULA_NAME Philosophers-COL-000010-08
FORMULA_NAME Philosophers-COL-000010-09
FORMULA_NAME Philosophers-COL-000010-10
FORMULA_NAME Philosophers-COL-000010-11
FORMULA_NAME Philosophers-COL-000010-12
FORMULA_NAME Philosophers-COL-000010-13
FORMULA_NAME Philosophers-COL-000010-14
FORMULA_NAME Philosophers-COL-000010-15

=== Now, execution of the tool begins

BK_START 1589780468471

[2020-05-18 05:41:10] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 05:41:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 05:41:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-18 05:41:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 480 ms
[2020-05-18 05:41:10] [INFO ] sort/places :
Philo->think,fork,catch1,catch2,eat,

[2020-05-18 05:41:10] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50 PT places and 50.0 transition bindings in 14 ms.
[2020-05-18 05:41:10] [INFO ] Computed order based on color domains.
[2020-05-18 05:41:10] [INFO ] Unfolded HLPN to a Petri net with 50 places and 50 transitions in 13 ms.
[2020-05-18 05:41:10] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 684 resets, run finished after 280 ms. (steps per millisecond=357 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 50 rows 50 cols
[2020-05-18 05:41:10] [INFO ] Computed 20 place invariants in 4 ms
[2020-05-18 05:41:11] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned unsat
[2020-05-18 05:41:11] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned unsat
[2020-05-18 05:41:11] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned unsat
[2020-05-18 05:41:11] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned unsat
[2020-05-18 05:41:11] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
[2020-05-18 05:41:11] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-18 05:41:11] [INFO ] Flatten gal took : 24 ms
FORMULA Philosophers-COL-000010-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 05:41:11] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 05:41:11] [INFO ] Applying decomposition
[2020-05-18 05:41:11] [INFO ] Flatten gal took : 19 ms
[2020-05-18 05:41:11] [INFO ] Input system was already deterministic with 50 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph11606874649199496157.txt, -o, /tmp/graph11606874649199496157.bin, -w, /tmp/graph11606874649199496157.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 50 rows 50 cols
[2020-05-18 05:41:11] [INFO ] Computed 20 place invariants in 1 ms
inv : think_1 + catch1_1 + catch2_1 + eat_1 = 1
inv : fork_5 + catch1_6 + catch2_5 + eat_5 + eat_6 = 1
inv : think_6 + catch1_6 + catch2_6 + eat_6 = 1
inv : fork_9 + catch1_0 + catch2_9 + eat_0 + eat_9 = 1
inv : fork_8 + catch1_9 + catch2_8 + eat_8 + eat_9 = 1
inv : think_8 + catch1_8 + catch2_8 + eat_8 = 1
inv : fork_2 + catch1_3 + catch2_2 + eat_2 + eat_3 = 1
inv : think_4 + catch1_4 + catch2_4 + eat_4 = 1
inv : think_2 + catch1_2 + catch2_2 + eat_2 = 1
inv : think_0 + catch1_0 + catch2_0 + eat_0 = 1
inv : fork_1 + catch1_2 + catch2_1 + eat_1 + eat_2 = 1
inv : fork_0 + catch1_1 + catch2_0 + eat_0 + eat_1 = 1
inv : think_7 + catch1_7 + catch2_7 + eat_7 = 1
inv : think_5 + catch1_5 + catch2_5 + eat_5 = 1
inv : fork_6 + catch1_7 + catch2_6 + eat_6 + eat_7 = 1
inv : think_9 + catch1_9 + catch2_9 + eat_9 = 1
inv : fork_4 + catch1_5 + catch2_4 + eat_4 + eat_5 = 1
inv : think_3 + catch1_3 + catch2_3 + eat_3 = 1
inv : fork_7 + catch1_8 + catch2_7 + eat_7 + eat_8 = 1
inv : fork_3 + catch1_4 + catch2_3 + eat_3 + eat_4 = 1
Total of 20 invariants.
[2020-05-18 05:41:11] [INFO ] Computed 20 place invariants in 2 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph11606874649199496157.bin, -l, -1, -v, -w, /tmp/graph11606874649199496157.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 05:41:11] [INFO ] Decomposing Gal with order
[2020-05-18 05:41:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 05:41:11] [INFO ] Removed a total of 50 redundant transitions.
[2020-05-18 05:41:11] [INFO ] Flatten gal took : 38 ms
[2020-05-18 05:41:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2020-05-18 05:41:11] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-18 05:41:11] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
[2020-05-18 05:41:11] [INFO ] Proved 50 variables to be positive in 307 ms

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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 --gen-order FOLLOW
Read 8 LTL properties
Checking formula 0 : !((G(F(G(X(X((G(X(F("((((((((((gi0.gu0.think_0+gi0.gu0.think_1)+gi0.gu0.think_2)+gi0.gu0.think_3)+gi0.gu0.think_4)+gi0.gu0.think_5)+gi0.gu0.think_6)+gi0.gu0.think_7)+gi0.gu0.think_8)+gi0.gu0.think_9)<=(((((((((gi0.gu2.catch1_0+gi0.gu2.catch1_1)+gi0.gu2.catch1_2)+gi0.gu2.catch1_3)+gi0.gu2.catch1_4)+gi0.gu2.catch1_5)+gi0.gu2.catch1_6)+gi0.gu2.catch1_7)+gi0.gu2.catch1_8)+gi0.gu2.catch1_9))"))))U(G("((((((((((gi0.gu0.think_0+gi0.gu0.think_1)+gi0.gu0.think_2)+gi0.gu0.think_3)+gi0.gu0.think_4)+gi0.gu0.think_5)+gi0.gu0.think_6)+gi0.gu0.think_7)+gi0.gu0.think_8)+gi0.gu0.think_9)<=(((((((((gi0.gu2.catch1_0+gi0.gu2.catch1_1)+gi0.gu2.catch1_2)+gi0.gu2.catch1_3)+gi0.gu2.catch1_4)+gi0.gu2.catch1_5)+gi0.gu2.catch1_6)+gi0.gu2.catch1_7)+gi0.gu2.catch1_8)+gi0.gu2.catch1_9))")))))))))
Formula 0 simplified : !GFGXX(GXF"((((((((((gi0.gu0.think_0+gi0.gu0.think_1)+gi0.gu0.think_2)+gi0.gu0.think_3)+gi0.gu0.think_4)+gi0.gu0.think_5)+gi0.gu0.think_6)+gi0.gu0.think_7)+gi0.gu0.think_8)+gi0.gu0.think_9)<=(((((((((gi0.gu2.catch1_0+gi0.gu2.catch1_1)+gi0.gu2.catch1_2)+gi0.gu2.catch1_3)+gi0.gu2.catch1_4)+gi0.gu2.catch1_5)+gi0.gu2.catch1_6)+gi0.gu2.catch1_7)+gi0.gu2.catch1_8)+gi0.gu2.catch1_9))" U G"((((((((((gi0.gu0.think_0+gi0.gu0.think_1)+gi0.gu0.think_2)+gi0.gu0.think_3)+gi0.gu0.think_4)+gi0.gu0.think_5)+gi0.gu0.think_6)+gi0.gu0.think_7)+gi0.gu0.think_8)+gi0.gu0.think_9)<=(((((((((gi0.gu2.catch1_0+gi0.gu2.catch1_1)+gi0.gu2.catch1_2)+gi0.gu2.catch1_3)+gi0.gu2.catch1_4)+gi0.gu2.catch1_5)+gi0.gu2.catch1_6)+gi0.gu2.catch1_7)+gi0.gu2.catch1_8)+gi0.gu2.catch1_9))")
[2020-05-18 05:41:11] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2020-05-18 05:41:11] [INFO ] Computation of disable matrix completed :0/50 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 05:41:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 05:41:11] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2020-05-18 05:41:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.159419,23128,1,0,17,22228,21,12,2493,28774,37
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(G(!(F(!(F(("((((((((((gi0.gu2.catch1_0+gi0.gu2.catch1_1)+gi0.gu2.catch1_2)+gi0.gu2.catch1_3)+gi0.gu2.catch1_4)+gi0.gu2.catch1_5)+gi0.gu2.catch1_6)+gi0.gu2.catch1_7)+gi0.gu2.catch1_8)+gi0.gu2.catch1_9)>=2)")U(!(F((G("((((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)<=(((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9))"))&&("((((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)<=(((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9))"))))))))))))
Formula 1 simplified : G!F!F("((((((((((gi0.gu2.catch1_0+gi0.gu2.catch1_1)+gi0.gu2.catch1_2)+gi0.gu2.catch1_3)+gi0.gu2.catch1_4)+gi0.gu2.catch1_5)+gi0.gu2.catch1_6)+gi0.gu2.catch1_7)+gi0.gu2.catch1_8)+gi0.gu2.catch1_9)>=2)" U !F("((((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)<=(((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9))" & G"((((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)<=(((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9))"))
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
17 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.325148,29420,1,0,49,48964,34,48,3153,80916,141
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((!(("((((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)>=3)")U("((((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9)>=2)")))&&(!(F(G("(((((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9)>=2)&&((((((((((gi0.gu2.catch1_0+gi0.gu2.catch1_1)+gi0.gu2.catch1_2)+gi0.gu2.catch1_3)+gi0.gu2.catch1_4)+gi0.gu2.catch1_5)+gi0.gu2.catch1_6)+gi0.gu2.catch1_7)+gi0.gu2.catch1_8)+gi0.gu2.catch1_9)>=1))")))))))
Formula 2 simplified : !F(!("((((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)>=3)" U "((((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9)>=2)") & !FG"(((((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9)>=2)&&((((((((((gi0.gu2.catch1_0+gi0.gu2.catch1_1)+gi0.gu2.catch1_2)+gi0.gu2.catch1_3)+gi0.gu2.catch1_4)+gi0.gu2.catch1_5)+gi0.gu2.catch1_6)+gi0.gu2.catch1_7)+gi0.gu2.catch1_8)+gi0.gu2.catch1_9)>=1))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
15 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.474736,34956,1,0,72,71655,52,70,3300,122823,224
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(G(X("((((((((((gi0.gu0.think_0+gi0.gu0.think_1)+gi0.gu0.think_2)+gi0.gu0.think_3)+gi0.gu0.think_4)+gi0.gu0.think_5)+gi0.gu0.think_6)+gi0.gu0.think_7)+gi0.gu0.think_8)+gi0.gu0.think_9)>=2)"))))U(F((F("(((((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9)>=1)&&((((((((((gi0.gu2.catch1_0+gi0.gu2.catch1_1)+gi0.gu2.catch1_2)+gi0.gu2.catch1_3)+gi0.gu2.catch1_4)+gi0.gu2.catch1_5)+gi0.gu2.catch1_6)+gi0.gu2.catch1_7)+gi0.gu2.catch1_8)+gi0.gu2.catch1_9)<=(((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)))"))&&((F("((((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9)>=1)"))||("((((((((((gi0.gu0.think_0+gi0.gu0.think_1)+gi0.gu0.think_2)+gi0.gu0.think_3)+gi0.gu0.think_4)+gi0.gu0.think_5)+gi0.gu0.think_6)+gi0.gu0.think_7)+gi0.gu0.think_8)+gi0.gu0.think_9)>=2)"))))))
Formula 3 simplified : !(!GX"((((((((((gi0.gu0.think_0+gi0.gu0.think_1)+gi0.gu0.think_2)+gi0.gu0.think_3)+gi0.gu0.think_4)+gi0.gu0.think_5)+gi0.gu0.think_6)+gi0.gu0.think_7)+gi0.gu0.think_8)+gi0.gu0.think_9)>=2)" U F(F"(((((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9)>=1)&&((((((((((gi0.gu2.catch1_0+gi0.gu2.catch1_1)+gi0.gu2.catch1_2)+gi0.gu2.catch1_3)+gi0.gu2.catch1_4)+gi0.gu2.catch1_5)+gi0.gu2.catch1_6)+gi0.gu2.catch1_7)+gi0.gu2.catch1_8)+gi0.gu2.catch1_9)<=(((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)))" & ("((((((((((gi0.gu0.think_0+gi0.gu0.think_1)+gi0.gu0.think_2)+gi0.gu0.think_3)+gi0.gu0.think_4)+gi0.gu0.think_5)+gi0.gu0.think_6)+gi0.gu0.think_7)+gi0.gu0.think_8)+gi0.gu0.think_9)>=2)" | F"((((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9)>=1)")))
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
39 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.873912,47300,1,0,117,116556,83,108,3942,211517,331
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G((X("((((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)>=1)"))U((F("((((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)>=1)"))||("((((((((((gi0.gu2.catch1_0+gi0.gu2.catch1_1)+gi0.gu2.catch1_2)+gi0.gu2.catch1_3)+gi0.gu2.catch1_4)+gi0.gu2.catch1_5)+gi0.gu2.catch1_6)+gi0.gu2.catch1_7)+gi0.gu2.catch1_8)+gi0.gu2.catch1_9)<=(((((((((gu3.catch2_0+gu3.catch2_1)+gu3.catch2_2)+gu3.catch2_3)+gu3.catch2_4)+gu3.catch2_5)+gu3.catch2_6)+gu3.catch2_7)+gu3.catch2_8)+gu3.catch2_9))"))))||(F(G("((((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)>=1)")))))
Formula 4 simplified : !(G(X"((((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)>=1)" U ("((((((((((gi0.gu2.catch1_0+gi0.gu2.catch1_1)+gi0.gu2.catch1_2)+gi0.gu2.catch1_3)+gi0.gu2.catch1_4)+gi0.gu2.catch1_5)+gi0.gu2.catch1_6)+gi0.gu2.catch1_7)+gi0.gu2.catch1_8)+gi0.gu2.catch1_9)<=(((((((((gu3.catch2_0+gu3.catch2_1)+gu3.catch2_2)+gu3.catch2_3)+gu3.catch2_4)+gu3.catch2_5)+gu3.catch2_6)+gu3.catch2_7)+gu3.catch2_8)+gu3.catch2_9))" | F"((((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)>=1)")) | FG"((((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9)>=1)")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.900923,47796,1,0,121,117653,97,112,4460,212000,354
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X(F("((((((((((gi0.gu0.think_0+gi0.gu0.think_1)+gi0.gu0.think_2)+gi0.gu0.think_3)+gi0.gu0.think_4)+gi0.gu0.think_5)+gi0.gu0.think_6)+gi0.gu0.think_7)+gi0.gu0.think_8)+gi0.gu0.think_9)>=2)")))))
Formula 5 simplified : !FXF"((((((((((gi0.gu0.think_0+gi0.gu0.think_1)+gi0.gu0.think_2)+gi0.gu0.think_3)+gi0.gu0.think_4)+gi0.gu0.think_5)+gi0.gu0.think_6)+gi0.gu0.think_7)+gi0.gu0.think_8)+gi0.gu0.think_9)>=2)"
Computing Next relation with stutter on 2 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,0.902372,48060,1,0,121,117653,104,112,4470,212000,358
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(F("((((((((((gu3.catch2_0+gu3.catch2_1)+gu3.catch2_2)+gu3.catch2_3)+gu3.catch2_4)+gu3.catch2_5)+gu3.catch2_6)+gu3.catch2_7)+gu3.catch2_8)+gu3.catch2_9)>(((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9))"))))
Formula 6 simplified : F"((((((((((gu3.catch2_0+gu3.catch2_1)+gu3.catch2_2)+gu3.catch2_3)+gu3.catch2_4)+gu3.catch2_5)+gu3.catch2_6)+gu3.catch2_7)+gu3.catch2_8)+gu3.catch2_9)>(((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,1.03275,51716,1,0,143,135029,112,133,5004,242971,421
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(G(X((F("((((((((((gu3.catch2_0+gu3.catch2_1)+gu3.catch2_2)+gu3.catch2_3)+gu3.catch2_4)+gu3.catch2_5)+gu3.catch2_6)+gu3.catch2_7)+gu3.catch2_8)+gu3.catch2_9)<=(((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9))"))||("((((((((((gi0.gu0.think_0+gi0.gu0.think_1)+gi0.gu0.think_2)+gi0.gu0.think_3)+gi0.gu0.think_4)+gi0.gu0.think_5)+gi0.gu0.think_6)+gi0.gu0.think_7)+gi0.gu0.think_8)+gi0.gu0.think_9)<=(((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9))"))))))
Formula 7 simplified : GX("((((((((((gi0.gu0.think_0+gi0.gu0.think_1)+gi0.gu0.think_2)+gi0.gu0.think_3)+gi0.gu0.think_4)+gi0.gu0.think_5)+gi0.gu0.think_6)+gi0.gu0.think_7)+gi0.gu0.think_8)+gi0.gu0.think_9)<=(((((((((gu4.eat_0+gu4.eat_1)+gu4.eat_2)+gu4.eat_3)+gu4.eat_4)+gu4.eat_5)+gu4.eat_6)+gu4.eat_7)+gu4.eat_8)+gu4.eat_9))" | F"((((((((((gu3.catch2_0+gu3.catch2_1)+gu3.catch2_2)+gu3.catch2_3)+gu3.catch2_4)+gu3.catch2_5)+gu3.catch2_6)+gu3.catch2_7)+gu3.catch2_8)+gu3.catch2_9)<=(((((((((gu1.fork_0+gu1.fork_1)+gu1.fork_2)+gu1.fork_3)+gu1.fork_4)+gu1.fork_5)+gu1.fork_6)+gu1.fork_7)+gu1.fork_8)+gu1.fork_9))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
35 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.38395,60948,1,0,167,169974,128,157,6859,312816,492
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-18 05:41:13] [INFO ] Computing symmetric co enabling matrix : 50 transitions.
SMT solver raised 'unknown', retrying with same input.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:492)
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:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-18 05:41:13] [INFO ] Built C files in 2098ms conformant to PINS in folder :/home/mcc/execution
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 1589780473640

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 LTLCardinality -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 -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="Philosophers-COL-000010"
export BK_EXAMINATION="LTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000010, 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 r126-tajo-158961389700009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000010.tgz
mv Philosophers-COL-000010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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 [ "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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;