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

About the Execution of ITS-Tools for LamportFastMutEx-COL-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15728.720 318396.00 840008.00 298.00 TFFFFTFTTTFTFFTT 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.r096-oct2-158940145300614.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 LamportFastMutEx-COL-5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145300614
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.3K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 41K Apr 30 13:04 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 LamportFastMutEx-COL-5-ReachabilityCardinality-00
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-01
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-02
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-03
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-04
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-05
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-06
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-07
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-08
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-09
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589590921502

[2020-05-16 01:02:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-16 01:02:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 01:02:04] [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-16 01:02:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 642 ms
[2020-05-16 01:02:05] [INFO ] sort/places :
pid * pid->wait,done,
pid * bool->b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

[2020-05-16 01:02:05] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 97 ms.
[2020-05-16 01:02:05] [INFO ] Computed order based on color domains.
[2020-05-16 01:02:05] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions in 35 ms.
[2020-05-16 01:02:05] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 37 places in 8 ms
Reduce places removed 37 places and 58 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 97 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0]
[2020-05-16 01:02:05] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-05-16 01:02:05] [INFO ] Computed 37 place invariants in 12 ms
[2020-05-16 01:02:05] [INFO ] [Real]Absence check using 37 positive place invariants in 40 ms returned sat
[2020-05-16 01:02:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:02:06] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2020-05-16 01:02:06] [INFO ] State equation strengthened by 65 read => feed constraints.
[2020-05-16 01:02:06] [INFO ] [Real]Added 65 Read/Feed constraints in 25 ms returned sat
[2020-05-16 01:02:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:02:06] [INFO ] [Nat]Absence check using 37 positive place invariants in 31 ms returned sat
[2020-05-16 01:02:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:02:06] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2020-05-16 01:02:06] [INFO ] [Nat]Added 65 Read/Feed constraints in 35 ms returned sat
[2020-05-16 01:02:06] [INFO ] Deduced a trap composed of 30 places in 307 ms
[2020-05-16 01:02:07] [INFO ] Deduced a trap composed of 29 places in 177 ms
[2020-05-16 01:02:07] [INFO ] Deduced a trap composed of 48 places in 115 ms
[2020-05-16 01:02:07] [INFO ] Deduced a trap composed of 37 places in 99 ms
[2020-05-16 01:02:07] [INFO ] Deduced a trap composed of 38 places in 143 ms
[2020-05-16 01:02:07] [INFO ] Deduced a trap composed of 36 places in 104 ms
[2020-05-16 01:02:07] [INFO ] Deduced a trap composed of 35 places in 114 ms
[2020-05-16 01:02:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1187 ms
[2020-05-16 01:02:07] [INFO ] Computed and/alt/rep : 255/1495/195 causal constraints in 18 ms.
[2020-05-16 01:02:08] [INFO ] Added : 165 causal constraints over 34 iterations in 879 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-05-16 01:02:08] [INFO ] [Real]Absence check using 37 positive place invariants in 41 ms returned sat
[2020-05-16 01:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:02:08] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2020-05-16 01:02:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:02:08] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2020-05-16 01:02:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:02:09] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-05-16 01:02:09] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2020-05-16 01:02:09] [INFO ] Deduced a trap composed of 18 places in 100 ms
[2020-05-16 01:02:09] [INFO ] Deduced a trap composed of 9 places in 210 ms
[2020-05-16 01:02:09] [INFO ] Deduced a trap composed of 9 places in 90 ms
[2020-05-16 01:02:09] [INFO ] Deduced a trap composed of 9 places in 23 ms
[2020-05-16 01:02:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 506 ms
[2020-05-16 01:02:09] [INFO ] Computed and/alt/rep : 255/1495/195 causal constraints in 42 ms.
[2020-05-16 01:02:10] [INFO ] Added : 151 causal constraints over 31 iterations in 637 ms. Result :sat
[2020-05-16 01:02:10] [INFO ] Deduced a trap composed of 14 places in 54 ms
[2020-05-16 01:02:10] [INFO ] Deduced a trap composed of 16 places in 161 ms
[2020-05-16 01:02:10] [INFO ] Deduced a trap composed of 14 places in 62 ms
[2020-05-16 01:02:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 373 ms
Attempting to minimize the solution found.
Minimization took 22 ms.
Incomplete Parikh walk after 33700 steps, including 961 resets, run finished after 145 ms. (steps per millisecond=232 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 47700 steps, including 999 resets, run finished after 83 ms. (steps per millisecond=574 ) properties seen :[0, 0] could not realise parikh vector
Support contains 35 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 56 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1317 ms. (steps per millisecond=759 ) properties seen :[0, 1]
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 671 ms. (steps per millisecond=1490 ) properties seen :[0]
[2020-05-16 01:02:12] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-05-16 01:02:12] [INFO ] Computed 37 place invariants in 3 ms
[2020-05-16 01:02:12] [INFO ] [Real]Absence check using 37 positive place invariants in 33 ms returned sat
[2020-05-16 01:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:02:13] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-05-16 01:02:13] [INFO ] State equation strengthened by 65 read => feed constraints.
[2020-05-16 01:02:13] [INFO ] [Real]Added 65 Read/Feed constraints in 20 ms returned sat
[2020-05-16 01:02:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:02:13] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2020-05-16 01:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:02:13] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2020-05-16 01:02:13] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:02:13] [INFO ] Deduced a trap composed of 30 places in 100 ms
[2020-05-16 01:02:13] [INFO ] Deduced a trap composed of 29 places in 54 ms
[2020-05-16 01:02:13] [INFO ] Deduced a trap composed of 48 places in 100 ms
[2020-05-16 01:02:13] [INFO ] Deduced a trap composed of 37 places in 68 ms
[2020-05-16 01:02:13] [INFO ] Deduced a trap composed of 38 places in 76 ms
[2020-05-16 01:02:13] [INFO ] Deduced a trap composed of 36 places in 76 ms
[2020-05-16 01:02:13] [INFO ] Deduced a trap composed of 35 places in 55 ms
[2020-05-16 01:02:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 654 ms
[2020-05-16 01:02:13] [INFO ] Computed and/alt/rep : 255/1495/195 causal constraints in 19 ms.
[2020-05-16 01:02:14] [INFO ] Added : 165 causal constraints over 34 iterations in 759 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 47700 steps, including 998 resets, run finished after 71 ms. (steps per millisecond=671 ) properties seen :[0] could not realise parikh vector
Support contains 15 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 15 place count 132 transition count 250
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 20 place count 127 transition count 250
Applied a total of 20 rules in 37 ms. Remains 127 /137 variables (removed 10) and now considering 250/260 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/137 places, 250/260 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1206 ms. (steps per millisecond=829 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 566 ms. (steps per millisecond=1766 ) properties seen :[0]
Interrupted probabilistic random walk after 22358317 steps, run timeout after 30001 ms. (steps per millisecond=745 ) properties seen :[0]
Probabilistic random walk after 22358317 steps, saw 3924921 distinct states, run finished after 30004 ms. (steps per millisecond=745 ) properties seen :[0]
[2020-05-16 01:02:46] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2020-05-16 01:02:46] [INFO ] Computed 37 place invariants in 5 ms
[2020-05-16 01:02:46] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2020-05-16 01:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:02:46] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2020-05-16 01:02:46] [INFO ] State equation strengthened by 65 read => feed constraints.
[2020-05-16 01:02:46] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2020-05-16 01:02:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:02:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2020-05-16 01:02:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:02:46] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2020-05-16 01:02:46] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:02:46] [INFO ] Deduced a trap composed of 9 places in 53 ms
[2020-05-16 01:02:47] [INFO ] Deduced a trap composed of 7 places in 102 ms
[2020-05-16 01:02:47] [INFO ] Deduced a trap composed of 30 places in 44 ms
[2020-05-16 01:02:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 233 ms
[2020-05-16 01:02:47] [INFO ] Computed and/alt/rep : 245/1685/185 causal constraints in 23 ms.
[2020-05-16 01:02:47] [INFO ] Added : 118 causal constraints over 24 iterations in 438 ms. Result :sat
[2020-05-16 01:02:47] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2020-05-16 01:02:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 24200 steps, including 887 resets, run finished after 39 ms. (steps per millisecond=620 ) properties seen :[0] could not realise parikh vector
Support contains 15 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 13 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 250/250 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2020-05-16 01:02:47] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2020-05-16 01:02:47] [INFO ] Computed 37 place invariants in 0 ms
[2020-05-16 01:02:47] [INFO ] Implicit Places using invariants in 121 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 123 ms to find 5 implicit places.
[2020-05-16 01:02:47] [INFO ] Redundant transitions in 7 ms returned []
[2020-05-16 01:02:47] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:02:47] [INFO ] Computed 32 place invariants in 0 ms
[2020-05-16 01:02:48] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Starting structural reductions, iteration 1 : 122/127 places, 250/250 transitions.
Applied a total of 0 rules in 14 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2020-05-16 01:02:48] [INFO ] Redundant transitions in 2 ms returned []
[2020-05-16 01:02:48] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:02:48] [INFO ] Computed 32 place invariants in 1 ms
[2020-05-16 01:02:48] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/127 places, 250/250 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1300 ms. (steps per millisecond=769 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 583 ms. (steps per millisecond=1715 ) properties seen :[0]
Interrupted probabilistic random walk after 21683155 steps, run timeout after 30001 ms. (steps per millisecond=722 ) properties seen :[0]
Probabilistic random walk after 21683155 steps, saw 3814049 distinct states, run finished after 30006 ms. (steps per millisecond=722 ) properties seen :[0]
[2020-05-16 01:03:20] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:03:20] [INFO ] Computed 32 place invariants in 1 ms
[2020-05-16 01:03:20] [INFO ] [Real]Absence check using 32 positive place invariants in 10 ms returned sat
[2020-05-16 01:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:03:20] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-05-16 01:03:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2020-05-16 01:03:20] [INFO ] [Real]Added 40 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:03:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:03:20] [INFO ] [Nat]Absence check using 32 positive place invariants in 15 ms returned sat
[2020-05-16 01:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:03:20] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-05-16 01:03:20] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2020-05-16 01:03:20] [INFO ] Deduced a trap composed of 7 places in 78 ms
[2020-05-16 01:03:20] [INFO ] Deduced a trap composed of 29 places in 60 ms
[2020-05-16 01:03:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2020-05-16 01:03:20] [INFO ] Computed and/alt/rep : 245/1575/185 causal constraints in 9 ms.
[2020-05-16 01:03:21] [INFO ] Added : 157 causal constraints over 32 iterations in 765 ms. Result :sat
[2020-05-16 01:03:21] [INFO ] Deduced a trap composed of 7 places in 56 ms
[2020-05-16 01:03:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
Incomplete Parikh walk after 36900 steps, including 974 resets, run finished after 71 ms. (steps per millisecond=519 ) properties seen :[0] could not realise parikh vector
Support contains 15 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2020-05-16 01:03:21] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:03:21] [INFO ] Computed 32 place invariants in 1 ms
[2020-05-16 01:03:21] [INFO ] Implicit Places using invariants in 103 ms returned []
[2020-05-16 01:03:21] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:03:21] [INFO ] Computed 32 place invariants in 2 ms
[2020-05-16 01:03:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2020-05-16 01:03:22] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2020-05-16 01:03:22] [INFO ] Redundant transitions in 2 ms returned []
[2020-05-16 01:03:22] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:03:22] [INFO ] Computed 32 place invariants in 1 ms
[2020-05-16 01:03:22] [INFO ] Dead Transitions using invariants and state equation in 237 ms returned []
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 110 ms. (steps per millisecond=909 ) properties seen :[0]
[2020-05-16 01:03:22] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:03:22] [INFO ] Computed 32 place invariants in 2 ms
[2020-05-16 01:03:22] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2020-05-16 01:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:03:22] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2020-05-16 01:03:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2020-05-16 01:03:22] [INFO ] [Real]Added 40 Read/Feed constraints in 10 ms returned sat
[2020-05-16 01:03:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:03:22] [INFO ] [Nat]Absence check using 32 positive place invariants in 15 ms returned sat
[2020-05-16 01:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:03:23] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2020-05-16 01:03:23] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2020-05-16 01:03:23] [INFO ] Deduced a trap composed of 7 places in 43 ms
[2020-05-16 01:03:23] [INFO ] Deduced a trap composed of 29 places in 64 ms
[2020-05-16 01:03:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2020-05-16 01:03:23] [INFO ] Computed and/alt/rep : 245/1575/185 causal constraints in 15 ms.
[2020-05-16 01:03:23] [INFO ] Added : 157 causal constraints over 32 iterations in 635 ms. Result :sat
[2020-05-16 01:03:23] [INFO ] Deduced a trap composed of 7 places in 17 ms
[2020-05-16 01:03:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 122 transition count 190
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 60 place count 122 transition count 165
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 1 with 70 rules applied. Total rules applied 130 place count 77 transition count 165
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 140 place count 72 transition count 160
Symmetric choice reduction at 1 with 5 rule applications. Total rules 145 place count 72 transition count 160
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 10 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 155 place count 67 transition count 150
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 160 place count 67 transition count 150
Applied a total of 160 rules in 29 ms. Remains 67 /122 variables (removed 55) and now considering 150/250 (removed 100) transitions.
// Phase 1: matrix 150 rows 67 cols
[2020-05-16 01:03:24] [INFO ] Computed 12 place invariants in 1 ms
[2020-05-16 01:03:24] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-05-16 01:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:03:24] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-05-16 01:03:24] [INFO ] Computed and/alt/rep : 140/730/140 causal constraints in 11 ms.
[2020-05-16 01:03:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:03:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 34 ms returned sat
[2020-05-16 01:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:03:24] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2020-05-16 01:03:24] [INFO ] Computed and/alt/rep : 140/730/140 causal constraints in 9 ms.
[2020-05-16 01:03:24] [INFO ] Added : 107 causal constraints over 22 iterations in 360 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2020-05-16 01:03:24] [INFO ] Flatten gal took : 107 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-16 01:03:24] [INFO ] Applying decomposition
[2020-05-16 01:03:24] [INFO ] Flatten gal took : 48 ms
[2020-05-16 01:03:25] [INFO ] Flatten gal took : 36 ms
[2020-05-16 01:03:25] [INFO ] Input system was already deterministic with 250 transitions.
[2020-05-16 01:03:25] [INFO ] Input system was already deterministic with 250 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/graph14760202653305167259.txt, -o, /tmp/graph14760202653305167259.bin, -w, /tmp/graph14760202653305167259.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/graph14760202653305167259.bin, -l, -1, -v, -w, /tmp/graph14760202653305167259.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 01:03:25] [INFO ] Ran tautology test, simplified 0 / 1 in 227 ms.
[2020-05-16 01:03:25] [INFO ] Decomposing Gal with order
[2020-05-16 01:03:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 01:03:25] [INFO ] BMC solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(UNSAT) depth K=0 took 55 ms
[2020-05-16 01:03:25] [INFO ] BMC solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(UNSAT) depth K=1 took 24 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:03:25] [INFO ] Computed 32 place invariants in 1 ms
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + wait_25 + done_25 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : b_10 + b_11 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + wait_11 + done_11 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + wait_15 + done_15 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + wait_21 + done_21 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : y_0 + y_1 + y_2 + y_3 + y_4 + y_5 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + wait_19 + done_19 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + wait_31 + done_31 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + wait_32 + done_32 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : b_4 + b_5 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + wait_9 + done_9 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + wait_23 + done_23 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + wait_8 + done_8 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + wait_14 + done_14 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + wait_27 + done_27 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + wait_33 + done_33 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + wait_17 + done_17 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + wait_10 + done_10 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + wait_29 + done_29 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + wait_28 + done_28 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + wait_35 + done_35 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + wait_34 + done_34 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : b_8 + b_9 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + wait_22 + done_22 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + wait_16 + done_16 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + wait_20 + done_20 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : b_2 + b_3 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + wait_26 + done_26 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + wait_7 + done_7 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + wait_13 + done_13 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : b_6 + b_7 = 1
inv : x_0 + x_1 + x_2 + x_3 + x_4 + x_5 = 1
Total of 32 invariants.
[2020-05-16 01:03:25] [INFO ] Computed 32 place invariants in 4 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:03:25] [INFO ] Computed 32 place invariants in 0 ms
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + wait_25 + done_25 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : b_10 + b_11 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + wait_11 + done_11 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + wait_15 + done_15 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + wait_21 + done_21 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : y_0 + y_1 + y_2 + y_3 + y_4 + y_5 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + wait_19 + done_19 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + wait_31 + done_31 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + wait_32 + done_32 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : b_4 + b_5 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + wait_9 + done_9 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + wait_23 + done_23 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + wait_8 + done_8 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + wait_14 + done_14 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + wait_27 + done_27 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + wait_33 + done_33 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + wait_17 + done_17 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + wait_10 + done_10 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + wait_29 + done_29 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + wait_28 + done_28 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + wait_35 + done_35 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + wait_34 + done_34 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : b_8 + b_9 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + wait_22 + done_22 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + wait_16 + done_16 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + wait_20 + done_20 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : b_2 + b_3 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + wait_26 + done_26 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + wait_7 + done_7 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + wait_13 + done_13 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : b_6 + b_7 = 1
inv : x_0 + x_1 + x_2 + x_3 + x_4 + x_5 = 1
Total of 32 invariants.
[2020-05-16 01:03:25] [INFO ] Computed 32 place invariants in 1 ms
[2020-05-16 01:03:25] [INFO ] Removed a total of 352 redundant transitions.
[2020-05-16 01:03:25] [INFO ] BMC solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(UNSAT) depth K=2 took 74 ms
[2020-05-16 01:03:25] [INFO ] Flatten gal took : 198 ms
[2020-05-16 01:03:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 29 ms.
[2020-05-16 01:03:25] [INFO ] BMC solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(UNSAT) depth K=3 took 190 ms
[2020-05-16 01:03:25] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 3 ms
[2020-05-16 01:03:25] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : LamportFastMutEx-COL-5-ReachabilityCardinality-02 with value :((((((gu18.P_CS_21_1+gu18.P_CS_21_2)+gu18.P_CS_21_3)+gu18.P_CS_21_4)+gu18.P_CS_21_5)>=3)&&(((((gu11.P_setbi_11_1+gu11.P_setbi_11_2)+gu11.P_setbi_11_3)+gu11.P_setbi_11_4)+gu11.P_setbi_11_5)<=((((gu11.P_ify0_4_1+gu11.P_ify0_4_2)+gu11.P_ify0_4_3)+gu11.P_ify0_4_4)+gu11.P_ify0_4_5)))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
[2020-05-16 01:03:26] [INFO ] Proved 122 variables to be positive in 784 ms
[2020-05-16 01:03:26] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2020-05-16 01:03:26] [INFO ] Computation of disable matrix completed :0/250 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation, new max is 2048
[2020-05-16 01:03:26] [INFO ] Proved 122 variables to be positive in 744 ms
[2020-05-16 01:03:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-5-ReachabilityCardinality-02
[2020-05-16 01:03:26] [INFO ] Computation of Complete disable matrix. took 65 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 01:03:26] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2020-05-16 01:03:26] [INFO ] KInduction solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(SAT) depth K=0 took 54 ms
[2020-05-16 01:03:26] [INFO ] Computation of Complete enable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 01:03:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-5-ReachabilityCardinality-02
[2020-05-16 01:03:26] [INFO ] KInduction solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(SAT) depth K=1 took 17 ms
[2020-05-16 01:03:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-5-ReachabilityCardinality-02
[2020-05-16 01:03:26] [INFO ] KInduction solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(SAT) depth K=2 took 209 ms
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
[2020-05-16 01:03:28] [INFO ] Computing symmetric co enabling matrix : 250 transitions.
SDD proceeding with computation, new max is 16384
[2020-05-16 01:03:29] [INFO ] Computation of co-enabling matrix(4/250) took 1683 ms. Total solver calls (SAT/UNSAT): 265(20/245)
[2020-05-16 01:03:31] [INFO ] BMC solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(UNSAT) depth K=4 took 5746 ms
[2020-05-16 01:03:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-5-ReachabilityCardinality-02
[2020-05-16 01:03:31] [INFO ] KInduction solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(SAT) depth K=3 took 5292 ms
[2020-05-16 01:03:33] [INFO ] Computation of co-enabling matrix(12/250) took 5329 ms. Total solver calls (SAT/UNSAT): 807(44/763)
SDD proceeding with computation, new max is 32768
[2020-05-16 01:03:36] [INFO ] Computation of co-enabling matrix(16/250) took 8522 ms. Total solver calls (SAT/UNSAT): 1169(75/1094)
[2020-05-16 01:03:39] [INFO ] Computation of co-enabling matrix(39/250) took 11577 ms. Total solver calls (SAT/UNSAT): 2940(200/2740)
SDD proceeding with computation, new max is 65536
[2020-05-16 01:03:43] [INFO ] Computation of co-enabling matrix(47/250) took 15381 ms. Total solver calls (SAT/UNSAT): 4040(325/3715)
[2020-05-16 01:03:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-5-ReachabilityCardinality-02
[2020-05-16 01:03:46] [INFO ] KInduction solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(SAT) depth K=4 took 14824 ms
[2020-05-16 01:03:46] [INFO ] Computation of co-enabling matrix(56/250) took 18689 ms. Total solver calls (SAT/UNSAT): 5201(451/4750)
[2020-05-16 01:03:48] [INFO ] BMC solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(UNSAT) depth K=5 took 17087 ms
[2020-05-16 01:03:50] [INFO ] Computation of co-enabling matrix(62/250) took 22137 ms. Total solver calls (SAT/UNSAT): 5930(526/5404)
[2020-05-16 01:03:53] [INFO ] Computation of co-enabling matrix(74/250) took 25165 ms. Total solver calls (SAT/UNSAT): 6560(570/5990)
[2020-05-16 01:03:56] [INFO ] Computation of co-enabling matrix(82/250) took 28353 ms. Total solver calls (SAT/UNSAT): 7444(705/6739)
[2020-05-16 01:03:59] [INFO ] Computation of co-enabling matrix(91/250) took 31677 ms. Total solver calls (SAT/UNSAT): 8362(813/7549)
[2020-05-16 01:04:03] [INFO ] Computation of co-enabling matrix(98/250) took 34837 ms. Total solver calls (SAT/UNSAT): 9020(888/8132)
[2020-05-16 01:04:06] [INFO ] Computation of co-enabling matrix(106/250) took 37877 ms. Total solver calls (SAT/UNSAT): 9712(964/8748)
SDD proceeding with computation, new max is 131072
[2020-05-16 01:04:09] [INFO ] Computation of co-enabling matrix(115/250) took 41001 ms. Total solver calls (SAT/UNSAT): 10390(1034/9356)
[2020-05-16 01:04:12] [INFO ] Computation of co-enabling matrix(133/250) took 44021 ms. Total solver calls (SAT/UNSAT): 11119(1077/10042)
[2020-05-16 01:04:15] [INFO ] Computation of co-enabling matrix(165/250) took 47056 ms. Total solver calls (SAT/UNSAT): 11865(1180/10685)
[2020-05-16 01:04:18] [INFO ] Computation of co-enabling matrix(181/250) took 50133 ms. Total solver calls (SAT/UNSAT): 12625(1270/11355)
[2020-05-16 01:04:21] [INFO ] Computation of co-enabling matrix(197/250) took 53165 ms. Total solver calls (SAT/UNSAT): 13321(1352/11969)
[2020-05-16 01:04:23] [INFO ] BMC solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(UNSAT) depth K=6 took 34738 ms
[2020-05-16 01:04:23] [INFO ] Computation of Finished co-enabling matrix. took 55615 ms. Total solver calls (SAT/UNSAT): 13975(1420/12555)
[2020-05-16 01:04:23] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2020-05-16 01:04:23] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 01:04:23] [INFO ] Built C files in 58830ms 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]
Compilation finished in 3902 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 115 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, LamportFastMutExCOL5ReachabilityCardinality02==true], 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, -p, --pins-guards, --when, -i, LamportFastMutExCOL5ReachabilityCardinality02==true], 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, -p, --pins-guards, --when, -i, LamportFastMutExCOL5ReachabilityCardinality02==true], 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)
[2020-05-16 01:04:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-5-ReachabilityCardinality-02
[2020-05-16 01:04:30] [INFO ] KInduction solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(SAT) depth K=5 took 44067 ms
SDD proceeding with computation, new max is 262144
[2020-05-16 01:05:17] [INFO ] BMC solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(UNSAT) depth K=7 took 54551 ms
[2020-05-16 01:05:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-5-ReachabilityCardinality-02
[2020-05-16 01:05:23] [INFO ] KInduction solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(SAT) depth K=6 took 52678 ms
[2020-05-16 01:06:36] [INFO ] BMC solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(UNSAT) depth K=8 took 78530 ms
[2020-05-16 01:07:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-5-ReachabilityCardinality-02
[2020-05-16 01:07:06] [INFO ] KInduction solution for property LamportFastMutEx-COL-5-ReachabilityCardinality-02(SAT) depth K=7 took 102889 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,4.35093e+08,231.598,3524404,2,574297,24,1.43586e+07,7,0,776,1.55784e+07,0
Total reachable state count : 435092592

Verifying 1 reachability properties.
Reachability property LamportFastMutEx-COL-5-ReachabilityCardinality-02 does not hold.
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : LamportFastMutEx-COL-5-ReachabilityCardinality-02

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-5-ReachabilityCardinality-02,0,232.43,3524404,1,0,24,1.43586e+07,7,0,808,1.55784e+07,0
[2020-05-16 01:07:19] [WARNING] Interrupting SMT solver.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-16 01:07:19] [WARNING] Unexpected error occurred while running SMT. Was verifying LamportFastMutEx-COL-5-ReachabilityCardinality-02 SMT depth 9
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-16 01:07:19] [INFO ] During BMC, SMT solver timed out at depth 9
[2020-05-16 01:07:19] [INFO ] BMC solving timed out (3600000 secs) at depth 9
[2020-05-16 01:07:19] [WARNING] Unexpected error occurred while running SMT. Was verifying LamportFastMutEx-COL-5-ReachabilityCardinality-02 K-induction depth 8
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
[2020-05-16 01:07:19] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.

BK_STOP 1589591239898

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="LamportFastMutEx-COL-5"
export BK_EXAMINATION="ReachabilityCardinality"
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 LamportFastMutEx-COL-5, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-oct2-158940145300614"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;