fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r170-smll-158987815600271
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for FlexibleBarrier-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.190 3600000.00 59890.00 393.50 TFTTTTFTTTTTTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815600271.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is FlexibleBarrier-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815600271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 3.4K Apr 4 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 4 06:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 06:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 3 20:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 20:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 3 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 3 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 69K Mar 24 05:37 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 FlexibleBarrier-PT-04b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591333562772

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 05:06:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 05:06:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 05:06:05] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2020-06-05 05:06:05] [INFO ] Transformed 268 places.
[2020-06-05 05:06:05] [INFO ] Transformed 305 transitions.
[2020-06-05 05:06:05] [INFO ] Found NUPN structural information;
[2020-06-05 05:06:05] [INFO ] Parsed PT model containing 268 places and 305 transitions in 181 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 237 resets, run finished after 111 ms. (steps per millisecond=90 ) properties seen :[1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0]
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 1, 0, 0, 0]
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 305 rows 268 cols
[2020-06-05 05:06:06] [INFO ] Computed 6 place invariants in 17 ms
[2020-06-05 05:06:06] [INFO ] [Real]Absence check using 6 positive place invariants in 28 ms returned sat
[2020-06-05 05:06:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:06] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2020-06-05 05:06:06] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 43 ms.
[2020-06-05 05:06:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:06:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2102 ms returned sat
[2020-06-05 05:06:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:09] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2020-06-05 05:06:09] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 28 ms.
[2020-06-05 05:06:12] [INFO ] Added : 300 causal constraints over 60 iterations in 2534 ms. Result :unknown
[2020-06-05 05:06:12] [INFO ] [Real]Absence check using 6 positive place invariants in 21 ms returned sat
[2020-06-05 05:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:12] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2020-06-05 05:06:12] [INFO ] Deduced a trap composed of 16 places in 186 ms
[2020-06-05 05:06:12] [INFO ] Deduced a trap composed of 80 places in 97 ms
[2020-06-05 05:06:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2020-06-05 05:06:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:06:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 742 ms returned sat
[2020-06-05 05:06:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:14] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2020-06-05 05:06:14] [INFO ] Deduced a trap composed of 16 places in 117 ms
[2020-06-05 05:06:14] [INFO ] Deduced a trap composed of 80 places in 108 ms
[2020-06-05 05:06:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2020-06-05 05:06:14] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 38 ms.
[2020-06-05 05:06:17] [INFO ] Added : 304 causal constraints over 61 iterations in 2808 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
[2020-06-05 05:06:17] [INFO ] [Real]Absence check using 6 positive place invariants in 24 ms returned sat
[2020-06-05 05:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:17] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2020-06-05 05:06:17] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 49 ms.
[2020-06-05 05:06:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:06:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 753 ms returned sat
[2020-06-05 05:06:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:19] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2020-06-05 05:06:19] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 50 ms.
[2020-06-05 05:06:21] [INFO ] Added : 293 causal constraints over 59 iterations in 2589 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-05 05:06:22] [INFO ] [Real]Absence check using 6 positive place invariants in 25 ms returned sat
[2020-06-05 05:06:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:22] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2020-06-05 05:06:22] [INFO ] Deduced a trap composed of 49 places in 251 ms
[2020-06-05 05:06:22] [INFO ] Deduced a trap composed of 78 places in 182 ms
[2020-06-05 05:06:23] [INFO ] Deduced a trap composed of 78 places in 196 ms
[2020-06-05 05:06:23] [INFO ] Deduced a trap composed of 100 places in 168 ms
[2020-06-05 05:06:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 923 ms
[2020-06-05 05:06:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:06:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 183 ms returned sat
[2020-06-05 05:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:24] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2020-06-05 05:06:24] [INFO ] Deduced a trap composed of 49 places in 234 ms
[2020-06-05 05:06:24] [INFO ] Deduced a trap composed of 105 places in 176 ms
[2020-06-05 05:06:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 474 ms
[2020-06-05 05:06:24] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 50 ms.
[2020-06-05 05:06:27] [INFO ] Added : 295 causal constraints over 59 iterations in 2614 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-05 05:06:27] [INFO ] [Real]Absence check using 6 positive place invariants in 23 ms returned unsat
[2020-06-05 05:06:27] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2020-06-05 05:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:27] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2020-06-05 05:06:28] [INFO ] Deduced a trap composed of 34 places in 258 ms
[2020-06-05 05:06:28] [INFO ] Deduced a trap composed of 77 places in 245 ms
[2020-06-05 05:06:28] [INFO ] Deduced a trap composed of 58 places in 200 ms
[2020-06-05 05:06:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 797 ms
[2020-06-05 05:06:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:06:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2481 ms returned sat
[2020-06-05 05:06:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:31] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2020-06-05 05:06:31] [INFO ] Deduced a trap composed of 34 places in 318 ms
[2020-06-05 05:06:32] [INFO ] Deduced a trap composed of 91 places in 248 ms
[2020-06-05 05:06:32] [INFO ] Deduced a trap composed of 40 places in 186 ms
[2020-06-05 05:06:32] [INFO ] Deduced a trap composed of 100 places in 199 ms
[2020-06-05 05:06:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1054 ms
[2020-06-05 05:06:32] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 29 ms.
[2020-06-05 05:06:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t179 0) (and (> t178 0) (< o178 o179)))") while checking expression at index 5
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 35000 steps, including 745 resets, run finished after 267 ms. (steps per millisecond=131 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 36800 steps, including 808 resets, run finished after 177 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 40800 steps, including 774 resets, run finished after 202 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 49000 steps, including 743 resets, run finished after 212 ms. (steps per millisecond=231 ) properties seen :[0, 0, 1, 0, 1] could not realise parikh vector
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 19 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 305/305 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 268 transition count 241
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 204 transition count 241
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 128 place count 204 transition count 219
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 172 place count 182 transition count 219
Symmetric choice reduction at 2 with 56 rule applications. Total rules 228 place count 182 transition count 219
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 56 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 340 place count 126 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 340 place count 126 transition count 161
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 344 place count 124 transition count 161
Symmetric choice reduction at 2 with 4 rule applications. Total rules 348 place count 124 transition count 161
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 356 place count 120 transition count 157
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 360 place count 120 transition count 153
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 424 place count 88 transition count 121
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 436 place count 82 transition count 129
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 443 place count 82 transition count 122
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 450 place count 75 transition count 122
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 453 place count 75 transition count 122
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 457 place count 75 transition count 118
Applied a total of 457 rules in 139 ms. Remains 75 /268 variables (removed 193) and now considering 118/305 (removed 187) transitions.
Finished structural reductions, in 1 iterations. Remains : 75/268 places, 118/305 transitions.
Incomplete random walk after 1000000 steps, including 40862 resets, run finished after 2216 ms. (steps per millisecond=451 ) properties seen :[0, 1, 1]
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3607 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties seen :[0]
[2020-06-05 05:06:37] [INFO ] Flow matrix only has 115 transitions (discarded 3 similar events)
// Phase 1: matrix 115 rows 75 cols
[2020-06-05 05:06:37] [INFO ] Computed 6 place invariants in 2 ms
[2020-06-05 05:06:37] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-06-05 05:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:37] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-06-05 05:06:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-05 05:06:37] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:06:37] [INFO ] Computed and/alt/rep : 116/469/113 causal constraints in 18 ms.
[2020-06-05 05:06:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:06:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2020-06-05 05:06:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:37] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-06-05 05:06:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:06:37] [INFO ] Computed and/alt/rep : 116/469/113 causal constraints in 11 ms.
[2020-06-05 05:06:38] [INFO ] Added : 113 causal constraints over 23 iterations in 328 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 13000 steps, including 459 resets, run finished after 50 ms. (steps per millisecond=260 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 118/118 transitions.
Graph (trivial) has 30 edges and 75 vertex of which 6 / 75 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 72 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 71 transition count 111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 71 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 67 transition count 107
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 67 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 29 place count 63 transition count 103
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 63 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 62 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 56 transition count 96
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 56 transition count 96
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 4 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 53 place count 53 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 53 transition count 89
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 53 transition count 86
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 50 transition count 86
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 73 place count 50 transition count 75
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 78 place count 50 transition count 70
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 83 place count 45 transition count 70
Symmetric choice reduction at 5 with 3 rule applications. Total rules 86 place count 45 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 92 place count 42 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 95 place count 42 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 96 place count 41 transition count 63
Applied a total of 96 rules in 46 ms. Remains 41 /75 variables (removed 34) and now considering 63/118 (removed 55) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/75 places, 63/118 transitions.
Finished random walk after 874448 steps, including 22892 resets, run visited all 1 properties in 1542 ms. (steps per millisecond=567 )
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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="FlexibleBarrier-PT-04b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is FlexibleBarrier-PT-04b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-158987815600271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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