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

About the Execution of ITS-Tools for ASLink-PT-02a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.000 87881.00 105615.00 511.40 FFTTFFFTTFFFFFFF 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.r006-smll-158897515500032.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 itstools
Input is ASLink-PT-02a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-smll-158897515500032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 3.4K Mar 25 09:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 09:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 09:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 8 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 09:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 09:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 09:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 25 09:04 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 279K 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 ASLink-PT-02a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589215972629

[2020-05-11 16:52:55] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-11 16:52:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 16:52:55] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2020-05-11 16:52:55] [INFO ] Transformed 626 places.
[2020-05-11 16:52:55] [INFO ] Transformed 1008 transitions.
[2020-05-11 16:52:55] [INFO ] Found NUPN structural information;
[2020-05-11 16:52:55] [INFO ] Parsed PT model containing 626 places and 1008 transitions in 266 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 111 resets, run finished after 186 ms. (steps per millisecond=53 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-02a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA ASLink-PT-02a-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 998 rows 626 cols
[2020-05-11 16:52:56] [INFO ] Computed 118 place invariants in 81 ms
[2020-05-11 16:52:56] [INFO ] [Real]Absence check using 28 positive place invariants in 92 ms returned sat
[2020-05-11 16:52:57] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 117 ms returned unsat
[2020-05-11 16:52:57] [INFO ] [Real]Absence check using 28 positive place invariants in 47 ms returned sat
[2020-05-11 16:52:57] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 51 ms returned unsat
[2020-05-11 16:52:57] [INFO ] [Real]Absence check using 28 positive place invariants in 38 ms returned sat
[2020-05-11 16:52:57] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 69 ms returned sat
[2020-05-11 16:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 16:52:59] [INFO ] [Real]Absence check using state equation in 1975 ms returned sat
[2020-05-11 16:52:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 16:52:59] [INFO ] [Nat]Absence check using 28 positive place invariants in 63 ms returned sat
[2020-05-11 16:52:59] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 73 ms returned sat
[2020-05-11 16:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 16:53:01] [INFO ] [Nat]Absence check using state equation in 1662 ms returned unsat
[2020-05-11 16:53:01] [INFO ] [Real]Absence check using 28 positive place invariants in 59 ms returned sat
[2020-05-11 16:53:01] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 101 ms returned sat
[2020-05-11 16:53:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 16:53:03] [INFO ] [Real]Absence check using state equation in 1871 ms returned sat
[2020-05-11 16:53:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 16:53:04] [INFO ] [Nat]Absence check using 28 positive place invariants in 86 ms returned sat
[2020-05-11 16:53:04] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 100 ms returned sat
[2020-05-11 16:53:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 16:53:06] [INFO ] [Nat]Absence check using state equation in 2823 ms returned unsat
[2020-05-11 16:53:07] [INFO ] [Real]Absence check using 28 positive place invariants in 58 ms returned sat
[2020-05-11 16:53:07] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 62 ms returned sat
[2020-05-11 16:53:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 16:53:09] [INFO ] [Real]Absence check using state equation in 1821 ms returned sat
[2020-05-11 16:53:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 16:53:09] [INFO ] [Nat]Absence check using 28 positive place invariants in 84 ms returned sat
[2020-05-11 16:53:09] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 101 ms returned sat
[2020-05-11 16:53:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 16:53:11] [INFO ] [Nat]Absence check using state equation in 2462 ms returned unsat
[2020-05-11 16:53:12] [INFO ] [Real]Absence check using 28 positive place invariants in 48 ms returned sat
[2020-05-11 16:53:12] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 81 ms returned sat
[2020-05-11 16:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 16:53:14] [INFO ] [Real]Absence check using state equation in 2296 ms returned sat
[2020-05-11 16:53:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 16:53:14] [INFO ] [Nat]Absence check using 28 positive place invariants in 62 ms returned sat
[2020-05-11 16:53:14] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 69 ms returned sat
[2020-05-11 16:53:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 16:53:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-11 16:53:19] [INFO ] [Nat]Absence check using state equation in 4735 ms returned unknown
[2020-05-11 16:53:19] [INFO ] [Real]Absence check using 28 positive place invariants in 66 ms returned sat
[2020-05-11 16:53:20] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 103 ms returned sat
[2020-05-11 16:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 16:53:22] [INFO ] [Real]Absence check using state equation in 2531 ms returned sat
[2020-05-11 16:53:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 16:53:22] [INFO ] [Nat]Absence check using 28 positive place invariants in 64 ms returned sat
[2020-05-11 16:53:22] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 79 ms returned sat
[2020-05-11 16:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 16:53:25] [INFO ] [Nat]Absence check using state equation in 2198 ms returned unsat
[2020-05-11 16:53:25] [INFO ] [Real]Absence check using 28 positive place invariants in 39 ms returned sat
[2020-05-11 16:53:25] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 66 ms returned sat
[2020-05-11 16:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 16:53:27] [INFO ] [Real]Absence check using state equation in 1796 ms returned sat
[2020-05-11 16:53:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 16:53:27] [INFO ] [Nat]Absence check using 28 positive place invariants in 83 ms returned sat
[2020-05-11 16:53:27] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 95 ms returned sat
[2020-05-11 16:53:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 16:53:29] [INFO ] [Nat]Absence check using state equation in 2171 ms returned unsat
[2020-05-11 16:53:29] [INFO ] [Real]Absence check using 28 positive place invariants in 36 ms returned sat
[2020-05-11 16:53:30] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 86 ms returned sat
[2020-05-11 16:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 16:53:31] [INFO ] [Real]Absence check using state equation in 1805 ms returned sat
[2020-05-11 16:53:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 16:53:32] [INFO ] [Nat]Absence check using 28 positive place invariants in 82 ms returned sat
[2020-05-11 16:53:32] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 102 ms returned sat
[2020-05-11 16:53:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 16:53:33] [INFO ] [Nat]Absence check using state equation in 1527 ms returned unsat
[2020-05-11 16:53:34] [INFO ] [Real]Absence check using 28 positive place invariants in 60 ms returned sat
[2020-05-11 16:53:34] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 121 ms returned unsat
[2020-05-11 16:53:34] [INFO ] [Real]Absence check using 28 positive place invariants in 59 ms returned sat
[2020-05-11 16:53:34] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 104 ms returned unsat
[2020-05-11 16:53:34] [INFO ] [Real]Absence check using 28 positive place invariants in 62 ms returned sat
[2020-05-11 16:53:34] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 62 ms returned unsat
FORMULA ASLink-PT-02a-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 614 transition count 947
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 114 place count 563 transition count 947
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 114 place count 563 transition count 898
Deduced a syphon composed of 49 places in 9 ms
Ensure Unique test removed 19 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 231 place count 495 transition count 898
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 495 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 494 transition count 897
Symmetric choice reduction at 4 with 5 rule applications. Total rules 238 place count 494 transition count 897
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 23 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 248 place count 489 transition count 874
Ensure Unique test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 7 rules applied. Total rules applied 255 place count 487 transition count 869
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 258 place count 484 transition count 869
Symmetric choice reduction at 6 with 1 rule applications. Total rules 259 place count 484 transition count 869
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 483 transition count 861
Symmetric choice reduction at 6 with 1 rule applications. Total rules 262 place count 483 transition count 861
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 264 place count 482 transition count 853
Symmetric choice reduction at 6 with 1 rule applications. Total rules 265 place count 482 transition count 853
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 267 place count 481 transition count 845
Symmetric choice reduction at 6 with 1 rule applications. Total rules 268 place count 481 transition count 845
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 270 place count 480 transition count 837
Symmetric choice reduction at 6 with 1 rule applications. Total rules 271 place count 480 transition count 837
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 273 place count 479 transition count 829
Symmetric choice reduction at 6 with 1 rule applications. Total rules 274 place count 479 transition count 829
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 276 place count 478 transition count 821
Symmetric choice reduction at 6 with 1 rule applications. Total rules 277 place count 478 transition count 821
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 279 place count 477 transition count 813
Symmetric choice reduction at 6 with 1 rule applications. Total rules 280 place count 477 transition count 813
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 282 place count 476 transition count 805
Symmetric choice reduction at 6 with 1 rule applications. Total rules 283 place count 476 transition count 805
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 285 place count 475 transition count 797
Symmetric choice reduction at 6 with 1 rule applications. Total rules 286 place count 475 transition count 797
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 288 place count 474 transition count 789
Symmetric choice reduction at 6 with 1 rule applications. Total rules 289 place count 474 transition count 789
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 291 place count 473 transition count 781
Symmetric choice reduction at 6 with 1 rule applications. Total rules 292 place count 473 transition count 781
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 294 place count 472 transition count 773
Symmetric choice reduction at 6 with 1 rule applications. Total rules 295 place count 472 transition count 773
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 297 place count 471 transition count 765
Symmetric choice reduction at 6 with 1 rule applications. Total rules 298 place count 471 transition count 765
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 300 place count 470 transition count 757
Symmetric choice reduction at 6 with 1 rule applications. Total rules 301 place count 470 transition count 757
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 303 place count 469 transition count 749
Symmetric choice reduction at 6 with 1 rule applications. Total rules 304 place count 469 transition count 749
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 306 place count 468 transition count 741
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 334 place count 454 transition count 727
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 335 place count 454 transition count 726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 336 place count 453 transition count 726
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 339 place count 453 transition count 726
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 341 place count 453 transition count 726
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 342 place count 452 transition count 725
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 346 place count 448 transition count 725
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 346 place count 448 transition count 719
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 13 rules applied. Total rules applied 359 place count 441 transition count 719
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 362 place count 438 transition count 719
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 362 place count 438 transition count 718
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 364 place count 437 transition count 718
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 9 with 10 rules applied. Total rules applied 374 place count 432 transition count 713
Symmetric choice reduction at 9 with 2 rule applications. Total rules 376 place count 432 transition count 713
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 380 place count 430 transition count 711
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 382 place count 430 transition count 709
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 384 place count 428 transition count 709
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 386 place count 428 transition count 709
Applied a total of 386 rules in 908 ms. Remains 428 /626 variables (removed 198) and now considering 709/998 (removed 289) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/626 places, 709/998 transitions.
Incomplete random walk after 1000000 steps, including 16350 resets, run finished after 3063 ms. (steps per millisecond=326 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 5580 resets, run finished after 1385 ms. (steps per millisecond=722 ) properties seen :[0]
Interrupted probabilistic random walk after 4555593 steps, run timeout after 30001 ms. (steps per millisecond=151 ) properties seen :[0]
Probabilistic random walk after 4555593 steps, saw 1377138 distinct states, run finished after 30001 ms. (steps per millisecond=151 ) properties seen :[0]
// Phase 1: matrix 709 rows 428 cols
[2020-05-11 16:54:10] [INFO ] Computed 77 place invariants in 30 ms
[2020-05-11 16:54:10] [INFO ] [Real]Absence check using 18 positive place invariants in 24 ms returned sat
[2020-05-11 16:54:10] [INFO ] [Real]Absence check using 18 positive and 59 generalized place invariants in 38 ms returned sat
[2020-05-11 16:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 16:54:11] [INFO ] [Real]Absence check using state equation in 935 ms returned sat
[2020-05-11 16:54:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 16:54:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 26 ms returned sat
[2020-05-11 16:54:11] [INFO ] [Nat]Absence check using 18 positive and 59 generalized place invariants in 48 ms returned sat
[2020-05-11 16:54:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 16:54:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-11 16:54:19] [INFO ] [Nat]Absence check using state equation in 7729 ms returned unsat
FORMULA ASLink-PT-02a-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

BK_STOP 1589216060510

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="ASLink-PT-02a"
export BK_EXAMINATION="ReachabilityFireability"
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 ASLink-PT-02a, 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 r006-smll-158897515500032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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 ;