fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r156-oct2-158972914100441
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for SharedMemory-COL-000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.770 22587.00 51429.00 1040.20 TFFTFFFFFFFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r156-oct2-158972914100441.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SharedMemory-COL-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972914100441
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.1K 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 20K Apr 28 15:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 15:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 12K 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 SharedMemory-COL-000010-00
FORMULA_NAME SharedMemory-COL-000010-01
FORMULA_NAME SharedMemory-COL-000010-02
FORMULA_NAME SharedMemory-COL-000010-03
FORMULA_NAME SharedMemory-COL-000010-04
FORMULA_NAME SharedMemory-COL-000010-05
FORMULA_NAME SharedMemory-COL-000010-06
FORMULA_NAME SharedMemory-COL-000010-07
FORMULA_NAME SharedMemory-COL-000010-08
FORMULA_NAME SharedMemory-COL-000010-09
FORMULA_NAME SharedMemory-COL-000010-10
FORMULA_NAME SharedMemory-COL-000010-11
FORMULA_NAME SharedMemory-COL-000010-12
FORMULA_NAME SharedMemory-COL-000010-13
FORMULA_NAME SharedMemory-COL-000010-14
FORMULA_NAME SharedMemory-COL-000010-15

=== Now, execution of the tool begins

BK_START 1589901797921

[2020-05-19 15:23:21] [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-19 15:23:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 15:23:21] [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-19 15:23:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 807 ms
[2020-05-19 15:23:22] [INFO ] sort/places :
P->ownMemAcc,queue,memory,active,
Dot->extBus,
PxP->extMemAcc,

[2020-05-19 15:23:22] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 141 PT places and 320.0 transition bindings in 43 ms.
[2020-05-19 15:23:22] [INFO ] Computed order based on color domains.
[2020-05-19 15:23:22] [INFO ] Unfolded HLPN to a Petri net with 141 places and 220 transitions in 36 ms.
[2020-05-19 15:23:22] [INFO ] Unfolded HLPN properties in 2 ms.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 10 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 148 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 782 ms. (steps per millisecond=127 ) properties seen :[1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1]
// Phase 1: matrix 210 rows 131 cols
[2020-05-19 15:23:23] [INFO ] Computed 21 place invariants in 10 ms
[2020-05-19 15:23:23] [INFO ] [Real]Absence check using 21 positive place invariants in 26 ms returned unsat
[2020-05-19 15:23:23] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned unsat
[2020-05-19 15:23:23] [INFO ] [Real]Absence check using 21 positive place invariants in 41 ms returned unsat
[2020-05-19 15:23:23] [INFO ] [Real]Absence check using 21 positive place invariants in 46 ms returned unsat
[2020-05-19 15:23:23] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
[2020-05-19 15:23:23] [INFO ] [Real]Absence check using 21 positive place invariants in 33 ms returned unsat
[2020-05-19 15:23:24] [INFO ] [Real]Absence check using 21 positive place invariants in 66 ms returned sat
[2020-05-19 15:23:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 15:23:24] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-05-19 15:23:24] [INFO ] Computed and/alt/rep : 190/190/190 causal constraints in 70 ms.
[2020-05-19 15:23:24] [INFO ] Added : 1 causal constraints over 1 iterations in 208 ms. Result :sat
[2020-05-19 15:23:24] [INFO ] [Real]Absence check using 21 positive place invariants in 36 ms returned unsat
[2020-05-19 15:23:24] [INFO ] [Real]Absence check using 21 positive place invariants in 33 ms returned unsat
[2020-05-19 15:23:24] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned unsat
[2020-05-19 15:23:24] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned unsat
[2020-05-19 15:23:25] [INFO ] [Real]Absence check using 21 positive place invariants in 134 ms returned unsat
[2020-05-19 15:23:25] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
[2020-05-19 15:23:25] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-19 15:23:25] [INFO ] Flatten gal took : 75 ms
FORMULA SharedMemory-COL-000010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 15:23:25] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 15:23:25] [INFO ] Applying decomposition
[2020-05-19 15:23:25] [INFO ] Flatten gal took : 56 ms
[2020-05-19 15:23:25] [INFO ] Input system was already deterministic with 210 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/graph15772302256103292880.txt, -o, /tmp/graph15772302256103292880.bin, -w, /tmp/graph15772302256103292880.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph15772302256103292880.bin, -l, -1, -v, -w, /tmp/graph15772302256103292880.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 15:23:26] [INFO ] Decomposing Gal with order
[2020-05-19 15:23:26] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 210 rows 131 cols
[2020-05-19 15:23:26] [INFO ] Computed 21 place invariants in 3 ms
inv : memory_3 + extMemAcc_3 + extMemAcc_13 + extMemAcc_23 + extMemAcc_43 + extMemAcc_53 + extMemAcc_63 + extMemAcc_73 + extMemAcc_83 + extMemAcc_93 = 1
inv : ownMemAcc_5 + queue_5 + active_5 + extMemAcc_50 + extMemAcc_51 + extMemAcc_52 + extMemAcc_53 + extMemAcc_54 + extMemAcc_56 + extMemAcc_57 + extMemAcc_58 + extMemAcc_59 = 1
inv : memory_7 + extMemAcc_7 + extMemAcc_17 + extMemAcc_27 + extMemAcc_37 + extMemAcc_47 + extMemAcc_57 + extMemAcc_67 + extMemAcc_87 + extMemAcc_97 = 1
inv : ownMemAcc_1 + queue_1 + active_1 + extMemAcc_10 + extMemAcc_12 + extMemAcc_13 + extMemAcc_14 + extMemAcc_15 + extMemAcc_16 + extMemAcc_17 + extMemAcc_18 + extMemAcc_19 = 1
inv : ownMemAcc_8 + queue_8 + active_8 + extMemAcc_80 + extMemAcc_81 + extMemAcc_82 + extMemAcc_83 + extMemAcc_84 + extMemAcc_85 + extMemAcc_86 + extMemAcc_87 + extMemAcc_89 = 1
inv : memory_0 + extMemAcc_10 + extMemAcc_20 + extMemAcc_30 + extMemAcc_40 + extMemAcc_50 + extMemAcc_60 + extMemAcc_70 + extMemAcc_80 + extMemAcc_90 = 1
inv : ownMemAcc_0 + queue_0 + active_0 + extMemAcc_1 + extMemAcc_2 + extMemAcc_3 + extMemAcc_4 + extMemAcc_5 + extMemAcc_6 + extMemAcc_7 + extMemAcc_8 + extMemAcc_9 = 1
inv : ownMemAcc_2 + queue_2 + active_2 + extMemAcc_20 + extMemAcc_21 + extMemAcc_23 + extMemAcc_24 + extMemAcc_25 + extMemAcc_26 + extMemAcc_27 + extMemAcc_28 + extMemAcc_29 = 1
inv : ownMemAcc_4 + queue_4 + active_4 + extMemAcc_40 + extMemAcc_41 + extMemAcc_42 + extMemAcc_43 + extMemAcc_45 + extMemAcc_46 + extMemAcc_47 + extMemAcc_48 + extMemAcc_49 = 1
inv : memory_8 + extMemAcc_8 + extMemAcc_18 + extMemAcc_28 + extMemAcc_38 + extMemAcc_48 + extMemAcc_58 + extMemAcc_68 + extMemAcc_78 + extMemAcc_98 = 1
inv : memory_1 + extMemAcc_1 + extMemAcc_21 + extMemAcc_31 + extMemAcc_41 + extMemAcc_51 + extMemAcc_61 + extMemAcc_71 + extMemAcc_81 + extMemAcc_91 = 1
inv : ownMemAcc_9 + queue_9 + active_9 + extMemAcc_90 + extMemAcc_91 + extMemAcc_92 + extMemAcc_93 + extMemAcc_94 + extMemAcc_95 + extMemAcc_96 + extMemAcc_97 + extMemAcc_98 = 1
inv : memory_9 + extMemAcc_9 + extMemAcc_19 + extMemAcc_29 + extMemAcc_39 + extMemAcc_49 + extMemAcc_59 + extMemAcc_69 + extMemAcc_79 + extMemAcc_89 = 1
inv : memory_4 + extMemAcc_4 + extMemAcc_14 + extMemAcc_24 + extMemAcc_34 + extMemAcc_54 + extMemAcc_64 + extMemAcc_74 + extMemAcc_84 + extMemAcc_94 = 1
inv : ownMemAcc_7 + queue_7 + active_7 + extMemAcc_70 + extMemAcc_71 + extMemAcc_72 + extMemAcc_73 + extMemAcc_74 + extMemAcc_75 + extMemAcc_76 + extMemAcc_78 + extMemAcc_79 = 1
inv : ownMemAcc_6 + queue_6 + active_6 + extMemAcc_60 + extMemAcc_61 + extMemAcc_62 + extMemAcc_63 + extMemAcc_64 + extMemAcc_65 + extMemAcc_67 + extMemAcc_68 + extMemAcc_69 = 1
inv : memory_6 + extMemAcc_6 + extMemAcc_16 + extMemAcc_26 + extMemAcc_36 + extMemAcc_46 + extMemAcc_56 + extMemAcc_76 + extMemAcc_86 + extMemAcc_96 = 1
inv : memory_5 + extMemAcc_5 + extMemAcc_15 + extMemAcc_25 + extMemAcc_35 + extMemAcc_45 + extMemAcc_65 + extMemAcc_75 + extMemAcc_85 + extMemAcc_95 = 1
inv : extMemAcc_1 + extMemAcc_2 + extMemAcc_3 + extMemAcc_4 + extMemAcc_5 + extMemAcc_6 + extMemAcc_7 + extMemAcc_8 + extMemAcc_9 + extMemAcc_10 + extMemAcc_12 + extMemAcc_13 + extMemAcc_14 + extMemAcc_15 + extMemAcc_16 + extMemAcc_17 + extMemAcc_18 + extMemAcc_19 + extMemAcc_20 + extMemAcc_21 + extMemAcc_23 + extMemAcc_24 + extMemAcc_25 + extMemAcc_26 + extMemAcc_27 + extMemAcc_28 + extMemAcc_29 + extMemAcc_30 + extMemAcc_31 + extMemAcc_32 + extMemAcc_34 + extMemAcc_35 + extMemAcc_36 + extMemAcc_37 + extMemAcc_38 + extMemAcc_39 + extMemAcc_40 + extMemAcc_41 + extMemAcc_42 + extMemAcc_43 + extMemAcc_45 + extMemAcc_46 + extMemAcc_47 + extMemAcc_48 + extMemAcc_49 + extMemAcc_50 + extMemAcc_51 + extMemAcc_52 + extMemAcc_53 + extMemAcc_54 + extMemAcc_56 + extMemAcc_57 + extMemAcc_58 + extMemAcc_59 + extMemAcc_60 + extMemAcc_61 + extMemAcc_62 + extMemAcc_63 + extMemAcc_64 + extMemAcc_65 + extMemAcc_67 + extMemAcc_68 + extMemAcc_69 + extMemAcc_70 + extMemAcc_71 + extMemAcc_72 + extMemAcc_73 + extMemAcc_74 + extMemAcc_75 + extMemAcc_76 + extMemAcc_78 + extMemAcc_79 + extMemAcc_80 + extMemAcc_81 + extMemAcc_82 + extMemAcc_83 + extMemAcc_84 + extMemAcc_85 + extMemAcc_86 + extMemAcc_87 + extMemAcc_89 + extMemAcc_90 + extMemAcc_91 + extMemAcc_92 + extMemAcc_93 + extMemAcc_94 + extMemAcc_95 + extMemAcc_96 + extMemAcc_97 + extMemAcc_98 + extBus_0 = 1
inv : memory_2 + extMemAcc_2 + extMemAcc_12 + extMemAcc_32 + extMemAcc_42 + extMemAcc_52 + extMemAcc_62 + extMemAcc_72 + extMemAcc_82 + extMemAcc_92 = 1
inv : ownMemAcc_3 + queue_3 + active_3 + extMemAcc_30 + extMemAcc_31 + extMemAcc_32 + extMemAcc_34 + extMemAcc_35 + extMemAcc_36 + extMemAcc_37 + extMemAcc_38 + extMemAcc_39 = 1
Total of 21 invariants.
[2020-05-19 15:23:26] [INFO ] Computed 21 place invariants in 6 ms
[2020-05-19 15:23:26] [INFO ] Removed a total of 419 redundant transitions.
[2020-05-19 15:23:26] [INFO ] Proved 131 variables to be positive in 584 ms
[2020-05-19 15:23:26] [INFO ] Computing symmetric may disable matrix : 210 transitions.
[2020-05-19 15:23:26] [INFO ] Computation of disable matrix completed :0/210 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 15:23:26] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 15:23:26] [INFO ] Computing symmetric may enable matrix : 210 transitions.
[2020-05-19 15:23:26] [INFO ] Computation of Complete enable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 15:23:27] [INFO ] Flatten gal took : 790 ms
[2020-05-19 15:23:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2020-05-19 15:23:27] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-19 15:23:27] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 9 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 : !((!(X(G(!(X((F(X("((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)<=(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu3.extMemAcc_1+gu3.extMemAcc_2)+gu3.extMemAcc_3)+gu3.extMemAcc_4)+gu3.extMemAcc_5)+gu3.extMemAcc_6)+gu3.extMemAcc_7)+gu3.extMemAcc_8)+gu3.extMemAcc_9)+gu3.extMemAcc_10)+gu3.extMemAcc_12)+gu3.extMemAcc_13)+gu3.extMemAcc_14)+gu3.extMemAcc_15)+gu3.extMemAcc_16)+gu3.extMemAcc_17)+gu3.extMemAcc_18)+gu3.extMemAcc_19)+gu3.extMemAcc_20)+gu3.extMemAcc_21)+gu3.extMemAcc_23)+gu3.extMemAcc_24)+gu3.extMemAcc_25)+gu3.extMemAcc_26)+gu3.extMemAcc_27)+gu3.extMemAcc_28)+gu3.extMemAcc_29)+gu3.extMemAcc_30)+gu3.extMemAcc_31)+gu3.extMemAcc_32)+gu3.extMemAcc_34)+gu3.extMemAcc_35)+gu3.extMemAcc_36)+gu3.extMemAcc_37)+gu3.extMemAcc_38)+gu3.extMemAcc_39)+gu3.extMemAcc_40)+gu3.extMemAcc_41)+gu3.extMemAcc_42)+gu3.extMemAcc_43)+gu3.extMemAcc_45)+gu3.extMemAcc_46)+gu3.extMemAcc_47)+gu3.extMemAcc_48)+gu3.extMemAcc_49)+gu3.extMemAcc_50)+gu3.extMemAcc_51)+gu3.extMemAcc_52)+gu3.extMemAcc_53)+gu3.extMemAcc_54)+gu3.extMemAcc_56)+gu3.extMemAcc_57)+gu3.extMemAcc_58)+gu3.extMemAcc_59)+gu3.extMemAcc_60)+gu3.extMemAcc_61)+gu3.extMemAcc_62)+gu3.extMemAcc_63)+gu3.extMemAcc_64)+gu3.extMemAcc_65)+gu3.extMemAcc_67)+gu3.extMemAcc_68)+gu3.extMemAcc_69)+gu3.extMemAcc_70)+gu3.extMemAcc_71)+gu3.extMemAcc_72)+gu3.extMemAcc_73)+gu3.extMemAcc_74)+gu3.extMemAcc_75)+gu3.extMemAcc_76)+gu3.extMemAcc_78)+gu3.extMemAcc_79)+gu3.extMemAcc_80)+gu3.extMemAcc_81)+gu3.extMemAcc_82)+gu3.extMemAcc_83)+gu3.extMemAcc_84)+gu3.extMemAcc_85)+gu3.extMemAcc_86)+gu3.extMemAcc_87)+gu3.extMemAcc_89)+gu3.extMemAcc_90)+gu3.extMemAcc_91)+gu3.extMemAcc_92)+gu3.extMemAcc_93)+gu3.extMemAcc_94)+gu3.extMemAcc_95)+gu3.extMemAcc_96)+gu3.extMemAcc_97)+gu3.extMemAcc_98))")))||(X(F("(gi1.gu2.extBus_0<=(((((((((gi1.gu1.queue_0+gi1.gu1.queue_1)+gi1.gu1.queue_2)+gi1.gu1.queue_3)+gi1.gu1.queue_4)+gi1.gu1.queue_5)+gi1.gu1.queue_6)+gi1.gu1.queue_7)+gi1.gu1.queue_8)+gi1.gu1.queue_9))"))))))))))
Formula 0 simplified : XG!X(FX"((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)<=(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu3.extMemAcc_1+gu3.extMemAcc_2)+gu3.extMemAcc_3)+gu3.extMemAcc_4)+gu3.extMemAcc_5)+gu3.extMemAcc_6)+gu3.extMemAcc_7)+gu3.extMemAcc_8)+gu3.extMemAcc_9)+gu3.extMemAcc_10)+gu3.extMemAcc_12)+gu3.extMemAcc_13)+gu3.extMemAcc_14)+gu3.extMemAcc_15)+gu3.extMemAcc_16)+gu3.extMemAcc_17)+gu3.extMemAcc_18)+gu3.extMemAcc_19)+gu3.extMemAcc_20)+gu3.extMemAcc_21)+gu3.extMemAcc_23)+gu3.extMemAcc_24)+gu3.extMemAcc_25)+gu3.extMemAcc_26)+gu3.extMemAcc_27)+gu3.extMemAcc_28)+gu3.extMemAcc_29)+gu3.extMemAcc_30)+gu3.extMemAcc_31)+gu3.extMemAcc_32)+gu3.extMemAcc_34)+gu3.extMemAcc_35)+gu3.extMemAcc_36)+gu3.extMemAcc_37)+gu3.extMemAcc_38)+gu3.extMemAcc_39)+gu3.extMemAcc_40)+gu3.extMemAcc_41)+gu3.extMemAcc_42)+gu3.extMemAcc_43)+gu3.extMemAcc_45)+gu3.extMemAcc_46)+gu3.extMemAcc_47)+gu3.extMemAcc_48)+gu3.extMemAcc_49)+gu3.extMemAcc_50)+gu3.extMemAcc_51)+gu3.extMemAcc_52)+gu3.extMemAcc_53)+gu3.extMemAcc_54)+gu3.extMemAcc_56)+gu3.extMemAcc_57)+gu3.extMemAcc_58)+gu3.extMemAcc_59)+gu3.extMemAcc_60)+gu3.extMemAcc_61)+gu3.extMemAcc_62)+gu3.extMemAcc_63)+gu3.extMemAcc_64)+gu3.extMemAcc_65)+gu3.extMemAcc_67)+gu3.extMemAcc_68)+gu3.extMemAcc_69)+gu3.extMemAcc_70)+gu3.extMemAcc_71)+gu3.extMemAcc_72)+gu3.extMemAcc_73)+gu3.extMemAcc_74)+gu3.extMemAcc_75)+gu3.extMemAcc_76)+gu3.extMemAcc_78)+gu3.extMemAcc_79)+gu3.extMemAcc_80)+gu3.extMemAcc_81)+gu3.extMemAcc_82)+gu3.extMemAcc_83)+gu3.extMemAcc_84)+gu3.extMemAcc_85)+gu3.extMemAcc_86)+gu3.extMemAcc_87)+gu3.extMemAcc_89)+gu3.extMemAcc_90)+gu3.extMemAcc_91)+gu3.extMemAcc_92)+gu3.extMemAcc_93)+gu3.extMemAcc_94)+gu3.extMemAcc_95)+gu3.extMemAcc_96)+gu3.extMemAcc_97)+gu3.extMemAcc_98))" | XF"(gi1.gu2.extBus_0<=(((((((((gi1.gu1.queue_0+gi1.gu1.queue_1)+gi1.gu1.queue_2)+gi1.gu1.queue_3)+gi1.gu1.queue_4)+gi1.gu1.queue_5)+gi1.gu1.queue_6)+gi1.gu1.queue_7)+gi1.gu1.queue_8)+gi1.gu1.queue_9))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
119 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.21704,66436,1,0,29,234440,24,8,4558,63757,56
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SharedMemory-COL-000010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(!(G("((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)<2)")))))
Formula 1 simplified : !X!G"((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)<2)"
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,1.21824,66820,1,0,29,234440,33,8,4578,63757,60
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000010-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(!(F(X((G("((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)<=gi1.gu2.extBus_0)"))U(X("((((((((((gi1.gu1.queue_0+gi1.gu1.queue_1)+gi1.gu1.queue_2)+gi1.gu1.queue_3)+gi1.gu1.queue_4)+gi1.gu1.queue_5)+gi1.gu1.queue_6)+gi1.gu1.queue_7)+gi1.gu1.queue_8)+gi1.gu1.queue_9)<=(((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9))"))))))))
Formula 2 simplified : !G!FX(G"((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)<=gi1.gu2.extBus_0)" U X"((((((((((gi1.gu1.queue_0+gi1.gu1.queue_1)+gi1.gu1.queue_2)+gi1.gu1.queue_3)+gi1.gu1.queue_4)+gi1.gu1.queue_5)+gi1.gu1.queue_6)+gi1.gu1.queue_7)+gi1.gu1.queue_8)+gi1.gu1.queue_9)<=(((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
29 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.51342,78708,1,0,29,238741,45,8,4993,75333,75
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SharedMemory-COL-000010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(F(X("((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)<=gi1.gu2.extBus_0)")))))
Formula 3 simplified : FX"((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)<=gi1.gu2.extBus_0)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
189 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.3998,131884,1,0,43,363424,51,18,5202,251004,133
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SharedMemory-COL-000010-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F(G("((((((((((gi1.gu1.queue_0+gi1.gu1.queue_1)+gi1.gu1.queue_2)+gi1.gu1.queue_3)+gi1.gu1.queue_4)+gi1.gu1.queue_5)+gi1.gu1.queue_6)+gi1.gu1.queue_7)+gi1.gu1.queue_8)+gi1.gu1.queue_9)<=gi1.gu2.extBus_0)")))))
Formula 4 simplified : !GFG"((((((((((gi1.gu1.queue_0+gi1.gu1.queue_1)+gi1.gu1.queue_2)+gi1.gu1.queue_3)+gi1.gu1.queue_4)+gi1.gu1.queue_5)+gi1.gu1.queue_6)+gi1.gu1.queue_7)+gi1.gu1.queue_8)+gi1.gu1.queue_9)<=gi1.gu2.extBus_0)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
373 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,7.12707,218088,1,0,97,598212,64,54,5403,710359,286
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SharedMemory-COL-000010-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(X(X("((((((((((gu0.ownMemAcc_0+gu0.ownMemAcc_1)+gu0.ownMemAcc_2)+gu0.ownMemAcc_3)+gu0.ownMemAcc_4)+gu0.ownMemAcc_5)+gu0.ownMemAcc_6)+gu0.ownMemAcc_7)+gu0.ownMemAcc_8)+gu0.ownMemAcc_9)>=1)"))))U("((gi1.gu2.extBus_0<=(((((((((gu0.ownMemAcc_0+gu0.ownMemAcc_1)+gu0.ownMemAcc_2)+gu0.ownMemAcc_3)+gu0.ownMemAcc_4)+gu0.ownMemAcc_5)+gu0.ownMemAcc_6)+gu0.ownMemAcc_7)+gu0.ownMemAcc_8)+gu0.ownMemAcc_9))&&((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)>=0))")))
Formula 5 simplified : !(GXX"((((((((((gu0.ownMemAcc_0+gu0.ownMemAcc_1)+gu0.ownMemAcc_2)+gu0.ownMemAcc_3)+gu0.ownMemAcc_4)+gu0.ownMemAcc_5)+gu0.ownMemAcc_6)+gu0.ownMemAcc_7)+gu0.ownMemAcc_8)+gu0.ownMemAcc_9)>=1)" U "((gi1.gu2.extBus_0<=(((((((((gu0.ownMemAcc_0+gu0.ownMemAcc_1)+gu0.ownMemAcc_2)+gu0.ownMemAcc_3)+gu0.ownMemAcc_4)+gu0.ownMemAcc_5)+gu0.ownMemAcc_6)+gu0.ownMemAcc_7)+gu0.ownMemAcc_8)+gu0.ownMemAcc_9))&&((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)>=0))")
16 unique states visited
15 strongly connected components in search stack
17 transitions explored
15 items max in DFS search stack
182 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,8.9487,273708,1,0,147,721555,72,74,5545,909010,427
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SharedMemory-COL-000010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(("((((((((((gu0.ownMemAcc_0+gu0.ownMemAcc_1)+gu0.ownMemAcc_2)+gu0.ownMemAcc_3)+gu0.ownMemAcc_4)+gu0.ownMemAcc_5)+gu0.ownMemAcc_6)+gu0.ownMemAcc_7)+gu0.ownMemAcc_8)+gu0.ownMemAcc_9)>=2)")U(F("((((((((((gi1.gu1.queue_0+gi1.gu1.queue_1)+gi1.gu1.queue_2)+gi1.gu1.queue_3)+gi1.gu1.queue_4)+gi1.gu1.queue_5)+gi1.gu1.queue_6)+gi1.gu1.queue_7)+gi1.gu1.queue_8)+gi1.gu1.queue_9)>gi1.gu2.extBus_0)")))))
Formula 6 simplified : "((((((((((gu0.ownMemAcc_0+gu0.ownMemAcc_1)+gu0.ownMemAcc_2)+gu0.ownMemAcc_3)+gu0.ownMemAcc_4)+gu0.ownMemAcc_5)+gu0.ownMemAcc_6)+gu0.ownMemAcc_7)+gu0.ownMemAcc_8)+gu0.ownMemAcc_9)>=2)" U F"((((((((((gi1.gu1.queue_0+gi1.gu1.queue_1)+gi1.gu1.queue_2)+gi1.gu1.queue_3)+gi1.gu1.queue_4)+gi1.gu1.queue_5)+gi1.gu1.queue_6)+gi1.gu1.queue_7)+gi1.gu1.queue_8)+gi1.gu1.queue_9)>gi1.gu2.extBus_0)"
3 unique states visited
3 strongly connected components in search stack
3 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,8.97772,274472,1,0,147,721558,72,74,5545,909020,430
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SharedMemory-COL-000010-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F(!(X(("((((((((((gu0.memory_0+gu0.memory_1)+gu0.memory_2)+gu0.memory_3)+gu0.memory_4)+gu0.memory_5)+gu0.memory_6)+gu0.memory_7)+gu0.memory_8)+gu0.memory_9)<=(((((((((gu0.ownMemAcc_0+gu0.ownMemAcc_1)+gu0.ownMemAcc_2)+gu0.ownMemAcc_3)+gu0.ownMemAcc_4)+gu0.ownMemAcc_5)+gu0.ownMemAcc_6)+gu0.ownMemAcc_7)+gu0.ownMemAcc_8)+gu0.ownMemAcc_9))")U(F(X(G("((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)<=gi1.gu2.extBus_0)"))))))))||(("((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)<=gi1.gu2.extBus_0)")U("((((((((((gu0.memory_0+gu0.memory_1)+gu0.memory_2)+gu0.memory_3)+gu0.memory_4)+gu0.memory_5)+gu0.memory_6)+gu0.memory_7)+gu0.memory_8)+gu0.memory_9)<=(((((((((gu0.ownMemAcc_0+gu0.ownMemAcc_1)+gu0.ownMemAcc_2)+gu0.ownMemAcc_3)+gu0.ownMemAcc_4)+gu0.ownMemAcc_5)+gu0.ownMemAcc_6)+gu0.ownMemAcc_7)+gu0.ownMemAcc_8)+gu0.ownMemAcc_9))"))))
Formula 7 simplified : !(F!X("((((((((((gu0.memory_0+gu0.memory_1)+gu0.memory_2)+gu0.memory_3)+gu0.memory_4)+gu0.memory_5)+gu0.memory_6)+gu0.memory_7)+gu0.memory_8)+gu0.memory_9)<=(((((((((gu0.ownMemAcc_0+gu0.ownMemAcc_1)+gu0.ownMemAcc_2)+gu0.ownMemAcc_3)+gu0.ownMemAcc_4)+gu0.ownMemAcc_5)+gu0.ownMemAcc_6)+gu0.ownMemAcc_7)+gu0.ownMemAcc_8)+gu0.ownMemAcc_9))" U FXG"((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)<=gi1.gu2.extBus_0)") | ("((((((((((gi1.gu2.active_0+gi1.gu2.active_1)+gi1.gu2.active_2)+gi1.gu2.active_3)+gi1.gu2.active_4)+gi1.gu2.active_5)+gi1.gu2.active_6)+gi1.gu2.active_7)+gi1.gu2.active_8)+gi1.gu2.active_9)<=gi1.gu2.extBus_0)" U "((((((((((gu0.memory_0+gu0.memory_1)+gu0.memory_2)+gu0.memory_3)+gu0.memory_4)+gu0.memory_5)+gu0.memory_6)+gu0.memory_7)+gu0.memory_8)+gu0.memory_9)<=(((((((((gu0.ownMemAcc_0+gu0.ownMemAcc_1)+gu0.ownMemAcc_2)+gu0.ownMemAcc_3)+gu0.ownMemAcc_4)+gu0.ownMemAcc_5)+gu0.ownMemAcc_6)+gu0.ownMemAcc_7)+gu0.ownMemAcc_8)+gu0.ownMemAcc_9))"))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.08837,276676,1,0,149,736650,88,76,5570,953679,450
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SharedMemory-COL-000010-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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-19 15:23:38] [INFO ] Built C files in 12260ms 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 1589901820508

--------------------
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="SharedMemory-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 SharedMemory-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 r156-oct2-158972914100441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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