fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r260-csrt-152732585500223
Last Updated
June 26, 2018

About the Execution of ITS-Tools for Philosophers-PT-000050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15757.770 91181.00 246874.00 162.60 FFTFFFFTFFFTTTFF normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.........................
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 205K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Philosophers-PT-000050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r260-csrt-152732585500223
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527492357039

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.201805151631/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("((((((((((((((((((((((((((((((((((((((((((((((((((Eat_1+Eat_2)+Eat_3)+Eat_4)+Eat_5)+Eat_6)+Eat_7)+Eat_8)+Eat_9)+Eat_10)+Eat_11)+Eat_12)+Eat_13)+Eat_15)+Eat_14)+Eat_17)+Eat_16)+Eat_19)+Eat_18)+Eat_21)+Eat_20)+Eat_23)+Eat_22)+Eat_25)+Eat_24)+Eat_27)+Eat_26)+Eat_29)+Eat_28)+Eat_32)+Eat_33)+Eat_30)+Eat_31)+Eat_36)+Eat_37)+Eat_34)+Eat_35)+Eat_40)+Eat_41)+Eat_38)+Eat_39)+Eat_44)+Eat_45)+Eat_42)+Eat_43)+Eat_49)+Eat_48)+Eat_47)+Eat_46)+Eat_50)>=3)"))
Formula 0 simplified : !"((((((((((((((((((((((((((((((((((((((((((((((((((Eat_1+Eat_2)+Eat_3)+Eat_4)+Eat_5)+Eat_6)+Eat_7)+Eat_8)+Eat_9)+Eat_10)+Eat_11)+Eat_12)+Eat_13)+Eat_15)+Eat_14)+Eat_17)+Eat_16)+Eat_19)+Eat_18)+Eat_21)+Eat_20)+Eat_23)+Eat_22)+Eat_25)+Eat_24)+Eat_27)+Eat_26)+Eat_29)+Eat_28)+Eat_32)+Eat_33)+Eat_30)+Eat_31)+Eat_36)+Eat_37)+Eat_34)+Eat_35)+Eat_40)+Eat_41)+Eat_38)+Eat_39)+Eat_44)+Eat_45)+Eat_42)+Eat_43)+Eat_49)+Eat_48)+Eat_47)+Eat_46)+Eat_50)>=3)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 250 rows 250 cols
invariant :Eat_24 + Think_24 + Catch2_24 + Catch1_24 = 1
invariant :Fork_1 + -1'Think_1 + -1'Think_2 + -1'Catch2_2 + -1'Catch1_1 = -1
invariant :Fork_27 + -1'Think_27 + -1'Think_28 + -1'Catch2_28 + -1'Catch1_27 = -1
invariant :Eat_37 + Think_37 + Catch2_37 + Catch1_37 = 1
invariant :Fork_28 + -1'Think_29 + -1'Think_28 + -1'Catch2_29 + -1'Catch1_28 = -1
invariant :Eat_9 + Think_9 + Catch2_9 + Catch1_9 = 1
invariant :Fork_20 + -1'Think_21 + -1'Think_20 + -1'Catch2_21 + -1'Catch1_20 = -1
invariant :Eat_20 + Think_20 + Catch2_20 + Catch1_20 = 1
invariant :Eat_46 + Think_46 + Catch2_46 + Catch1_46 = 1
invariant :Fork_19 + -1'Think_20 + -1'Think_19 + -1'Catch2_20 + -1'Catch1_19 = -1
invariant :Fork_48 + -1'Think_48 + -1'Think_49 + -1'Catch2_49 + -1'Catch1_48 = -1
invariant :Fork_30 + -1'Think_31 + -1'Think_30 + -1'Catch2_31 + -1'Catch1_30 = -1
invariant :Fork_37 + -1'Think_37 + -1'Think_38 + -1'Catch2_38 + -1'Catch1_37 = -1
invariant :Fork_18 + -1'Think_19 + -1'Think_18 + -1'Catch2_19 + -1'Catch1_18 = -1
invariant :Eat_45 + Think_45 + Catch2_45 + Catch1_45 = 1
invariant :Fork_50 + -1'Think_1 + -1'Think_50 + -1'Catch2_1 + -1'Catch1_50 = -1
invariant :Fork_16 + -1'Think_17 + -1'Think_16 + -1'Catch2_17 + -1'Catch1_16 = -1
invariant :Eat_48 + Think_48 + Catch2_48 + Catch1_48 = 1
invariant :Fork_38 + -1'Think_39 + -1'Think_38 + -1'Catch2_39 + -1'Catch1_38 = -1
invariant :Eat_32 + Think_32 + Catch2_32 + Catch1_32 = 1
invariant :Fork_25 + -1'Think_25 + -1'Think_26 + -1'Catch2_26 + -1'Catch1_25 = -1
invariant :Eat_34 + Think_34 + Catch2_34 + Catch1_34 = 1
invariant :Fork_47 + -1'Think_47 + -1'Think_48 + -1'Catch2_48 + -1'Catch1_47 = -1
invariant :Fork_6 + -1'Think_6 + -1'Think_7 + -1'Catch2_7 + -1'Catch1_6 = -1
invariant :Fork_8 + -1'Think_8 + -1'Think_9 + -1'Catch2_9 + -1'Catch1_8 = -1
invariant :Eat_36 + Think_36 + Catch2_36 + Catch1_36 = 1
invariant :Fork_4 + -1'Think_4 + -1'Think_5 + -1'Catch2_5 + -1'Catch1_4 = -1
invariant :Eat_5 + Think_5 + Catch2_5 + Catch1_5 = 1
invariant :Eat_27 + Think_27 + Catch2_27 + Catch1_27 = 1
invariant :Eat_38 + Think_38 + Catch2_38 + Catch1_38 = 1
invariant :Fork_49 + -1'Think_50 + -1'Think_49 + -1'Catch2_50 + -1'Catch1_49 = -1
invariant :Eat_13 + Think_13 + Catch2_13 + Catch1_13 = 1
invariant :Fork_5 + -1'Think_6 + -1'Think_5 + -1'Catch2_6 + -1'Catch1_5 = -1
invariant :Eat_30 + Think_30 + Catch2_30 + Catch1_30 = 1
invariant :Fork_21 + -1'Think_22 + -1'Think_21 + -1'Catch2_22 + -1'Catch1_21 = -1
invariant :Eat_14 + Think_14 + Catch2_14 + Catch1_14 = 1
invariant :Fork_39 + -1'Think_39 + -1'Think_40 + -1'Catch2_40 + -1'Catch1_39 = -1
invariant :Fork_11 + -1'Think_12 + -1'Think_11 + -1'Catch2_12 + -1'Catch1_11 = -1
invariant :Eat_26 + Think_26 + Catch2_26 + Catch1_26 = 1
invariant :Eat_49 + Think_49 + Catch2_49 + Catch1_49 = 1
invariant :Fork_26 + -1'Think_27 + -1'Think_26 + -1'Catch2_27 + -1'Catch1_26 = -1
invariant :Fork_10 + -1'Think_11 + -1'Think_10 + -1'Catch2_11 + -1'Catch1_10 = -1
invariant :Eat_25 + Think_25 + Catch2_25 + Catch1_25 = 1
invariant :Eat_44 + Think_44 + Catch2_44 + Catch1_44 = 1
invariant :Fork_40 + -1'Think_41 + -1'Think_40 + -1'Catch2_41 + -1'Catch1_40 = -1
invariant :Fork_46 + -1'Think_46 + -1'Think_47 + -1'Catch2_47 + -1'Catch1_46 = -1
invariant :Eat_12 + Think_12 + Catch2_12 + Catch1_12 = 1
invariant :Fork_36 + -1'Think_37 + -1'Think_36 + -1'Catch2_37 + -1'Catch1_36 = -1
invariant :Fork_15 + -1'Think_16 + -1'Think_15 + -1'Catch2_16 + -1'Catch1_15 = -1
invariant :Eat_28 + Think_28 + Catch2_28 + Catch1_28 = 1
invariant :Fork_12 + -1'Think_13 + -1'Think_12 + -1'Catch2_13 + -1'Catch1_12 = -1
invariant :Eat_33 + Think_33 + Catch2_33 + Catch1_33 = 1
invariant :Eat_43 + Think_43 + Catch2_43 + Catch1_43 = 1
invariant :Fork_35 + -1'Think_35 + -1'Think_36 + -1'Catch2_36 + -1'Catch1_35 = -1
invariant :Eat_50 + Think_50 + Catch2_50 + Catch1_50 = 1
invariant :Fork_32 + -1'Think_33 + -1'Think_32 + -1'Catch2_33 + -1'Catch1_32 = -1
invariant :Eat_40 + Think_40 + Catch2_40 + Catch1_40 = 1
invariant :Fork_45 + -1'Think_45 + -1'Think_46 + -1'Catch2_46 + -1'Catch1_45 = -1
invariant :Eat_18 + Think_18 + Catch2_18 + Catch1_18 = 1
invariant :Fork_17 + -1'Think_17 + -1'Think_18 + -1'Catch2_18 + -1'Catch1_17 = -1
invariant :Fork_29 + -1'Think_29 + -1'Think_30 + -1'Catch2_30 + -1'Catch1_29 = -1
invariant :Fork_9 + -1'Think_9 + -1'Think_10 + -1'Catch2_10 + -1'Catch1_9 = -1
invariant :Fork_43 + -1'Think_43 + -1'Think_44 + -1'Catch2_44 + -1'Catch1_43 = -1
invariant :Eat_3 + Think_3 + Catch2_3 + Catch1_3 = 1
invariant :Eat_41 + Think_41 + Catch2_41 + Catch1_41 = 1
invariant :Eat_17 + Think_17 + Catch2_17 + Catch1_17 = 1
invariant :Eat_29 + Think_29 + Catch2_29 + Catch1_29 = 1
invariant :Eat_47 + Think_47 + Catch2_47 + Catch1_47 = 1
invariant :Fork_14 + -1'Think_15 + -1'Think_14 + -1'Catch2_15 + -1'Catch1_14 = -1
invariant :Fork_23 + -1'Think_24 + -1'Think_23 + -1'Catch2_24 + -1'Catch1_23 = -1
invariant :Eat_22 + Think_22 + Catch2_22 + Catch1_22 = 1
invariant :Eat_21 + Think_21 + Catch2_21 + Catch1_21 = 1
invariant :Eat_2 + Think_2 + Catch2_2 + Catch1_2 = 1
invariant :Eat_39 + Think_39 + Catch2_39 + Catch1_39 = 1
invariant :Eat_10 + Think_10 + Catch2_10 + Catch1_10 = 1
invariant :Fork_7 + -1'Think_8 + -1'Think_7 + -1'Catch2_8 + -1'Catch1_7 = -1
invariant :Fork_22 + -1'Think_23 + -1'Think_22 + -1'Catch2_23 + -1'Catch1_22 = -1
invariant :Eat_15 + Think_15 + Catch2_15 + Catch1_15 = 1
invariant :Fork_42 + -1'Think_42 + -1'Think_43 + -1'Catch2_43 + -1'Catch1_42 = -1
invariant :Fork_44 + -1'Think_44 + -1'Think_45 + -1'Catch2_45 + -1'Catch1_44 = -1
invariant :Eat_6 + Think_6 + Catch2_6 + Catch1_6 = 1
invariant :Eat_31 + Think_31 + Catch2_31 + Catch1_31 = 1
invariant :Fork_13 + -1'Think_14 + -1'Think_13 + -1'Catch2_14 + -1'Catch1_13 = -1
invariant :Eat_11 + Think_11 + Catch2_11 + Catch1_11 = 1
invariant :Eat_35 + Think_35 + Catch2_35 + Catch1_35 = 1
invariant :Eat_16 + Think_16 + Catch2_16 + Catch1_16 = 1
invariant :Fork_33 + -1'Think_34 + -1'Think_33 + -1'Catch2_34 + -1'Catch1_33 = -1
invariant :Eat_42 + Think_42 + Catch2_42 + Catch1_42 = 1
invariant :Eat_23 + Think_23 + Catch2_23 + Catch1_23 = 1
invariant :Fork_41 + -1'Think_41 + -1'Think_42 + -1'Catch2_42 + -1'Catch1_41 = -1
invariant :Eat_1 + Think_1 + Catch2_1 + Catch1_1 = 1
invariant :Eat_7 + Think_7 + Catch2_7 + Catch1_7 = 1
invariant :Fork_3 + -1'Think_4 + -1'Think_3 + -1'Catch2_4 + -1'Catch1_3 = -1
invariant :Fork_24 + -1'Think_25 + -1'Think_24 + -1'Catch2_25 + -1'Catch1_24 = -1
invariant :Fork_2 + -1'Think_2 + -1'Think_3 + -1'Catch2_3 + -1'Catch1_2 = -1
invariant :Eat_4 + Think_4 + Catch2_4 + Catch1_4 = 1
invariant :Eat_8 + Think_8 + Catch2_8 + Catch1_8 = 1
invariant :Fork_34 + -1'Think_35 + -1'Think_34 + -1'Catch2_35 + -1'Catch1_34 = -1
invariant :Fork_31 + -1'Think_31 + -1'Think_32 + -1'Catch2_32 + -1'Catch1_31 = -1
invariant :Eat_19 + Think_19 + Catch2_19 + Catch1_19 = 1
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
72 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.765302,39844,1,0,8,167353,20,5,6350,13646,18
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(F(("((((((((((((((((((((((((((((((((((((((((((((((((((Think_1+Think_8)+Think_9)+Think_6)+Think_7)+Think_4)+Think_5)+Think_2)+Think_3)+Think_17)+Think_16)+Think_15)+Think_14)+Think_13)+Think_12)+Think_11)+Think_10)+Think_25)+Think_24)+Think_23)+Think_22)+Think_21)+Think_20)+Think_19)+Think_18)+Think_35)+Think_34)+Think_37)+Think_36)+Think_39)+Think_38)+Think_41)+Think_40)+Think_27)+Think_26)+Think_29)+Think_28)+Think_31)+Think_30)+Think_33)+Think_32)+Think_50)+Think_42)+Think_43)+Think_44)+Think_45)+Think_46)+Think_47)+Think_48)+Think_49)>=1)")U("((((((((((((((((((((((((((((((((((((((((((((((((((Catch2_1+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_19)+Catch2_18)+Catch2_17)+Catch2_16)+Catch2_23)+Catch2_22)+Catch2_21)+Catch2_20)+Catch2_11)+Catch2_10)+Catch2_9)+Catch2_8)+Catch2_15)+Catch2_14)+Catch2_13)+Catch2_12)+Catch2_34)+Catch2_35)+Catch2_32)+Catch2_33)+Catch2_38)+Catch2_39)+Catch2_36)+Catch2_37)+Catch2_26)+Catch2_27)+Catch2_24)+Catch2_25)+Catch2_30)+Catch2_31)+Catch2_28)+Catch2_29)+Catch2_49)+Catch2_48)+Catch2_50)+Catch2_45)+Catch2_44)+Catch2_47)+Catch2_46)+Catch2_41)+Catch2_40)+Catch2_43)+Catch2_42)>=1)")))))
Formula 1 simplified : !XF("((((((((((((((((((((((((((((((((((((((((((((((((((Think_1+Think_8)+Think_9)+Think_6)+Think_7)+Think_4)+Think_5)+Think_2)+Think_3)+Think_17)+Think_16)+Think_15)+Think_14)+Think_13)+Think_12)+Think_11)+Think_10)+Think_25)+Think_24)+Think_23)+Think_22)+Think_21)+Think_20)+Think_19)+Think_18)+Think_35)+Think_34)+Think_37)+Think_36)+Think_39)+Think_38)+Think_41)+Think_40)+Think_27)+Think_26)+Think_29)+Think_28)+Think_31)+Think_30)+Think_33)+Think_32)+Think_50)+Think_42)+Think_43)+Think_44)+Think_45)+Think_46)+Think_47)+Think_48)+Think_49)>=1)" U "((((((((((((((((((((((((((((((((((((((((((((((((((Catch2_1+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_19)+Catch2_18)+Catch2_17)+Catch2_16)+Catch2_23)+Catch2_22)+Catch2_21)+Catch2_20)+Catch2_11)+Catch2_10)+Catch2_9)+Catch2_8)+Catch2_15)+Catch2_14)+Catch2_13)+Catch2_12)+Catch2_34)+Catch2_35)+Catch2_32)+Catch2_33)+Catch2_38)+Catch2_39)+Catch2_36)+Catch2_37)+Catch2_26)+Catch2_27)+Catch2_24)+Catch2_25)+Catch2_30)+Catch2_31)+Catch2_28)+Catch2_29)+Catch2_49)+Catch2_48)+Catch2_50)+Catch2_45)+Catch2_44)+Catch2_47)+Catch2_46)+Catch2_41)+Catch2_40)+Catch2_43)+Catch2_42)>=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
153 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.30451,79876,1,0,110,370072,29,105,6509,347047,273
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X((F("((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)>=1)"))U("((((((((((((((((((((((((((((((((((((((((((((((((((Eat_1+Eat_2)+Eat_3)+Eat_4)+Eat_5)+Eat_6)+Eat_7)+Eat_8)+Eat_9)+Eat_10)+Eat_11)+Eat_12)+Eat_13)+Eat_15)+Eat_14)+Eat_17)+Eat_16)+Eat_19)+Eat_18)+Eat_21)+Eat_20)+Eat_23)+Eat_22)+Eat_25)+Eat_24)+Eat_27)+Eat_26)+Eat_29)+Eat_28)+Eat_32)+Eat_33)+Eat_30)+Eat_31)+Eat_36)+Eat_37)+Eat_34)+Eat_35)+Eat_40)+Eat_41)+Eat_38)+Eat_39)+Eat_44)+Eat_45)+Eat_42)+Eat_43)+Eat_49)+Eat_48)+Eat_47)+Eat_46)+Eat_50)<=(((((((((((((((((((((((((((((((((((((((((((((((((Think_1+Think_8)+Think_9)+Think_6)+Think_7)+Think_4)+Think_5)+Think_2)+Think_3)+Think_17)+Think_16)+Think_15)+Think_14)+Think_13)+Think_12)+Think_11)+Think_10)+Think_25)+Think_24)+Think_23)+Think_22)+Think_21)+Think_20)+Think_19)+Think_18)+Think_35)+Think_34)+Think_37)+Think_36)+Think_39)+Think_38)+Think_41)+Think_40)+Think_27)+Think_26)+Think_29)+Think_28)+Think_31)+Think_30)+Think_33)+Think_32)+Think_50)+Think_42)+Think_43)+Think_44)+Think_45)+Think_46)+Think_47)+Think_48)+Think_49))"))))
Formula 2 simplified : !X(F"((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)>=1)" U "((((((((((((((((((((((((((((((((((((((((((((((((((Eat_1+Eat_2)+Eat_3)+Eat_4)+Eat_5)+Eat_6)+Eat_7)+Eat_8)+Eat_9)+Eat_10)+Eat_11)+Eat_12)+Eat_13)+Eat_15)+Eat_14)+Eat_17)+Eat_16)+Eat_19)+Eat_18)+Eat_21)+Eat_20)+Eat_23)+Eat_22)+Eat_25)+Eat_24)+Eat_27)+Eat_26)+Eat_29)+Eat_28)+Eat_32)+Eat_33)+Eat_30)+Eat_31)+Eat_36)+Eat_37)+Eat_34)+Eat_35)+Eat_40)+Eat_41)+Eat_38)+Eat_39)+Eat_44)+Eat_45)+Eat_42)+Eat_43)+Eat_49)+Eat_48)+Eat_47)+Eat_46)+Eat_50)<=(((((((((((((((((((((((((((((((((((((((((((((((((Think_1+Think_8)+Think_9)+Think_6)+Think_7)+Think_4)+Think_5)+Think_2)+Think_3)+Think_17)+Think_16)+Think_15)+Think_14)+Think_13)+Think_12)+Think_11)+Think_10)+Think_25)+Think_24)+Think_23)+Think_22)+Think_21)+Think_20)+Think_19)+Think_18)+Think_35)+Think_34)+Think_37)+Think_36)+Think_39)+Think_38)+Think_41)+Think_40)+Think_27)+Think_26)+Think_29)+Think_28)+Think_31)+Think_30)+Think_33)+Think_32)+Think_50)+Think_42)+Think_43)+Think_44)+Think_45)+Think_46)+Think_47)+Think_48)+Think_49))")
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
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.36452,81636,1,0,110,370072,39,105,6966,347047,278
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Philosophers-PT-000050-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G(F(("((((((((((((((((((((((((((((((((((((((((((((((((((Catch2_1+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_19)+Catch2_18)+Catch2_17)+Catch2_16)+Catch2_23)+Catch2_22)+Catch2_21)+Catch2_20)+Catch2_11)+Catch2_10)+Catch2_9)+Catch2_8)+Catch2_15)+Catch2_14)+Catch2_13)+Catch2_12)+Catch2_34)+Catch2_35)+Catch2_32)+Catch2_33)+Catch2_38)+Catch2_39)+Catch2_36)+Catch2_37)+Catch2_26)+Catch2_27)+Catch2_24)+Catch2_25)+Catch2_30)+Catch2_31)+Catch2_28)+Catch2_29)+Catch2_49)+Catch2_48)+Catch2_50)+Catch2_45)+Catch2_44)+Catch2_47)+Catch2_46)+Catch2_41)+Catch2_40)+Catch2_43)+Catch2_42)>=2)")U("((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)>=3)")))))
Formula 3 simplified : !GF("((((((((((((((((((((((((((((((((((((((((((((((((((Catch2_1+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_19)+Catch2_18)+Catch2_17)+Catch2_16)+Catch2_23)+Catch2_22)+Catch2_21)+Catch2_20)+Catch2_11)+Catch2_10)+Catch2_9)+Catch2_8)+Catch2_15)+Catch2_14)+Catch2_13)+Catch2_12)+Catch2_34)+Catch2_35)+Catch2_32)+Catch2_33)+Catch2_38)+Catch2_39)+Catch2_36)+Catch2_37)+Catch2_26)+Catch2_27)+Catch2_24)+Catch2_25)+Catch2_30)+Catch2_31)+Catch2_28)+Catch2_29)+Catch2_49)+Catch2_48)+Catch2_50)+Catch2_45)+Catch2_44)+Catch2_47)+Catch2_46)+Catch2_41)+Catch2_40)+Catch2_43)+Catch2_42)>=2)" U "((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)>=3)")
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
87 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,3.23135,95720,1,0,114,411538,48,110,11431,406810,298
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)<=(((((((((((((((((((((((((((((((((((((((((((((((((Catch1_3+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_1)+Catch1_18)+Catch1_19)+Catch1_20)+Catch1_21)+Catch1_14)+Catch1_15)+Catch1_16)+Catch1_17)+Catch1_10)+Catch1_11)+Catch1_12)+Catch1_13)+Catch1_6)+Catch1_7)+Catch1_8)+Catch1_9)+Catch1_37)+Catch1_36)+Catch1_35)+Catch1_34)+Catch1_33)+Catch1_32)+Catch1_31)+Catch1_30)+Catch1_29)+Catch1_28)+Catch1_27)+Catch1_26)+Catch1_25)+Catch1_24)+Catch1_23)+Catch1_22)+Catch1_50)+Catch1_48)+Catch1_49)+Catch1_46)+Catch1_47)+Catch1_44)+Catch1_45)+Catch1_42)+Catch1_43)+Catch1_40)+Catch1_41)+Catch1_38)+Catch1_39))"))
Formula 4 simplified : !"((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)<=(((((((((((((((((((((((((((((((((((((((((((((((((Catch1_3+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_1)+Catch1_18)+Catch1_19)+Catch1_20)+Catch1_21)+Catch1_14)+Catch1_15)+Catch1_16)+Catch1_17)+Catch1_10)+Catch1_11)+Catch1_12)+Catch1_13)+Catch1_6)+Catch1_7)+Catch1_8)+Catch1_9)+Catch1_37)+Catch1_36)+Catch1_35)+Catch1_34)+Catch1_33)+Catch1_32)+Catch1_31)+Catch1_30)+Catch1_29)+Catch1_28)+Catch1_27)+Catch1_26)+Catch1_25)+Catch1_24)+Catch1_23)+Catch1_22)+Catch1_50)+Catch1_48)+Catch1_49)+Catch1_46)+Catch1_47)+Catch1_44)+Catch1_45)+Catch1_42)+Catch1_43)+Catch1_40)+Catch1_41)+Catch1_38)+Catch1_39))"
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
2 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,3.24915,95976,1,0,114,411538,51,110,11532,406810,300
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G(G(G(G("((((((((((((((((((((((((((((((((((((((((((((((((((Think_1+Think_8)+Think_9)+Think_6)+Think_7)+Think_4)+Think_5)+Think_2)+Think_3)+Think_17)+Think_16)+Think_15)+Think_14)+Think_13)+Think_12)+Think_11)+Think_10)+Think_25)+Think_24)+Think_23)+Think_22)+Think_21)+Think_20)+Think_19)+Think_18)+Think_35)+Think_34)+Think_37)+Think_36)+Think_39)+Think_38)+Think_41)+Think_40)+Think_27)+Think_26)+Think_29)+Think_28)+Think_31)+Think_30)+Think_33)+Think_32)+Think_50)+Think_42)+Think_43)+Think_44)+Think_45)+Think_46)+Think_47)+Think_48)+Think_49)>=3)"))))))
Formula 5 simplified : !G"((((((((((((((((((((((((((((((((((((((((((((((((((Think_1+Think_8)+Think_9)+Think_6)+Think_7)+Think_4)+Think_5)+Think_2)+Think_3)+Think_17)+Think_16)+Think_15)+Think_14)+Think_13)+Think_12)+Think_11)+Think_10)+Think_25)+Think_24)+Think_23)+Think_22)+Think_21)+Think_20)+Think_19)+Think_18)+Think_35)+Think_34)+Think_37)+Think_36)+Think_39)+Think_38)+Think_41)+Think_40)+Think_27)+Think_26)+Think_29)+Think_28)+Think_31)+Think_30)+Think_33)+Think_32)+Think_50)+Think_42)+Think_43)+Think_44)+Think_45)+Think_46)+Think_47)+Think_48)+Think_49)>=3)"
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
961 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.8572,202128,1,0,170,582018,57,211,24644,662278,561
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(("((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)>=1)")U("((((((((((((((((((((((((((((((((((((((((((((((((((Think_1+Think_8)+Think_9)+Think_6)+Think_7)+Think_4)+Think_5)+Think_2)+Think_3)+Think_17)+Think_16)+Think_15)+Think_14)+Think_13)+Think_12)+Think_11)+Think_10)+Think_25)+Think_24)+Think_23)+Think_22)+Think_21)+Think_20)+Think_19)+Think_18)+Think_35)+Think_34)+Think_37)+Think_36)+Think_39)+Think_38)+Think_41)+Think_40)+Think_27)+Think_26)+Think_29)+Think_28)+Think_31)+Think_30)+Think_33)+Think_32)+Think_50)+Think_42)+Think_43)+Think_44)+Think_45)+Think_46)+Think_47)+Think_48)+Think_49)<=(((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45))"))))
Formula 6 simplified : !G("((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)>=1)" U "((((((((((((((((((((((((((((((((((((((((((((((((((Think_1+Think_8)+Think_9)+Think_6)+Think_7)+Think_4)+Think_5)+Think_2)+Think_3)+Think_17)+Think_16)+Think_15)+Think_14)+Think_13)+Think_12)+Think_11)+Think_10)+Think_25)+Think_24)+Think_23)+Think_22)+Think_21)+Think_20)+Think_19)+Think_18)+Think_35)+Think_34)+Think_37)+Think_36)+Think_39)+Think_38)+Think_41)+Think_40)+Think_27)+Think_26)+Think_29)+Think_28)+Think_31)+Think_30)+Think_33)+Think_32)+Think_50)+Think_42)+Think_43)+Think_44)+Think_45)+Think_46)+Think_47)+Think_48)+Think_49)<=(((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45))")
Computing Next relation with stutter on 2 deadlock states
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
Compilation finished in 4799 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 99 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, [](((LTLAP3==true))U((LTLAP9==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 298 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, <>((LTLAP10==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 150 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, (LTLAP11==true), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 151 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, [](X((LTLAP12==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 194 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, <>([]((LTLAP13==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 313 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, ([]((LTLAP14==true)))U((LTLAP15==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 192 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, (LTLAP16==true), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 131 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, ([](X((LTLAP17==true))))U(X(<>((LTLAP18==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 96 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, [](([]((LTLAP19==true)))U(<>((LTLAP20==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 688 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, <>((LTLAP21==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 164 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1527492448220

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 7:25:59 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
May 28, 2018 7:25:59 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 7:25:59 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 69 ms
May 28, 2018 7:25:59 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 250 places.
May 28, 2018 7:25:59 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 250 transitions.
May 28, 2018 7:25:59 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 18 ms
May 28, 2018 7:25:59 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 112 ms
May 28, 2018 7:25:59 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
May 28, 2018 7:25:59 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 ms
May 28, 2018 7:25:59 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 250 transitions.
May 28, 2018 7:26:00 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 100 place invariants in 58 ms
May 28, 2018 7:26:00 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 250 variables to be positive in 498 ms
May 28, 2018 7:26:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 250 transitions.
May 28, 2018 7:26:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/250 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 7:26:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 7:26:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 250 transitions.
May 28, 2018 7:26:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 7:26:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 250 transitions.
May 28, 2018 7:26:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/250) took 154 ms. Total solver calls (SAT/UNSAT): 4(0/4)
May 28, 2018 7:26:52 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(26/250) took 3208 ms. Total solver calls (SAT/UNSAT): 108(0/108)
May 28, 2018 7:26:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(55/250) took 6227 ms. Total solver calls (SAT/UNSAT): 256(48/208)
May 28, 2018 7:26:58 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(79/250) took 9236 ms. Total solver calls (SAT/UNSAT): 380(90/290)
May 28, 2018 7:27:02 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(94/250) took 12415 ms. Total solver calls (SAT/UNSAT): 470(135/335)
May 28, 2018 7:27:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(116/250) took 15522 ms. Total solver calls (SAT/UNSAT): 566(183/383)
May 28, 2018 7:27:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(141/250) took 18539 ms. Total solver calls (SAT/UNSAT): 670(254/416)
May 28, 2018 7:27:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(160/250) took 21636 ms. Total solver calls (SAT/UNSAT): 745(299/446)
May 28, 2018 7:27:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(201/250) took 24683 ms. Total solver calls (SAT/UNSAT): 890(440/450)
May 28, 2018 7:27:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 27595 ms. Total solver calls (SAT/UNSAT): 950(500/450)
May 28, 2018 7:27:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 250 transitions.
May 28, 2018 7:27:20 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 2626 ms. Total solver calls (SAT/UNSAT): 250(0/250)
May 28, 2018 7:27:20 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 80423ms 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="Philosophers-PT-000050"
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

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000050.tgz
mv Philosophers-PT-000050 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000050, 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 r260-csrt-152732585500223"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;