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-158961389700017.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-000020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961389700017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.3K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 19K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 11K 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-000020-00
FORMULA_NAME Philosophers-COL-000020-01
FORMULA_NAME Philosophers-COL-000020-02
FORMULA_NAME Philosophers-COL-000020-03
FORMULA_NAME Philosophers-COL-000020-04
FORMULA_NAME Philosophers-COL-000020-05
FORMULA_NAME Philosophers-COL-000020-06
FORMULA_NAME Philosophers-COL-000020-07
FORMULA_NAME Philosophers-COL-000020-08
FORMULA_NAME Philosophers-COL-000020-09
FORMULA_NAME Philosophers-COL-000020-10
FORMULA_NAME Philosophers-COL-000020-11
FORMULA_NAME Philosophers-COL-000020-12
FORMULA_NAME Philosophers-COL-000020-13
FORMULA_NAME Philosophers-COL-000020-14
FORMULA_NAME Philosophers-COL-000020-15

=== Now, execution of the tool begins

BK_START 1589780468300

[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) : 530 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 100 PT places and 100.0 transition bindings in 12 ms.
[2020-05-18 05:41:10] [INFO ] Computed order based on color domains.
[2020-05-18 05:41:11] [INFO ] Unfolded HLPN to a Petri net with 100 places and 100 transitions in 10 ms.
[2020-05-18 05:41:11] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 169 resets, run finished after 313 ms. (steps per millisecond=319 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 100 rows 100 cols
[2020-05-18 05:41:11] [INFO ] Computed 40 place invariants in 7 ms
[2020-05-18 05:41:11] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned unsat
[2020-05-18 05:41:11] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned unsat
[2020-05-18 05:41:11] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned unsat
[2020-05-18 05:41:11] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 9 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 : 33 ms
FORMULA Philosophers-COL-000020-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 05:41:11] [INFO ] Flatten gal took : 15 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 : 23 ms
[2020-05-18 05:41:11] [INFO ] Input system was already deterministic with 100 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 100 rows 100 cols
[2020-05-18 05:41:11] [INFO ] Computed 40 place invariants in 2 ms
inv : think_2 + catch1_2 + catch2_2 + eat_2 = 1
inv : think_12 + catch1_12 + catch2_12 + eat_12 = 1
inv : fork_11 + catch1_12 + catch2_11 + eat_11 + eat_12 = 1
inv : fork_4 + catch1_5 + catch2_4 + eat_4 + eat_5 = 1
inv : fork_17 + catch1_18 + catch2_17 + eat_17 + eat_18 = 1
inv : think_9 + catch1_9 + catch2_9 + eat_9 = 1
inv : fork_18 + catch1_19 + catch2_18 + eat_18 + eat_19 = 1
inv : fork_5 + catch1_6 + catch2_5 + eat_5 + eat_6 = 1
inv : fork_10 + catch1_11 + catch2_10 + eat_10 + eat_11 = 1
inv : think_15 + catch1_15 + catch2_15 + eat_15 = 1
inv : think_19 + catch1_19 + catch2_19 + eat_19 = 1
inv : think_13 + catch1_13 + catch2_13 + eat_13 = 1
inv : fork_9 + catch1_10 + catch2_9 + eat_9 + eat_10 = 1
inv : fork_15 + catch1_16 + catch2_15 + eat_15 + eat_16 = 1
inv : think_8 + catch1_8 + catch2_8 + eat_8 = 1
inv : fork_2 + catch1_3 + catch2_2 + eat_2 + eat_3 = 1
inv : fork_19 + catch1_0 + catch2_19 + eat_0 + eat_19 = 1
inv : think_16 + catch1_16 + catch2_16 + eat_16 = 1
inv : think_5 + catch1_5 + catch2_5 + eat_5 = 1
inv : fork_7 + catch1_8 + catch2_7 + eat_7 + eat_8 = 1
inv : fork_12 + catch1_13 + catch2_12 + eat_12 + eat_13 = 1
inv : think_1 + catch1_1 + catch2_1 + eat_1 = 1
inv : fork_14 + catch1_15 + catch2_14 + eat_14 + eat_15 = 1
inv : think_7 + catch1_7 + catch2_7 + eat_7 = 1
inv : think_14 + catch1_14 + catch2_14 + eat_14 = 1
inv : think_4 + catch1_4 + catch2_4 + eat_4 = 1
inv : think_0 + catch1_0 + catch2_0 + eat_0 = 1
inv : think_17 + catch1_17 + catch2_17 + eat_17 = 1
inv : fork_1 + catch1_2 + catch2_1 + eat_1 + eat_2 = 1
inv : fork_6 + catch1_7 + catch2_6 + eat_6 + eat_7 = 1
inv : think_6 + catch1_6 + catch2_6 + eat_6 = 1
inv : think_11 + catch1_11 + catch2_11 + eat_11 = 1
inv : fork_0 + catch1_1 + catch2_0 + eat_0 + eat_1 = 1
inv : fork_13 + catch1_14 + catch2_13 + eat_13 + eat_14 = 1
inv : think_10 + catch1_10 + catch2_10 + eat_10 = 1
inv : fork_8 + catch1_9 + catch2_8 + eat_8 + eat_9 = 1
inv : fork_16 + catch1_17 + catch2_16 + eat_16 + eat_17 = 1
inv : think_3 + catch1_3 + catch2_3 + eat_3 = 1
inv : fork_3 + catch1_4 + catch2_3 + eat_3 + eat_4 = 1
inv : think_18 + catch1_18 + catch2_18 + eat_18 = 1
Total of 40 invariants.
[2020-05-18 05:41:11] [INFO ] Computed 40 place invariants in 5 ms
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/graph770946452511588080.txt, -o, /tmp/graph770946452511588080.bin, -w, /tmp/graph770946452511588080.weights], workingDir=null]
[2020-05-18 05:41:11] [INFO ] Proved 100 variables to be positive in 119 ms
[2020-05-18 05:41:11] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2020-05-18 05:41:11] [INFO ] Computation of disable matrix completed :0/100 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 05:41:11] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 05:41:11] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2020-05-18 05:41:11] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph770946452511588080.bin, -l, -1, -v, -w, /tmp/graph770946452511588080.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 05:41:12] [INFO ] Decomposing Gal with order
[2020-05-18 05:41:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 05:41:12] [INFO ] Removed a total of 100 redundant transitions.
[2020-05-18 05:41:12] [INFO ] Flatten gal took : 111 ms
[2020-05-18 05:41:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2020-05-18 05:41:12] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 13 ms
[2020-05-18 05:41:12] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 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]

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 : !((F(!((F("((((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19)<3)"))U(!(F("((((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19)>=3)")))))))
Formula 0 simplified : !F!(F"((((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19)<3)" U !F"((((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19)>=3)")
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
4 transitions explored
3 items max in DFS search stack
59 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.617264,41424,1,0,60,120730,23,58,2679,166287,153
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G("((((((((((((((((((((gi1.gu2.catch1_0+gi1.gu2.catch1_1)+gi1.gu2.catch1_2)+gi1.gu2.catch1_3)+gi1.gu2.catch1_4)+gi1.gu2.catch1_5)+gi1.gu2.catch1_6)+gi1.gu2.catch1_7)+gi1.gu2.catch1_8)+gi1.gu2.catch1_9)+gi1.gu2.catch1_10)+gi1.gu2.catch1_11)+gi1.gu2.catch1_12)+gi1.gu2.catch1_13)+gi1.gu2.catch1_14)+gi1.gu2.catch1_15)+gi1.gu2.catch1_16)+gi1.gu2.catch1_17)+gi1.gu2.catch1_18)+gi1.gu2.catch1_19)<=(((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19))")))
Formula 1 simplified : !G"((((((((((((((((((((gi1.gu2.catch1_0+gi1.gu2.catch1_1)+gi1.gu2.catch1_2)+gi1.gu2.catch1_3)+gi1.gu2.catch1_4)+gi1.gu2.catch1_5)+gi1.gu2.catch1_6)+gi1.gu2.catch1_7)+gi1.gu2.catch1_8)+gi1.gu2.catch1_9)+gi1.gu2.catch1_10)+gi1.gu2.catch1_11)+gi1.gu2.catch1_12)+gi1.gu2.catch1_13)+gi1.gu2.catch1_14)+gi1.gu2.catch1_15)+gi1.gu2.catch1_16)+gi1.gu2.catch1_17)+gi1.gu2.catch1_18)+gi1.gu2.catch1_19)<=(((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19))"
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
183 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.44702,82868,1,0,86,247362,35,90,11439,414781,258
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(G((X(G(X(F("((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)>=3)")))))U(((X("((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)<=(((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19))"))||("((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)>=3)"))||("((((((((((((((((((((gi1.gu2.catch1_0+gi1.gu2.catch1_1)+gi1.gu2.catch1_2)+gi1.gu2.catch1_3)+gi1.gu2.catch1_4)+gi1.gu2.catch1_5)+gi1.gu2.catch1_6)+gi1.gu2.catch1_7)+gi1.gu2.catch1_8)+gi1.gu2.catch1_9)+gi1.gu2.catch1_10)+gi1.gu2.catch1_11)+gi1.gu2.catch1_12)+gi1.gu2.catch1_13)+gi1.gu2.catch1_14)+gi1.gu2.catch1_15)+gi1.gu2.catch1_16)+gi1.gu2.catch1_17)+gi1.gu2.catch1_18)+gi1.gu2.catch1_19)<2)"))))))
Formula 2 simplified : G(XGXF"((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)>=3)" U ("((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)>=3)" | "((((((((((((((((((((gi1.gu2.catch1_0+gi1.gu2.catch1_1)+gi1.gu2.catch1_2)+gi1.gu2.catch1_3)+gi1.gu2.catch1_4)+gi1.gu2.catch1_5)+gi1.gu2.catch1_6)+gi1.gu2.catch1_7)+gi1.gu2.catch1_8)+gi1.gu2.catch1_9)+gi1.gu2.catch1_10)+gi1.gu2.catch1_11)+gi1.gu2.catch1_12)+gi1.gu2.catch1_13)+gi1.gu2.catch1_14)+gi1.gu2.catch1_15)+gi1.gu2.catch1_16)+gi1.gu2.catch1_17)+gi1.gu2.catch1_18)+gi1.gu2.catch1_19)<2)" | X"((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)<=(((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19))"))
Computing Next relation with stutter on 2 deadlock states
[2020-05-18 05:41:15] [INFO ] Computing symmetric co enabling matrix : 100 transitions.
[2020-05-18 05:41:15] [INFO ] Computation of co-enabling matrix(0/100) took 15 ms. Total solver calls (SAT/UNSAT): 8(3/5)
[2020-05-18 05:41:17] [INFO ] Computation of Finished co-enabling matrix. took 1393 ms. Total solver calls (SAT/UNSAT): 520(100/420)
[2020-05-18 05:41:17] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2020-05-18 05:41:17] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 05:41:17] [INFO ] Built C files in 5352ms 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]
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
271 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.16316,141528,1,0,110,543990,57,121,13327,904277,361
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(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.gu0.think_10)+gi0.gu0.think_11)+gi0.gu0.think_12)+gi0.gu0.think_13)+gi0.gu0.think_14)+gi0.gu0.think_15)+gi0.gu0.think_16)+gi0.gu0.think_17)+gi0.gu0.think_18)+gi0.gu0.think_19)<=(((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19))")))U("((((((((((((((((((((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.gu0.think_10)+gi0.gu0.think_11)+gi0.gu0.think_12)+gi0.gu0.think_13)+gi0.gu0.think_14)+gi0.gu0.think_15)+gi0.gu0.think_16)+gi0.gu0.think_17)+gi0.gu0.think_18)+gi0.gu0.think_19)<=(((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19))")))
Formula 3 simplified : !(!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.gu0.think_10)+gi0.gu0.think_11)+gi0.gu0.think_12)+gi0.gu0.think_13)+gi0.gu0.think_14)+gi0.gu0.think_15)+gi0.gu0.think_16)+gi0.gu0.think_17)+gi0.gu0.think_18)+gi0.gu0.think_19)<=(((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19))" U "((((((((((((((((((((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.gu0.think_10)+gi0.gu0.think_11)+gi0.gu0.think_12)+gi0.gu0.think_13)+gi0.gu0.think_14)+gi0.gu0.think_15)+gi0.gu0.think_16)+gi0.gu0.think_17)+gi0.gu0.think_18)+gi0.gu0.think_19)<=(((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19))")
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
59 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.75157,151296,1,0,111,544291,66,125,16346,905193,414
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G(("((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)<3)")U(("((((((((((((((((((((gi1.gu2.catch1_0+gi1.gu2.catch1_1)+gi1.gu2.catch1_2)+gi1.gu2.catch1_3)+gi1.gu2.catch1_4)+gi1.gu2.catch1_5)+gi1.gu2.catch1_6)+gi1.gu2.catch1_7)+gi1.gu2.catch1_8)+gi1.gu2.catch1_9)+gi1.gu2.catch1_10)+gi1.gu2.catch1_11)+gi1.gu2.catch1_12)+gi1.gu2.catch1_13)+gi1.gu2.catch1_14)+gi1.gu2.catch1_15)+gi1.gu2.catch1_16)+gi1.gu2.catch1_17)+gi1.gu2.catch1_18)+gi1.gu2.catch1_19)<=(((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19))")U(!(X("((((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19)>=2)"))))))))
Formula 4 simplified : !FG("((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)<3)" U ("((((((((((((((((((((gi1.gu2.catch1_0+gi1.gu2.catch1_1)+gi1.gu2.catch1_2)+gi1.gu2.catch1_3)+gi1.gu2.catch1_4)+gi1.gu2.catch1_5)+gi1.gu2.catch1_6)+gi1.gu2.catch1_7)+gi1.gu2.catch1_8)+gi1.gu2.catch1_9)+gi1.gu2.catch1_10)+gi1.gu2.catch1_11)+gi1.gu2.catch1_12)+gi1.gu2.catch1_13)+gi1.gu2.catch1_14)+gi1.gu2.catch1_15)+gi1.gu2.catch1_16)+gi1.gu2.catch1_17)+gi1.gu2.catch1_18)+gi1.gu2.catch1_19)<=(((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19))" U !X"((((((((((((((((((((gi0.gu4.eat_0+gi0.gu4.eat_1)+gi0.gu4.eat_2)+gi0.gu4.eat_3)+gi0.gu4.eat_4)+gi0.gu4.eat_5)+gi0.gu4.eat_6)+gi0.gu4.eat_7)+gi0.gu4.eat_8)+gi0.gu4.eat_9)+gi0.gu4.eat_10)+gi0.gu4.eat_11)+gi0.gu4.eat_12)+gi0.gu4.eat_13)+gi0.gu4.eat_14)+gi0.gu4.eat_15)+gi0.gu4.eat_16)+gi0.gu4.eat_17)+gi0.gu4.eat_18)+gi0.gu4.eat_19)>=2)"))
Computing Next relation with stutter on 2 deadlock states
Compilation finished in 1439 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 59 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([](((LTLAP7==true))U(((LTLAP8==true))U(!( X((LTLAP9==true))) )))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([](((LTLAP7==true))U(((LTLAP8==true))U(!( X((LTLAP9==true))) )))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([](((LTLAP7==true))U(((LTLAP8==true))U(!( X((LTLAP9==true))) )))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
363 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,9.38309,228316,1,0,129,838293,89,138,21845,1.56046e+06,461
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(((!(G("((((((((((((((((((((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)+gu3.catch2_10)+gu3.catch2_11)+gu3.catch2_12)+gu3.catch2_13)+gu3.catch2_14)+gu3.catch2_15)+gu3.catch2_16)+gu3.catch2_17)+gu3.catch2_18)+gu3.catch2_19)<=(((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19))")))&&("((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)<=(((((((((((((((((((gi1.gu2.catch1_0+gi1.gu2.catch1_1)+gi1.gu2.catch1_2)+gi1.gu2.catch1_3)+gi1.gu2.catch1_4)+gi1.gu2.catch1_5)+gi1.gu2.catch1_6)+gi1.gu2.catch1_7)+gi1.gu2.catch1_8)+gi1.gu2.catch1_9)+gi1.gu2.catch1_10)+gi1.gu2.catch1_11)+gi1.gu2.catch1_12)+gi1.gu2.catch1_13)+gi1.gu2.catch1_14)+gi1.gu2.catch1_15)+gi1.gu2.catch1_16)+gi1.gu2.catch1_17)+gi1.gu2.catch1_18)+gi1.gu2.catch1_19))"))U(X("((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)<=(((((((((((((((((((gi1.gu2.catch1_0+gi1.gu2.catch1_1)+gi1.gu2.catch1_2)+gi1.gu2.catch1_3)+gi1.gu2.catch1_4)+gi1.gu2.catch1_5)+gi1.gu2.catch1_6)+gi1.gu2.catch1_7)+gi1.gu2.catch1_8)+gi1.gu2.catch1_9)+gi1.gu2.catch1_10)+gi1.gu2.catch1_11)+gi1.gu2.catch1_12)+gi1.gu2.catch1_13)+gi1.gu2.catch1_14)+gi1.gu2.catch1_15)+gi1.gu2.catch1_16)+gi1.gu2.catch1_17)+gi1.gu2.catch1_18)+gi1.gu2.catch1_19))")))))
Formula 5 simplified : ("((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)<=(((((((((((((((((((gi1.gu2.catch1_0+gi1.gu2.catch1_1)+gi1.gu2.catch1_2)+gi1.gu2.catch1_3)+gi1.gu2.catch1_4)+gi1.gu2.catch1_5)+gi1.gu2.catch1_6)+gi1.gu2.catch1_7)+gi1.gu2.catch1_8)+gi1.gu2.catch1_9)+gi1.gu2.catch1_10)+gi1.gu2.catch1_11)+gi1.gu2.catch1_12)+gi1.gu2.catch1_13)+gi1.gu2.catch1_14)+gi1.gu2.catch1_15)+gi1.gu2.catch1_16)+gi1.gu2.catch1_17)+gi1.gu2.catch1_18)+gi1.gu2.catch1_19))" & !G"((((((((((((((((((((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)+gu3.catch2_10)+gu3.catch2_11)+gu3.catch2_12)+gu3.catch2_13)+gu3.catch2_14)+gu3.catch2_15)+gu3.catch2_16)+gu3.catch2_17)+gu3.catch2_18)+gu3.catch2_19)<=(((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19))") U X"((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)<=(((((((((((((((((((gi1.gu2.catch1_0+gi1.gu2.catch1_1)+gi1.gu2.catch1_2)+gi1.gu2.catch1_3)+gi1.gu2.catch1_4)+gi1.gu2.catch1_5)+gi1.gu2.catch1_6)+gi1.gu2.catch1_7)+gi1.gu2.catch1_8)+gi1.gu2.catch1_9)+gi1.gu2.catch1_10)+gi1.gu2.catch1_11)+gi1.gu2.catch1_12)+gi1.gu2.catch1_13)+gi1.gu2.catch1_14)+gi1.gu2.catch1_15)+gi1.gu2.catch1_16)+gi1.gu2.catch1_17)+gi1.gu2.catch1_18)+gi1.gu2.catch1_19))"
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
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,9.39312,228880,1,0,129,838293,102,138,21998,1.56046e+06,468
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Philosophers-COL-000020-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(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)+gi0.gu0.think_10)+gi0.gu0.think_11)+gi0.gu0.think_12)+gi0.gu0.think_13)+gi0.gu0.think_14)+gi0.gu0.think_15)+gi0.gu0.think_16)+gi0.gu0.think_17)+gi0.gu0.think_18)+gi0.gu0.think_19)>=2)")))||("((((((((((((((((((((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)+gu3.catch2_10)+gu3.catch2_11)+gu3.catch2_12)+gu3.catch2_13)+gu3.catch2_14)+gu3.catch2_15)+gu3.catch2_16)+gu3.catch2_17)+gu3.catch2_18)+gu3.catch2_19)>=2)"))&&("((((((((((((((((((((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.gu0.think_10)+gi0.gu0.think_11)+gi0.gu0.think_12)+gi0.gu0.think_13)+gi0.gu0.think_14)+gi0.gu0.think_15)+gi0.gu0.think_16)+gi0.gu0.think_17)+gi0.gu0.think_18)+gi0.gu0.think_19)>=1)"))))||(F((X("((((((((((((((((((((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)+gu3.catch2_10)+gu3.catch2_11)+gu3.catch2_12)+gu3.catch2_13)+gu3.catch2_14)+gu3.catch2_15)+gu3.catch2_16)+gu3.catch2_17)+gu3.catch2_18)+gu3.catch2_19)>=2)"))&&("((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)>=2)")))))
Formula 6 simplified : !(!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.gu0.think_10)+gi0.gu0.think_11)+gi0.gu0.think_12)+gi0.gu0.think_13)+gi0.gu0.think_14)+gi0.gu0.think_15)+gi0.gu0.think_16)+gi0.gu0.think_17)+gi0.gu0.think_18)+gi0.gu0.think_19)>=1)" & ("((((((((((((((((((((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)+gu3.catch2_10)+gu3.catch2_11)+gu3.catch2_12)+gu3.catch2_13)+gu3.catch2_14)+gu3.catch2_15)+gu3.catch2_16)+gu3.catch2_17)+gu3.catch2_18)+gu3.catch2_19)>=2)" | !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)+gi0.gu0.think_10)+gi0.gu0.think_11)+gi0.gu0.think_12)+gi0.gu0.think_13)+gi0.gu0.think_14)+gi0.gu0.think_15)+gi0.gu0.think_16)+gi0.gu0.think_17)+gi0.gu0.think_18)+gi0.gu0.think_19)>=2)")) | F("((((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19)>=2)" & X"((((((((((((((((((((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)+gu3.catch2_10)+gu3.catch2_11)+gu3.catch2_12)+gu3.catch2_13)+gu3.catch2_14)+gu3.catch2_15)+gu3.catch2_16)+gu3.catch2_17)+gu3.catch2_18)+gu3.catch2_19)>=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
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,9.40565,229100,1,0,129,838293,134,138,22224,1.56046e+06,481
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Philosophers-COL-000020-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(!(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)+gu3.catch2_10)+gu3.catch2_11)+gu3.catch2_12)+gu3.catch2_13)+gu3.catch2_14)+gu3.catch2_15)+gu3.catch2_16)+gu3.catch2_17)+gu3.catch2_18)+gu3.catch2_19)<=(((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19))"))||(G("((((((((((((((((((((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)+gu3.catch2_10)+gu3.catch2_11)+gu3.catch2_12)+gu3.catch2_13)+gu3.catch2_14)+gu3.catch2_15)+gu3.catch2_16)+gu3.catch2_17)+gu3.catch2_18)+gu3.catch2_19)>=2)")))))))
Formula 7 simplified : !F!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)+gu3.catch2_10)+gu3.catch2_11)+gu3.catch2_12)+gu3.catch2_13)+gu3.catch2_14)+gu3.catch2_15)+gu3.catch2_16)+gu3.catch2_17)+gu3.catch2_18)+gu3.catch2_19)<=(((((((((((((((((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)+gi1.gu1.fork_5)+gi1.gu1.fork_6)+gi1.gu1.fork_7)+gi1.gu1.fork_8)+gi1.gu1.fork_9)+gi1.gu1.fork_10)+gi1.gu1.fork_11)+gi1.gu1.fork_12)+gi1.gu1.fork_13)+gi1.gu1.fork_14)+gi1.gu1.fork_15)+gi1.gu1.fork_16)+gi1.gu1.fork_17)+gi1.gu1.fork_18)+gi1.gu1.fork_19))" | G"((((((((((((((((((((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)+gu3.catch2_10)+gu3.catch2_11)+gu3.catch2_12)+gu3.catch2_13)+gu3.catch2_14)+gu3.catch2_15)+gu3.catch2_16)+gu3.catch2_17)+gu3.catch2_18)+gu3.catch2_19)>=2)")
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
275 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,12.1525,267844,1,0,153,967338,141,163,30124,1.81084e+06,568
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589780486746

--------------------
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-000020"
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-000020, 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-158961389700017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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