fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r006-tajo-165245688800102
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ASLink-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2541.699 3600000.00 13551235.00 111.70 TFTTTF?TFTFTTF?F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245688800102.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245688800102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.4K Apr 30 07:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 07:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 07:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 07:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 30 07:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Apr 30 07:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 07:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 30 07:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 921K May 10 09:33 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-06b-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654264842603

Running Version 202205111006
[2022-06-03 14:00:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 14:00:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:00:44] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2022-06-03 14:00:44] [INFO ] Transformed 2826 places.
[2022-06-03 14:00:44] [INFO ] Transformed 3513 transitions.
[2022-06-03 14:00:44] [INFO ] Found NUPN structural information;
[2022-06-03 14:00:44] [INFO ] Parsed PT model containing 2826 places and 3513 transitions in 328 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-06b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 18 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 15) seen :5
FORMULA ASLink-PT-06b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 3513 rows 2826 cols
[2022-06-03 14:00:45] [INFO ] Computed 277 place invariants in 200 ms
[2022-06-03 14:00:46] [INFO ] After 978ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-03 14:00:47] [INFO ] [Nat]Absence check using 65 positive place invariants in 35 ms returned sat
[2022-06-03 14:00:47] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 130 ms returned sat
[2022-06-03 14:01:11] [INFO ] After 23492ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2022-06-03 14:01:11] [INFO ] After 23514ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-03 14:01:11] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
FORMULA ASLink-PT-06b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06b-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06b-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 29783 ms.
Support contains 70 out of 2826 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Drop transitions removed 612 transitions
Trivial Post-agglo rules discarded 612 transitions
Performed 612 trivial Post agglomeration. Transition count delta: 612
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 2826 transition count 2901
Reduce places removed 612 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 640 rules applied. Total rules applied 1252 place count 2214 transition count 2873
Reduce places removed 7 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 22 rules applied. Total rules applied 1274 place count 2207 transition count 2858
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 1289 place count 2192 transition count 2858
Performed 633 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 633 Pre rules applied. Total rules applied 1289 place count 2192 transition count 2225
Deduced a syphon composed of 633 places in 5 ms
Ensure Unique test removed 57 places
Reduce places removed 690 places and 0 transitions.
Iterating global reduction 4 with 1323 rules applied. Total rules applied 2612 place count 1502 transition count 2225
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 42 rules applied. Total rules applied 2654 place count 1494 transition count 2191
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 36 rules applied. Total rules applied 2690 place count 1460 transition count 2189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2692 place count 1458 transition count 2189
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2692 place count 1458 transition count 2169
Deduced a syphon composed of 20 places in 4 ms
Ensure Unique test removed 19 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 59 rules applied. Total rules applied 2751 place count 1419 transition count 2169
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 2751 place count 1419 transition count 2150
Deduced a syphon composed of 19 places in 11 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2789 place count 1400 transition count 2150
Discarding 79 places :
Symmetric choice reduction at 7 with 79 rule applications. Total rules 2868 place count 1321 transition count 2071
Iterating global reduction 7 with 79 rules applied. Total rules applied 2947 place count 1321 transition count 2071
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2948 place count 1321 transition count 2070
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 24 Pre rules applied. Total rules applied 2948 place count 1321 transition count 2046
Deduced a syphon composed of 24 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 8 with 49 rules applied. Total rules applied 2997 place count 1296 transition count 2046
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2997 place count 1296 transition count 2045
Deduced a syphon composed of 1 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 3000 place count 1294 transition count 2045
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 3005 place count 1289 transition count 2012
Iterating global reduction 8 with 5 rules applied. Total rules applied 3010 place count 1289 transition count 2012
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 3010 place count 1289 transition count 2009
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 3016 place count 1286 transition count 2009
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3017 place count 1285 transition count 2001
Iterating global reduction 8 with 1 rules applied. Total rules applied 3018 place count 1285 transition count 2001
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3019 place count 1284 transition count 1993
Iterating global reduction 8 with 1 rules applied. Total rules applied 3020 place count 1284 transition count 1993
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3021 place count 1283 transition count 1985
Iterating global reduction 8 with 1 rules applied. Total rules applied 3022 place count 1283 transition count 1985
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3023 place count 1282 transition count 1977
Iterating global reduction 8 with 1 rules applied. Total rules applied 3024 place count 1282 transition count 1977
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3025 place count 1281 transition count 1969
Iterating global reduction 8 with 1 rules applied. Total rules applied 3026 place count 1281 transition count 1969
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3027 place count 1280 transition count 1961
Iterating global reduction 8 with 1 rules applied. Total rules applied 3028 place count 1280 transition count 1961
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3029 place count 1279 transition count 1953
Iterating global reduction 8 with 1 rules applied. Total rules applied 3030 place count 1279 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3031 place count 1278 transition count 1945
Iterating global reduction 8 with 1 rules applied. Total rules applied 3032 place count 1278 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3033 place count 1277 transition count 1937
Iterating global reduction 8 with 1 rules applied. Total rules applied 3034 place count 1277 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3035 place count 1276 transition count 1929
Iterating global reduction 8 with 1 rules applied. Total rules applied 3036 place count 1276 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3037 place count 1275 transition count 1921
Iterating global reduction 8 with 1 rules applied. Total rules applied 3038 place count 1275 transition count 1921
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3039 place count 1274 transition count 1913
Iterating global reduction 8 with 1 rules applied. Total rules applied 3040 place count 1274 transition count 1913
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3041 place count 1273 transition count 1905
Iterating global reduction 8 with 1 rules applied. Total rules applied 3042 place count 1273 transition count 1905
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3043 place count 1272 transition count 1897
Iterating global reduction 8 with 1 rules applied. Total rules applied 3044 place count 1272 transition count 1897
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3045 place count 1271 transition count 1889
Iterating global reduction 8 with 1 rules applied. Total rules applied 3046 place count 1271 transition count 1889
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3047 place count 1270 transition count 1881
Iterating global reduction 8 with 1 rules applied. Total rules applied 3048 place count 1270 transition count 1881
Performed 161 Post agglomeration using F-continuation condition.Transition count delta: 161
Deduced a syphon composed of 161 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 8 with 324 rules applied. Total rules applied 3372 place count 1107 transition count 1720
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3373 place count 1106 transition count 1719
Iterating global reduction 8 with 1 rules applied. Total rules applied 3374 place count 1106 transition count 1719
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3376 place count 1105 transition count 1728
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 3377 place count 1105 transition count 1727
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 3378 place count 1104 transition count 1727
Free-agglomeration rule applied 9 times.
Iterating global reduction 9 with 9 rules applied. Total rules applied 3387 place count 1104 transition count 1718
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 3396 place count 1095 transition count 1718
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 3406 place count 1095 transition count 1708
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 3416 place count 1085 transition count 1708
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 3418 place count 1085 transition count 1708
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3419 place count 1084 transition count 1707
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 11 with 12 rules applied. Total rules applied 3431 place count 1075 transition count 1704
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3434 place count 1072 transition count 1704
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 15 Pre rules applied. Total rules applied 3434 place count 1072 transition count 1689
Deduced a syphon composed of 15 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 31 rules applied. Total rules applied 3465 place count 1056 transition count 1689
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 13 with 5 rules applied. Total rules applied 3470 place count 1051 transition count 1689
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 3470 place count 1051 transition count 1688
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3472 place count 1050 transition count 1688
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 14 with 20 rules applied. Total rules applied 3492 place count 1040 transition count 1678
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 3495 place count 1037 transition count 1675
Iterating global reduction 14 with 3 rules applied. Total rules applied 3498 place count 1037 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 3499 place count 1036 transition count 1674
Iterating global reduction 14 with 1 rules applied. Total rules applied 3500 place count 1036 transition count 1674
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3501 place count 1036 transition count 1673
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 3502 place count 1036 transition count 1672
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 3503 place count 1035 transition count 1672
Applied a total of 3503 rules in 2281 ms. Remains 1035 /2826 variables (removed 1791) and now considering 1672/3513 (removed 1841) transitions.
Finished structural reductions, in 1 iterations. Remains : 1035/2826 places, 1672/3513 transitions.
Incomplete random walk after 1000000 steps, including 8925 resets, run finished after 16195 ms. (steps per millisecond=61 ) properties (out of 5) seen :2
FORMULA ASLink-PT-06b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1334 resets, run finished after 3491 ms. (steps per millisecond=286 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1380 resets, run finished after 4335 ms. (steps per millisecond=230 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1417 resets, run finished after 3109 ms. (steps per millisecond=321 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1672 rows 1035 cols
[2022-06-03 14:02:11] [INFO ] Computed 173 place invariants in 67 ms
[2022-06-03 14:02:11] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 14:02:11] [INFO ] [Nat]Absence check using 42 positive place invariants in 8 ms returned sat
[2022-06-03 14:02:11] [INFO ] [Nat]Absence check using 42 positive and 131 generalized place invariants in 37 ms returned sat
[2022-06-03 14:02:12] [INFO ] After 1158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 14:02:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-03 14:02:13] [INFO ] After 504ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-03 14:02:13] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 8 ms to minimize.
[2022-06-03 14:02:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 425 ms
[2022-06-03 14:02:14] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 2 ms to minimize.
[2022-06-03 14:02:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2022-06-03 14:02:14] [INFO ] After 1721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 582 ms.
[2022-06-03 14:02:14] [INFO ] After 3686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7293 ms.
Support contains 66 out of 1035 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1035/1035 places, 1672/1672 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1035 transition count 1671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1034 transition count 1671
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 1034 transition count 1668
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 9 place count 1030 transition count 1668
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 1030 transition count 1667
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 1029 transition count 1667
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 1029 transition count 1666
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 1027 transition count 1666
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 1026 transition count 1665
Applied a total of 16 rules in 127 ms. Remains 1026 /1035 variables (removed 9) and now considering 1665/1672 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1026/1035 places, 1665/1672 transitions.
Incomplete random walk after 1000000 steps, including 9032 resets, run finished after 13782 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1341 resets, run finished after 3663 ms. (steps per millisecond=273 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1380 resets, run finished after 2906 ms. (steps per millisecond=344 ) properties (out of 3) seen :1
FORMULA ASLink-PT-06b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 1458 resets, run finished after 1850 ms. (steps per millisecond=540 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1665 rows 1026 cols
[2022-06-03 14:02:44] [INFO ] Computed 171 place invariants in 35 ms
[2022-06-03 14:02:44] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:02:44] [INFO ] [Nat]Absence check using 41 positive place invariants in 11 ms returned sat
[2022-06-03 14:02:44] [INFO ] [Nat]Absence check using 41 positive and 130 generalized place invariants in 36 ms returned sat
[2022-06-03 14:02:45] [INFO ] After 945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:02:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-03 14:02:46] [INFO ] After 244ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 14:02:46] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 2 ms to minimize.
[2022-06-03 14:02:46] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2022-06-03 14:02:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 538 ms
[2022-06-03 14:02:47] [INFO ] After 1133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 376 ms.
[2022-06-03 14:02:47] [INFO ] After 2683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2670 ms.
Support contains 34 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1026/1026 places, 1665/1665 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1026 transition count 1655
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1016 transition count 1655
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 20 place count 1016 transition count 1644
Deduced a syphon composed of 11 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 44 place count 1003 transition count 1644
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 1002 transition count 1644
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 45 place count 1002 transition count 1643
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 1001 transition count 1643
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 66 place count 991 transition count 1634
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 989 transition count 1632
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 989 transition count 1632
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 989 transition count 1630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 988 transition count 1630
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 77 place count 988 transition count 1626
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 81 place count 984 transition count 1626
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 83 place count 982 transition count 1624
Applied a total of 83 rules in 200 ms. Remains 982 /1026 variables (removed 44) and now considering 1624/1665 (removed 41) transitions.
Finished structural reductions, in 1 iterations. Remains : 982/1026 places, 1624/1665 transitions.
Incomplete random walk after 1000000 steps, including 10777 resets, run finished after 7840 ms. (steps per millisecond=127 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1620 resets, run finished after 2658 ms. (steps per millisecond=376 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1751 resets, run finished after 1963 ms. (steps per millisecond=509 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3580169 steps, run timeout after 36001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 3580169 steps, saw 901668 distinct states, run finished after 36005 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1624 rows 982 cols
[2022-06-03 14:03:38] [INFO ] Computed 167 place invariants in 33 ms
[2022-06-03 14:03:39] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:03:39] [INFO ] [Nat]Absence check using 42 positive place invariants in 9 ms returned sat
[2022-06-03 14:03:39] [INFO ] [Nat]Absence check using 42 positive and 125 generalized place invariants in 28 ms returned sat
[2022-06-03 14:03:40] [INFO ] After 811ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:03:40] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 1 ms to minimize.
[2022-06-03 14:03:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2022-06-03 14:03:40] [INFO ] After 1357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 212 ms.
[2022-06-03 14:03:40] [INFO ] After 1769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9395 ms.
Support contains 34 out of 982 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 982/982 places, 1624/1624 transitions.
Applied a total of 0 rules in 27 ms. Remains 982 /982 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 982/982 places, 1624/1624 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 982/982 places, 1624/1624 transitions.
Applied a total of 0 rules in 25 ms. Remains 982 /982 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
// Phase 1: matrix 1624 rows 982 cols
[2022-06-03 14:03:50] [INFO ] Computed 167 place invariants in 13 ms
[2022-06-03 14:03:50] [INFO ] Implicit Places using invariants in 534 ms returned [1, 20, 21, 54, 72, 93, 165, 192, 211, 281, 290, 303, 304, 306, 324, 342, 413, 417, 418, 429, 430, 432, 449, 468, 538, 542, 543, 554, 555, 557, 574, 593, 669, 670, 677, 681, 682, 693, 695, 696, 698, 715, 733, 771, 805, 809, 810, 813, 824, 825, 826, 844, 846, 850, 868, 869, 870, 871, 883, 892, 898, 904, 910, 916, 922, 928, 934, 940, 946]
Discarding 69 places :
Implicit Place search using SMT only with invariants took 539 ms to find 69 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 913/982 places, 1624/1624 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 913 transition count 1521
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 114 rules applied. Total rules applied 217 place count 810 transition count 1510
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 226 place count 801 transition count 1510
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 226 place count 801 transition count 1480
Deduced a syphon composed of 30 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 287 place count 770 transition count 1480
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 13 rules applied. Total rules applied 300 place count 765 transition count 1472
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 308 place count 757 transition count 1472
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 322 place count 743 transition count 1458
Iterating global reduction 5 with 14 rules applied. Total rules applied 336 place count 743 transition count 1458
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 339 place count 743 transition count 1455
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 342 place count 740 transition count 1449
Iterating global reduction 6 with 3 rules applied. Total rules applied 345 place count 740 transition count 1449
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 346 place count 739 transition count 1448
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 739 transition count 1448
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 348 place count 738 transition count 1446
Iterating global reduction 6 with 1 rules applied. Total rules applied 349 place count 738 transition count 1446
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 433 place count 696 transition count 1404
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 437 place count 692 transition count 1399
Iterating global reduction 6 with 4 rules applied. Total rules applied 441 place count 692 transition count 1399
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 444 place count 692 transition count 1396
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 448 place count 690 transition count 1397
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 449 place count 690 transition count 1396
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 451 place count 690 transition count 1394
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 453 place count 688 transition count 1394
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 8 with 13 rules applied. Total rules applied 466 place count 688 transition count 1381
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 480 place count 674 transition count 1381
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 481 place count 674 transition count 1380
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 496 place count 674 transition count 1380
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 497 place count 674 transition count 1380
Applied a total of 497 rules in 331 ms. Remains 674 /913 variables (removed 239) and now considering 1380/1624 (removed 244) transitions.
// Phase 1: matrix 1380 rows 674 cols
[2022-06-03 14:03:51] [INFO ] Computed 91 place invariants in 18 ms
[2022-06-03 14:03:51] [INFO ] Implicit Places using invariants in 340 ms returned [226, 233, 238, 247, 248, 301, 320, 326, 329, 333, 338, 339, 410, 416, 419, 421, 428, 429, 482, 500, 508, 521, 522, 575, 594, 600, 603, 605]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 343 ms to find 28 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 646/982 places, 1380/1624 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 646 transition count 1377
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 643 transition count 1377
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 15 place count 634 transition count 1368
Iterating global reduction 2 with 9 rules applied. Total rules applied 24 place count 634 transition count 1368
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 631 transition count 1365
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 631 transition count 1365
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 48 place count 622 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 621 transition count 1355
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 621 transition count 1355
Free-agglomeration rule applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 64 place count 621 transition count 1341
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 78 place count 607 transition count 1341
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 81 place count 607 transition count 1338
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 84 place count 604 transition count 1338
Applied a total of 84 rules in 142 ms. Remains 604 /646 variables (removed 42) and now considering 1338/1380 (removed 42) transitions.
// Phase 1: matrix 1338 rows 604 cols
[2022-06-03 14:03:51] [INFO ] Computed 63 place invariants in 21 ms
[2022-06-03 14:03:51] [INFO ] Implicit Places using invariants in 377 ms returned []
// Phase 1: matrix 1338 rows 604 cols
[2022-06-03 14:03:52] [INFO ] Computed 63 place invariants in 12 ms
[2022-06-03 14:03:53] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1535 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 604/982 places, 1338/1624 transitions.
Finished structural reductions, in 3 iterations. Remains : 604/982 places, 1338/1624 transitions.
Incomplete random walk after 1000000 steps, including 15479 resets, run finished after 8013 ms. (steps per millisecond=124 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2595 resets, run finished after 2747 ms. (steps per millisecond=364 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3075 resets, run finished after 2432 ms. (steps per millisecond=411 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5539766 steps, run timeout after 39001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 5539766 steps, saw 1217967 distinct states, run finished after 39003 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1338 rows 604 cols
[2022-06-03 14:04:45] [INFO ] Computed 63 place invariants in 9 ms
[2022-06-03 14:04:45] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:04:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-06-03 14:04:45] [INFO ] [Nat]Absence check using 15 positive and 48 generalized place invariants in 15 ms returned sat
[2022-06-03 14:04:46] [INFO ] After 863ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:04:47] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2022-06-03 14:04:47] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 0 ms to minimize.
[2022-06-03 14:04:47] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2022-06-03 14:04:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 780 ms
[2022-06-03 14:04:47] [INFO ] After 2209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 761 ms.
[2022-06-03 14:04:48] [INFO ] After 3093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2218 ms.
Support contains 34 out of 604 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 604/604 places, 1338/1338 transitions.
Applied a total of 0 rules in 31 ms. Remains 604 /604 variables (removed 0) and now considering 1338/1338 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 604/604 places, 1338/1338 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 604/604 places, 1338/1338 transitions.
Applied a total of 0 rules in 35 ms. Remains 604 /604 variables (removed 0) and now considering 1338/1338 (removed 0) transitions.
// Phase 1: matrix 1338 rows 604 cols
[2022-06-03 14:04:50] [INFO ] Computed 63 place invariants in 16 ms
[2022-06-03 14:04:51] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 1338 rows 604 cols
[2022-06-03 14:04:51] [INFO ] Computed 63 place invariants in 9 ms
[2022-06-03 14:04:52] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
[2022-06-03 14:04:52] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 1338 rows 604 cols
[2022-06-03 14:04:52] [INFO ] Computed 63 place invariants in 21 ms
[2022-06-03 14:04:52] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 604/604 places, 1338/1338 transitions.
Incomplete random walk after 1000000 steps, including 15301 resets, run finished after 9927 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2627 resets, run finished after 2669 ms. (steps per millisecond=374 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3062 resets, run finished after 2289 ms. (steps per millisecond=436 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 6008958 steps, run timeout after 42001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 6008958 steps, saw 1305804 distinct states, run finished after 42002 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1338 rows 604 cols
[2022-06-03 14:05:49] [INFO ] Computed 63 place invariants in 21 ms
[2022-06-03 14:05:49] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:05:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-06-03 14:05:50] [INFO ] [Nat]Absence check using 15 positive and 48 generalized place invariants in 19 ms returned sat
[2022-06-03 14:05:51] [INFO ] After 970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:05:51] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2022-06-03 14:05:51] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 0 ms to minimize.
[2022-06-03 14:05:52] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 0 ms to minimize.
[2022-06-03 14:05:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 704 ms
[2022-06-03 14:05:52] [INFO ] After 2152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 732 ms.
[2022-06-03 14:05:53] [INFO ] After 3041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2081 ms.
Support contains 34 out of 604 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 604/604 places, 1338/1338 transitions.
Applied a total of 0 rules in 21 ms. Remains 604 /604 variables (removed 0) and now considering 1338/1338 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 604/604 places, 1338/1338 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 604/604 places, 1338/1338 transitions.
Applied a total of 0 rules in 19 ms. Remains 604 /604 variables (removed 0) and now considering 1338/1338 (removed 0) transitions.
// Phase 1: matrix 1338 rows 604 cols
[2022-06-03 14:05:55] [INFO ] Computed 63 place invariants in 21 ms
[2022-06-03 14:05:55] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 1338 rows 604 cols
[2022-06-03 14:05:55] [INFO ] Computed 63 place invariants in 11 ms
[2022-06-03 14:05:56] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
[2022-06-03 14:05:56] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 1338 rows 604 cols
[2022-06-03 14:05:56] [INFO ] Computed 63 place invariants in 12 ms
[2022-06-03 14:05:57] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 604/604 places, 1338/1338 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 604 transition count 1334
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 600 transition count 1334
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 599 transition count 1333
Applied a total of 10 rules in 33 ms. Remains 599 /604 variables (removed 5) and now considering 1333/1338 (removed 5) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1333 rows 599 cols
[2022-06-03 14:05:57] [INFO ] Computed 63 place invariants in 19 ms
[2022-06-03 14:05:57] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:05:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-06-03 14:05:57] [INFO ] [Nat]Absence check using 15 positive and 48 generalized place invariants in 14 ms returned sat
[2022-06-03 14:05:58] [INFO ] After 964ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:05:58] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 0 ms to minimize.
[2022-06-03 14:05:59] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 0 ms to minimize.
[2022-06-03 14:05:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 703 ms
[2022-06-03 14:05:59] [INFO ] After 1969ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 268 ms.
[2022-06-03 14:05:59] [INFO ] After 2348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 14:06:00] [INFO ] Flatten gal took : 173 ms
[2022-06-03 14:06:00] [INFO ] Flatten gal took : 103 ms
[2022-06-03 14:06:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9250072520635574697.gal : 45 ms
[2022-06-03 14:06:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11887137070670774590.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9250072520635574697.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11887137070670774590.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11887137070670774590.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :33 after 39
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :39 after 93
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :93 after 786
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :786 after 311148
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :311148 after 3.80962e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3.80962e+07 after 3.83689e+07
Reachability property ASLink-PT-06b-ReachabilityCardinality-14 is true.
Invariant property ASLink-PT-06b-ReachabilityCardinality-06 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.84915e+07,7.08479,18556,2,11148,16,30196,6,0,3730,11249,0
Total reachable state count : 38491497

Verifying 2 reachability properties.
Invariant property ASLink-PT-06b-ReachabilityCardinality-06 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-06b-ReachabilityCardinality-06,3072,11.8057,18556,2,1881,16,30196,7,0,3820,11249,0
Reachability property ASLink-PT-06b-ReachabilityCardinality-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-06b-ReachabilityCardinality-14,3,11.8093,18556,2,607,16,30196,8,0,3822,11249,0
[2022-06-03 14:06:12] [INFO ] Flatten gal took : 62 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15451704974080187245
[2022-06-03 14:06:12] [INFO ] Computing symmetric may disable matrix : 1338 transitions.
[2022-06-03 14:06:12] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:06:12] [INFO ] Computing symmetric may enable matrix : 1338 transitions.
[2022-06-03 14:06:12] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:06:12] [INFO ] Applying decomposition
[2022-06-03 14:06:12] [INFO ] Flatten gal took : 154 ms
[2022-06-03 14:06:12] [INFO ] Flatten gal took : 152 ms
[2022-06-03 14:06:12] [INFO ] Computing Do-Not-Accords matrix : 1338 transitions.
[2022-06-03 14:06:12] [INFO ] Computation of Completed DNA matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:06:12] [INFO ] Built C files in 431ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15451704974080187245
Running compilation step : cd /tmp/ltsmin15451704974080187245;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 4102 ms.
Running link step : cd /tmp/ltsmin15451704974080187245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin15451704974080187245;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT06bReachabilityCardinality06==true'
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin15451704974080187245;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT06bReachabilityCardinality06==true'
Running LTSmin : cd /tmp/ltsmin15451704974080187245;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT06bReachabilityCardinality14==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-06b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-06b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245688800102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-06b.tgz
mv ASLink-PT-06b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;