About the Execution of ITS-LoLa for CloudDeployment-PT-5b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.720 | 3600000.00 | 130338.00 | 643.20 | FFFFFTFFTFFTTTFT | 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.r168-smll-158987806600327.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 CloudDeployment-PT-5b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806600327
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 3.9K Mar 30 01:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 01:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 07:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 26 07:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 CloudDeployment-PT-5b-ReachabilityFireability-00
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-01
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-02
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-03
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-04
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-05
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-06
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-07
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-08
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-09
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-10
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-11
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-12
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-13
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-14
FORMULA_NAME CloudDeployment-PT-5b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1591296295682
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 18:44:58] [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-04 18:44:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 18:44:58] [INFO ] Load time of PNML (sax parser for PT used): 422 ms
[2020-06-04 18:44:58] [INFO ] Transformed 1525 places.
[2020-06-04 18:44:58] [INFO ] Transformed 3132 transitions.
[2020-06-04 18:44:58] [INFO ] Found NUPN structural information;
[2020-06-04 18:44:58] [INFO ] Parsed PT model containing 1525 places and 3132 transitions in 537 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 105 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 60 resets, run finished after 151 ms. (steps per millisecond=66 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 72 ms. (steps per millisecond=138 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 3132 rows 1525 cols
[2020-06-04 18:44:59] [INFO ] Computed 21 place invariants in 169 ms
[2020-06-04 18:45:00] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 111 ms returned sat
[2020-06-04 18:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:01] [INFO ] [Real]Absence check using state equation in 860 ms returned unsat
[2020-06-04 18:45:01] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 97 ms returned sat
[2020-06-04 18:45:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:06] [INFO ] [Real]Absence check using state equation in 4469 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 18:45:06] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 151 ms returned sat
[2020-06-04 18:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 18:45:11] [INFO ] [Real]Absence check using state equation in 4456 ms returned (error "Failed to check-sat")
[2020-06-04 18:45:11] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 116 ms returned sat
[2020-06-04 18:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:13] [INFO ] [Real]Absence check using state equation in 2289 ms returned unsat
[2020-06-04 18:45:14] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 92 ms returned sat
[2020-06-04 18:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:14] [INFO ] [Real]Absence check using state equation in 648 ms returned unsat
[2020-06-04 18:45:15] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 149 ms returned sat
[2020-06-04 18:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:16] [INFO ] [Real]Absence check using state equation in 946 ms returned unsat
[2020-06-04 18:45:16] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 91 ms returned sat
[2020-06-04 18:45:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:21] [INFO ] [Real]Absence check using state equation in 4619 ms returned (error "Failed to check-sat")
[2020-06-04 18:45:22] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 99 ms returned sat
[2020-06-04 18:45:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:24] [INFO ] [Real]Absence check using state equation in 2253 ms returned unsat
[2020-06-04 18:45:24] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 109 ms returned sat
[2020-06-04 18:45:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:25] [INFO ] [Real]Absence check using state equation in 786 ms returned unsat
[2020-06-04 18:45:25] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 146 ms returned sat
[2020-06-04 18:45:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:28] [INFO ] [Real]Absence check using state equation in 2394 ms returned unsat
[2020-06-04 18:45:28] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 96 ms returned sat
[2020-06-04 18:45:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 18:45:33] [INFO ] [Real]Absence check using state equation in 4552 ms returned (error "Failed to check-sat")
[2020-06-04 18:45:33] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 91 ms returned sat
[2020-06-04 18:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 18:45:38] [INFO ] [Real]Absence check using state equation in 4603 ms returned unknown
[2020-06-04 18:45:38] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 94 ms returned sat
[2020-06-04 18:45:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 18:45:43] [INFO ] [Real]Absence check using state equation in 4573 ms returned (error "Failed to check-sat")
[2020-06-04 18:45:43] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 153 ms returned sat
[2020-06-04 18:45:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 18:45:48] [INFO ] [Real]Absence check using state equation in 4480 ms returned (error "Failed to check-sat")
[2020-06-04 18:45:48] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 90 ms returned sat
[2020-06-04 18:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:45:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 18:45:53] [INFO ] [Real]Absence check using state equation in 4590 ms returned (error "Failed to check-sat")
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 47 out of 1525 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1525/1525 places, 3132/3132 transitions.
Graph (trivial) has 1479 edges and 1525 vertex of which 378 / 1525 are part of one of the 36 SCC in 14 ms
Free SCC test removed 342 places
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 3308 edges and 1183 vertex of which 1173 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.25 ms
Drop transitions removed 424 transitions
Reduce isomorphic transitions removed 424 transitions.
Performed 560 Post agglomeration using F-continuation condition.Transition count delta: 560
Iterating post reduction 0 with 984 rules applied. Total rules applied 986 place count 1173 transition count 2143
Reduce places removed 560 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 562 rules applied. Total rules applied 1548 place count 613 transition count 2141
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 1548 place count 613 transition count 2119
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 1592 place count 591 transition count 2119
Symmetric choice reduction at 2 with 232 rule applications. Total rules 1824 place count 591 transition count 2119
Deduced a syphon composed of 232 places in 3 ms
Reduce places removed 232 places and 232 transitions.
Iterating global reduction 2 with 464 rules applied. Total rules applied 2288 place count 359 transition count 1887
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 2308 place count 359 transition count 1867
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 2308 place count 359 transition count 1850
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2342 place count 342 transition count 1850
Symmetric choice reduction at 3 with 3 rule applications. Total rules 2345 place count 342 transition count 1850
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2351 place count 339 transition count 1847
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2353 place count 339 transition count 1847
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2357 place count 337 transition count 1845
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2358 place count 337 transition count 1845
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2360 place count 336 transition count 1844
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 2518 place count 257 transition count 1765
Performed 35 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 35 places in 8 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 2588 place count 222 transition count 1949
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2593 place count 222 transition count 1944
Free-agglomeration rule applied 40 times with reduction of 11 identical transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 2633 place count 222 transition count 1893
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 4 with 116 rules applied. Total rules applied 2749 place count 182 transition count 1817
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 2752 place count 182 transition count 1817
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 2758 place count 182 transition count 1817
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2762 place count 182 transition count 1813
Drop transitions removed 126 transitions
Redundant transition composition rules discarded 126 transitions
Iterating global reduction 6 with 126 rules applied. Total rules applied 2888 place count 182 transition count 1687
Applied a total of 2888 rules in 806 ms. Remains 182 /1525 variables (removed 1343) and now considering 1687/3132 (removed 1445) transitions.
Finished structural reductions, in 1 iterations. Remains : 182/1525 places, 1687/3132 transitions.
Incomplete random walk after 1000000 steps, including 19764 resets, run finished after 8062 ms. (steps per millisecond=124 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1]
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 1572 resets, run finished after 1148 ms. (steps per millisecond=871 ) properties seen :[0]
[2020-06-04 18:46:03] [INFO ] Flow matrix only has 1485 transitions (discarded 202 similar events)
// Phase 1: matrix 1485 rows 182 cols
[2020-06-04 18:46:03] [INFO ] Computed 21 place invariants in 38 ms
[2020-06-04 18:46:03] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 18:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:46:04] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2020-06-04 18:46:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 18:46:04] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 35 ms returned sat
[2020-06-04 18:46:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 18:46:05] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2020-06-04 18:46:05] [INFO ] State equation strengthened by 241 read => feed constraints.
[2020-06-04 18:46:05] [INFO ] [Nat]Added 241 Read/Feed constraints in 86 ms returned sat
[2020-06-04 18:46:05] [INFO ] Computed and/alt/rep : 1686/29193/1484 causal constraints in 471 ms.
[2020-06-04 18:46:09] [INFO ] Added : 183 causal constraints over 37 iterations in 4400 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
Incomplete Parikh walk after 23900 steps, including 399 resets, run finished after 311 ms. (steps per millisecond=76 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 182/182 places, 1687/1687 transitions.
Graph (trivial) has 95 edges and 182 vertex of which 9 / 182 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Discarding 28 places :
Also discarding 1024 output transitions
Drop transitions removed 1024 transitions
Graph (complete) has 1324 edges and 177 vertex of which 149 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.14 ms
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 149 transition count 632
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 39 place count 143 transition count 632
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 39 place count 143 transition count 631
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 142 transition count 631
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 142 transition count 630
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 142 transition count 630
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 141 transition count 629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 141 transition count 628
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 68 place count 130 transition count 617
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 70 place count 130 transition count 615
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 72 place count 129 transition count 615
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 73 place count 129 transition count 614
Free-agglomeration rule applied 15 times with reduction of 2 identical transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 88 place count 129 transition count 597
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 6 with 85 rules applied. Total rules applied 173 place count 114 transition count 527
Drop transitions removed 106 transitions
Redundant transition composition rules discarded 106 transitions
Iterating global reduction 7 with 106 rules applied. Total rules applied 279 place count 114 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 280 place count 113 transition count 420
Applied a total of 280 rules in 147 ms. Remains 113 /182 variables (removed 69) and now considering 420/1687 (removed 1267) transitions.
Finished structural reductions, in 1 iterations. Remains : 113/182 places, 420/1687 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2581 ms. (steps per millisecond=387 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1769 ms. (steps per millisecond=565 ) properties seen :[0]
Finished probabilistic random walk after 11880068 steps, run visited all 1 properties in 25671 ms. (steps per millisecond=462 )
Probabilistic random walk after 11880068 steps, saw 1181623 distinct states, run finished after 25672 ms. (steps per millisecond=462 ) properties seen :[1]
FORMULA CloudDeployment-PT-5b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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="CloudDeployment-PT-5b"
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 CloudDeployment-PT-5b, 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 r168-smll-158987806600327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-5b.tgz
mv CloudDeployment-PT-5b 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 '
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 ;