Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r301-smll-165463876800132.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyCommit-PT-09b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r301-smll-165463876800132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 126M
-rw-r--r-- 1 mcc users 8.7K May 30 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 30 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 30 14:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 30 14:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 25 13:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 25 13:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 11K May 30 15:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 30 15:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 30 15:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 30 15:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 126M May 29 12:20 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1654643841559

Running Version 202205111006
[2022-06-07 23:17:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -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, 1800]
[2022-06-07 23:17:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-07 23:17:31] [INFO ] Load time of PNML (sax parser for PT used): 7210 ms
[2022-06-07 23:17:31] [INFO ] Transformed 3049 places.
[2022-06-07 23:17:32] [INFO ] Transformed 122340 transitions.
[2022-06-07 23:17:32] [INFO ] Found NUPN structural information;
[2022-06-07 23:17:32] [INFO ] Parsed PT model containing 3049 places and 122340 transitions in 8500 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 3049/3049 places, 122340/122340 transitions.
Graph (trivial) has 3028 edges and 3049 vertex of which 210 / 3049 are part of one of the 30 SCC in 44 ms
Free SCC test removed 180 places
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 2292 transitions
Trivial Post-agglo rules discarded 2292 transitions
Performed 2292 trivial Post agglomeration. Transition count delta: 2292
Iterating post reduction 0 with 2292 rules applied. Total rules applied 2293 place count 2869 transition count 119848
Reduce places removed 2292 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 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 1 with 2332 rules applied. Total rules applied 4625 place count 577 transition count 119808
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 4635 place count 567 transition count 119808
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 4635 place count 567 transition count 119698
Deduced a syphon composed of 110 places in 326 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 4855 place count 457 transition count 119698
Discarding 123 places :
Symmetric choice reduction at 3 with 123 rule applications. Total rules 4978 place count 334 transition count 119555
Iterating global reduction 3 with 123 rules applied. Total rules applied 5101 place count 334 transition count 119555
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5101 place count 334 transition count 119554
Deduced a syphon composed of 1 places in 249 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5103 place count 333 transition count 119554
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 5164 place count 272 transition count 3444
Iterating global reduction 3 with 61 rules applied. Total rules applied 5225 place count 272 transition count 3444
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 5256 place count 272 transition count 3413
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 5276 place count 252 transition count 3393
Iterating global reduction 4 with 20 rules applied. Total rules applied 5296 place count 252 transition count 3393
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 5316 place count 232 transition count 3373
Iterating global reduction 4 with 20 rules applied. Total rules applied 5336 place count 232 transition count 3373
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 5356 place count 232 transition count 3353
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 5436 place count 192 transition count 3313
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 5446 place count 182 transition count 3303
Iterating global reduction 5 with 10 rules applied. Total rules applied 5456 place count 182 transition count 3303
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 5466 place count 172 transition count 3293
Iterating global reduction 5 with 10 rules applied. Total rules applied 5476 place count 172 transition count 3293
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 5486 place count 162 transition count 3283
Iterating global reduction 5 with 10 rules applied. Total rules applied 5496 place count 162 transition count 3283
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 5502 place count 159 transition count 3291
Applied a total of 5502 rules in 50729 ms. Remains 159 /3049 variables (removed 2890) and now considering 3291/122340 (removed 119049) transitions.
[2022-06-07 23:18:23] [INFO ] Flow matrix only has 3261 transitions (discarded 30 similar events)
// Phase 1: matrix 3261 rows 159 cols
[2022-06-07 23:18:23] [INFO ] Computed 11 place invariants in 99 ms
[2022-06-07 23:18:26] [INFO ] Implicit Places using invariants in 2634 ms returned []
[2022-06-07 23:18:26] [INFO ] Flow matrix only has 3261 transitions (discarded 30 similar events)
// Phase 1: matrix 3261 rows 159 cols
[2022-06-07 23:18:26] [INFO ] Computed 11 place invariants in 66 ms
[2022-06-07 23:18:27] [INFO ] State equation strengthened by 1053 read => feed constraints.
[2022-06-07 23:18:34] [INFO ] Implicit Places using invariants and state equation in 8630 ms returned []
Implicit Place search using SMT with State Equation took 11312 ms to find 0 implicit places.
[2022-06-07 23:18:34] [INFO ] Flow matrix only has 3261 transitions (discarded 30 similar events)
// Phase 1: matrix 3261 rows 159 cols
[2022-06-07 23:18:34] [INFO ] Computed 11 place invariants in 51 ms
[2022-06-07 23:18:38] [INFO ] Dead Transitions using invariants and state equation in 3731 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 159/3049 places, 3291/122340 transitions.
Finished structural reductions, in 1 iterations. Remains : 159/3049 places, 3291/122340 transitions.
Discarding 122 transitions out of 3291. Remains 3169
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 5320 ms. (steps per millisecond=1 ) properties (out of 3168) seen :36
Probabilistic random walk after 30001 steps, saw 13051 distinct states, run finished after 6568 ms. (steps per millisecond=4 ) properties seen :55
Running SMT prover for 3077 properties.
[2022-06-07 23:18:51] [INFO ] Flow matrix only has 3261 transitions (discarded 30 similar events)
// Phase 1: matrix 3261 rows 159 cols
[2022-06-07 23:18:51] [INFO ] Computed 11 place invariants in 41 ms
[2022-06-07 23:20:10] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-06-07 23:20:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-07 23:20:19] [INFO ] After 25062ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3077 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 101 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 3291/3291 transitions.
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 159 transition count 3260
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 159 transition count 3260
Applied a total of 37 rules in 2153 ms. Remains 159 /159 variables (removed 0) and now considering 3260/3291 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 3260/3291 transitions.
Interrupted random walk after 68326 steps, including 3615 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 3077) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 3077) seen :0
Probabilistic random walk after 1000000 steps, saw 196571 distinct states, run finished after 86689 ms. (steps per millisecond=11 ) properties seen :70
Running SMT prover for 3007 properties.
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:22:20] [INFO ] Computed 11 place invariants in 27 ms
[2022-06-07 23:23:31] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-07 23:27:04] [INFO ] After 200747ms SMT Verify possible using state equation in real domain returned unsat :0 sat :934 real:2073
[2022-06-07 23:27:05] [INFO ] State equation strengthened by 1058 read => feed constraints.
[2022-06-07 23:27:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-07 23:27:05] [INFO ] After 225928ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3007 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 103 ms.
Support contains 101 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 3260/3260 transitions.
Applied a total of 0 rules in 539 ms. Remains 159 /159 variables (removed 0) and now considering 3260/3260 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 3260/3260 transitions.
Interrupted random walk after 87659 steps, including 4643 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 3007) seen :0
Interrupted probabilistic random walk after 941988 steps, run timeout after 93001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 941988 steps, saw 186657 distinct states, run finished after 93008 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 3007 properties.
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:29:10] [INFO ] Computed 11 place invariants in 28 ms
[2022-06-07 23:30:27] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-07 23:33:56] [INFO ] After 195520ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1102 real:1905
[2022-06-07 23:33:56] [INFO ] State equation strengthened by 1058 read => feed constraints.
[2022-06-07 23:33:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-07 23:33:56] [INFO ] After 225498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3007 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 146 ms.
Support contains 101 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 3260/3260 transitions.
Applied a total of 0 rules in 883 ms. Remains 159 /159 variables (removed 0) and now considering 3260/3260 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 3260/3260 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 3260/3260 transitions.
Applied a total of 0 rules in 533 ms. Remains 159 /159 variables (removed 0) and now considering 3260/3260 (removed 0) transitions.
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:33:58] [INFO ] Computed 11 place invariants in 27 ms
[2022-06-07 23:33:58] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:33:58] [INFO ] Computed 11 place invariants in 44 ms
[2022-06-07 23:33:59] [INFO ] State equation strengthened by 1058 read => feed constraints.
[2022-06-07 23:34:07] [INFO ] Implicit Places using invariants and state equation in 9213 ms returned []
Implicit Place search using SMT with State Equation took 9347 ms to find 0 implicit places.
[2022-06-07 23:34:08] [INFO ] Redundant transitions in 559 ms returned []
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:34:08] [INFO ] Computed 11 place invariants in 43 ms
[2022-06-07 23:34:12] [INFO ] Dead Transitions using invariants and state equation in 3907 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 3260/3260 transitions.
Incomplete random walk after 100000 steps, including 5245 resets, run finished after 6332 ms. (steps per millisecond=15 ) properties (out of 101) seen :61
Running SMT prover for 40 properties.
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:34:18] [INFO ] Computed 11 place invariants in 40 ms
[2022-06-07 23:34:19] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-06-07 23:34:27] [INFO ] After 7590ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:34
[2022-06-07 23:34:28] [INFO ] State equation strengthened by 1058 read => feed constraints.
[2022-06-07 23:34:35] [INFO ] After 7668ms SMT Verify possible using 1058 Read/Feed constraints in real domain returned unsat :0 sat :0 real:40
[2022-06-07 23:34:35] [INFO ] After 16942ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:40
[2022-06-07 23:34:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-07 23:34:44] [INFO ] After 7947ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :40
[2022-06-07 23:34:59] [INFO ] After 14745ms SMT Verify possible using 1058 Read/Feed constraints in natural domain returned unsat :0 sat :40
[2022-06-07 23:35:02] [INFO ] Deduced a trap composed of 25 places in 3195 ms of which 4 ms to minimize.
[2022-06-07 23:35:05] [INFO ] Deduced a trap composed of 25 places in 2420 ms of which 1 ms to minimize.
[2022-06-07 23:35:07] [INFO ] Deduced a trap composed of 25 places in 1986 ms of which 1 ms to minimize.
[2022-06-07 23:35:09] [INFO ] Deduced a trap composed of 25 places in 1768 ms of which 2 ms to minimize.
[2022-06-07 23:35:10] [INFO ] Deduced a trap composed of 23 places in 1716 ms of which 0 ms to minimize.
[2022-06-07 23:35:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 11663 ms
[2022-06-07 23:35:13] [INFO ] Deduced a trap composed of 25 places in 2402 ms of which 1 ms to minimize.
[2022-06-07 23:35:15] [INFO ] Deduced a trap composed of 23 places in 2071 ms of which 1 ms to minimize.
[2022-06-07 23:35:17] [INFO ] Deduced a trap composed of 25 places in 2022 ms of which 1 ms to minimize.
[2022-06-07 23:35:19] [INFO ] Deduced a trap composed of 23 places in 1847 ms of which 1 ms to minimize.
[2022-06-07 23:35:21] [INFO ] Deduced a trap composed of 25 places in 1837 ms of which 1 ms to minimize.
[2022-06-07 23:35:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 10682 ms
[2022-06-07 23:35:24] [INFO ] Deduced a trap composed of 25 places in 2158 ms of which 2 ms to minimize.
[2022-06-07 23:35:26] [INFO ] Deduced a trap composed of 23 places in 2061 ms of which 1 ms to minimize.
[2022-06-07 23:35:28] [INFO ] Deduced a trap composed of 25 places in 1979 ms of which 1 ms to minimize.
[2022-06-07 23:35:30] [INFO ] Deduced a trap composed of 25 places in 1913 ms of which 1 ms to minimize.
[2022-06-07 23:35:32] [INFO ] Deduced a trap composed of 25 places in 1873 ms of which 1 ms to minimize.
[2022-06-07 23:35:34] [INFO ] Deduced a trap composed of 25 places in 1808 ms of which 1 ms to minimize.
[2022-06-07 23:35:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 12449 ms
[2022-06-07 23:35:37] [INFO ] Deduced a trap composed of 25 places in 2214 ms of which 1 ms to minimize.
[2022-06-07 23:35:39] [INFO ] Deduced a trap composed of 23 places in 2155 ms of which 1 ms to minimize.
[2022-06-07 23:35:41] [INFO ] Deduced a trap composed of 23 places in 2060 ms of which 1 ms to minimize.
[2022-06-07 23:35:43] [INFO ] Deduced a trap composed of 25 places in 1966 ms of which 4 ms to minimize.
[2022-06-07 23:35:45] [INFO ] Deduced a trap composed of 25 places in 1925 ms of which 1 ms to minimize.
[2022-06-07 23:35:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 10888 ms
[2022-06-07 23:35:48] [INFO ] Deduced a trap composed of 25 places in 1976 ms of which 1 ms to minimize.
[2022-06-07 23:35:50] [INFO ] Deduced a trap composed of 25 places in 1885 ms of which 1 ms to minimize.
[2022-06-07 23:35:52] [INFO ] Deduced a trap composed of 25 places in 1897 ms of which 1 ms to minimize.
[2022-06-07 23:35:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6144 ms
[2022-06-07 23:35:54] [INFO ] Deduced a trap composed of 25 places in 2009 ms of which 1 ms to minimize.
[2022-06-07 23:35:56] [INFO ] Deduced a trap composed of 25 places in 1880 ms of which 1 ms to minimize.
[2022-06-07 23:35:58] [INFO ] Deduced a trap composed of 25 places in 1838 ms of which 0 ms to minimize.
[2022-06-07 23:36:00] [INFO ] Deduced a trap composed of 23 places in 1767 ms of which 2 ms to minimize.
[2022-06-07 23:36:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7935 ms
[2022-06-07 23:36:02] [INFO ] Deduced a trap composed of 22 places in 1985 ms of which 1 ms to minimize.
[2022-06-07 23:36:04] [INFO ] Deduced a trap composed of 22 places in 2092 ms of which 1 ms to minimize.
[2022-06-07 23:36:07] [INFO ] Deduced a trap composed of 22 places in 2070 ms of which 1 ms to minimize.
[2022-06-07 23:36:09] [INFO ] Deduced a trap composed of 22 places in 2021 ms of which 1 ms to minimize.
[2022-06-07 23:36:11] [INFO ] Deduced a trap composed of 22 places in 1991 ms of which 1 ms to minimize.
[2022-06-07 23:36:13] [INFO ] Deduced a trap composed of 22 places in 2477 ms of which 1 ms to minimize.
[2022-06-07 23:36:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 13245 ms
[2022-06-07 23:36:16] [INFO ] Deduced a trap composed of 22 places in 2686 ms of which 0 ms to minimize.
[2022-06-07 23:36:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-07 23:36:16] [INFO ] After 100993ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:40
Interrupted random walk after 82010 steps, including 4331 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 3007) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 3007) seen :0
Interrupted probabilistic random walk after 998964 steps, run timeout after 93001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 998964 steps, saw 196278 distinct states, run finished after 93003 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 3007 properties.
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:38:21] [INFO ] Computed 11 place invariants in 26 ms
[2022-06-07 23:39:43] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2022-06-07 23:43:08] [INFO ] After 184843ms SMT Verify possible using state equation in real domain returned unsat :0 sat :967 real:2040
[2022-06-07 23:43:08] [INFO ] State equation strengthened by 1058 read => feed constraints.
[2022-06-07 23:43:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-07 23:43:08] [INFO ] After 225574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3007 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 86 ms.
Support contains 101 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 3260/3260 transitions.
Applied a total of 0 rules in 546 ms. Remains 159 /159 variables (removed 0) and now considering 3260/3260 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 3260/3260 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 3260/3260 transitions.
Applied a total of 0 rules in 530 ms. Remains 159 /159 variables (removed 0) and now considering 3260/3260 (removed 0) transitions.
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:43:10] [INFO ] Computed 11 place invariants in 26 ms
[2022-06-07 23:43:10] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:43:10] [INFO ] Computed 11 place invariants in 26 ms
[2022-06-07 23:43:11] [INFO ] State equation strengthened by 1058 read => feed constraints.
[2022-06-07 23:43:16] [INFO ] Implicit Places using invariants and state equation in 6306 ms returned []
Implicit Place search using SMT with State Equation took 6431 ms to find 0 implicit places.
[2022-06-07 23:43:17] [INFO ] Redundant transitions in 534 ms returned []
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:43:17] [INFO ] Computed 11 place invariants in 42 ms
[2022-06-07 23:43:19] [INFO ] Dead Transitions using invariants and state equation in 2543 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 3260/3260 transitions.
Incomplete random walk after 100000 steps, including 5230 resets, run finished after 6566 ms. (steps per millisecond=15 ) properties (out of 101) seen :61
Running SMT prover for 40 properties.
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:43:26] [INFO ] Computed 11 place invariants in 25 ms
[2022-06-07 23:43:26] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-06-07 23:43:32] [INFO ] After 5883ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:34
[2022-06-07 23:43:33] [INFO ] State equation strengthened by 1058 read => feed constraints.
[2022-06-07 23:43:38] [INFO ] After 5299ms SMT Verify possible using 1058 Read/Feed constraints in real domain returned unsat :0 sat :0 real:40
[2022-06-07 23:43:38] [INFO ] After 11921ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:40
[2022-06-07 23:43:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-07 23:43:43] [INFO ] After 4863ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :40
[2022-06-07 23:43:53] [INFO ] After 9485ms SMT Verify possible using 1058 Read/Feed constraints in natural domain returned unsat :0 sat :40
[2022-06-07 23:43:55] [INFO ] Deduced a trap composed of 25 places in 2323 ms of which 1 ms to minimize.
[2022-06-07 23:43:58] [INFO ] Deduced a trap composed of 25 places in 2580 ms of which 1 ms to minimize.
[2022-06-07 23:44:00] [INFO ] Deduced a trap composed of 25 places in 2180 ms of which 1 ms to minimize.
[2022-06-07 23:44:03] [INFO ] Deduced a trap composed of 25 places in 2645 ms of which 0 ms to minimize.
[2022-06-07 23:44:05] [INFO ] Deduced a trap composed of 23 places in 1847 ms of which 0 ms to minimize.
[2022-06-07 23:44:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 12169 ms
[2022-06-07 23:44:07] [INFO ] Deduced a trap composed of 25 places in 1963 ms of which 0 ms to minimize.
[2022-06-07 23:44:09] [INFO ] Deduced a trap composed of 23 places in 1960 ms of which 0 ms to minimize.
[2022-06-07 23:44:11] [INFO ] Deduced a trap composed of 25 places in 2106 ms of which 1 ms to minimize.
[2022-06-07 23:44:14] [INFO ] Deduced a trap composed of 23 places in 2429 ms of which 1 ms to minimize.
[2022-06-07 23:44:17] [INFO ] Deduced a trap composed of 25 places in 2518 ms of which 1 ms to minimize.
[2022-06-07 23:44:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 11565 ms
[2022-06-07 23:44:20] [INFO ] Deduced a trap composed of 25 places in 2753 ms of which 1 ms to minimize.
[2022-06-07 23:44:22] [INFO ] Deduced a trap composed of 23 places in 2316 ms of which 1 ms to minimize.
[2022-06-07 23:44:25] [INFO ] Deduced a trap composed of 25 places in 2513 ms of which 1 ms to minimize.
[2022-06-07 23:44:27] [INFO ] Deduced a trap composed of 25 places in 2353 ms of which 1 ms to minimize.
[2022-06-07 23:44:30] [INFO ] Deduced a trap composed of 25 places in 2078 ms of which 1 ms to minimize.
[2022-06-07 23:44:32] [INFO ] Deduced a trap composed of 25 places in 2379 ms of which 0 ms to minimize.
[2022-06-07 23:44:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 15066 ms
[2022-06-07 23:44:35] [INFO ] Deduced a trap composed of 25 places in 2809 ms of which 0 ms to minimize.
[2022-06-07 23:44:38] [INFO ] Deduced a trap composed of 23 places in 2200 ms of which 0 ms to minimize.
[2022-06-07 23:44:40] [INFO ] Deduced a trap composed of 23 places in 2533 ms of which 0 ms to minimize.
[2022-06-07 23:44:42] [INFO ] Deduced a trap composed of 25 places in 2079 ms of which 1 ms to minimize.
[2022-06-07 23:44:45] [INFO ] Deduced a trap composed of 25 places in 2071 ms of which 2 ms to minimize.
[2022-06-07 23:44:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 12297 ms
[2022-06-07 23:44:48] [INFO ] Deduced a trap composed of 25 places in 2584 ms of which 1 ms to minimize.
[2022-06-07 23:44:50] [INFO ] Deduced a trap composed of 25 places in 2052 ms of which 1 ms to minimize.
[2022-06-07 23:44:52] [INFO ] Deduced a trap composed of 25 places in 1770 ms of which 1 ms to minimize.
[2022-06-07 23:44:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6785 ms
[2022-06-07 23:44:55] [INFO ] Deduced a trap composed of 25 places in 2595 ms of which 0 ms to minimize.
[2022-06-07 23:44:57] [INFO ] Deduced a trap composed of 25 places in 2164 ms of which 0 ms to minimize.
[2022-06-07 23:44:59] [INFO ] Deduced a trap composed of 25 places in 1922 ms of which 0 ms to minimize.
[2022-06-07 23:45:01] [INFO ] Deduced a trap composed of 23 places in 2154 ms of which 1 ms to minimize.
[2022-06-07 23:45:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 9289 ms
[2022-06-07 23:45:04] [INFO ] Deduced a trap composed of 22 places in 2662 ms of which 1 ms to minimize.
[2022-06-07 23:45:07] [INFO ] Deduced a trap composed of 22 places in 2186 ms of which 0 ms to minimize.
[2022-06-07 23:45:10] [INFO ] Deduced a trap composed of 22 places in 2746 ms of which 3 ms to minimize.
[2022-06-07 23:45:12] [INFO ] Deduced a trap composed of 22 places in 2352 ms of which 1 ms to minimize.
[2022-06-07 23:45:14] [INFO ] Deduced a trap composed of 22 places in 2130 ms of which 2 ms to minimize.
[2022-06-07 23:45:17] [INFO ] Deduced a trap composed of 22 places in 2541 ms of which 1 ms to minimize.
[2022-06-07 23:45:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 15372 ms
[2022-06-07 23:45:20] [INFO ] Deduced a trap composed of 22 places in 2812 ms of which 0 ms to minimize.
[2022-06-07 23:45:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-07 23:45:20] [INFO ] After 102340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:40
Incomplete random walk after 10000 steps, including 523 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 228732 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228732 steps, saw 65793 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:45:23] [INFO ] Computed 11 place invariants in 26 ms
[2022-06-07 23:45:24] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-07 23:45:25] [INFO ] After 1078ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-07 23:45:25] [INFO ] State equation strengthened by 1058 read => feed constraints.
[2022-06-07 23:45:33] [INFO ] After 7245ms SMT Verify possible using 1058 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-07 23:45:33] [INFO ] After 9060ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-07 23:45:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-06-07 23:45:34] [INFO ] After 1347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-07 23:45:42] [INFO ] After 7768ms SMT Verify possible using 1058 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-07 23:45:42] [INFO ] After 8070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 190 ms.
[2022-06-07 23:45:42] [INFO ] After 9682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 3260/3260 transitions.
Graph (complete) has 1209 edges and 159 vertex of which 149 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.26 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 149 transition count 3251
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 20 place count 139 transition count 3241
Iterating global reduction 1 with 10 rules applied. Total rules applied 30 place count 139 transition count 3241
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 129 transition count 3231
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 129 transition count 3231
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 70 place count 119 transition count 3221
Free-agglomeration rule applied 56 times.
Iterating global reduction 1 with 56 rules applied. Total rules applied 126 place count 119 transition count 3165
Reduce places removed 56 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1025 transitions.
Iterating post reduction 1 with 1081 rules applied. Total rules applied 1207 place count 63 transition count 2140
Renaming transitions due to excessive name length > 1024 char.
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1217 place count 53 transition count 2130
Iterating global reduction 2 with 10 rules applied. Total rules applied 1227 place count 53 transition count 2130
Drop transitions removed 1032 transitions
Redundant transition composition rules discarded 1032 transitions
Iterating global reduction 2 with 1032 rules applied. Total rules applied 2259 place count 53 transition count 1098
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2261 place count 52 transition count 1097
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2265 place count 50 transition count 1115
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 2272 place count 50 transition count 1115
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 2278 place count 50 transition count 1109
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2283 place count 45 transition count 1099
Iterating global reduction 2 with 5 rules applied. Total rules applied 2288 place count 45 transition count 1099
Applied a total of 2288 rules in 3609 ms. Remains 45 /159 variables (removed 114) and now considering 1099/3260 (removed 2161) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/159 places, 1099/3260 transitions.
Finished random walk after 788 steps, including 0 resets, run visited all 1 properties in 86 ms. (steps per millisecond=9 )
Incomplete random walk after 10000 steps, including 534 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 230708 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230708 steps, saw 66316 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:45:49] [INFO ] Computed 11 place invariants in 26 ms
[2022-06-07 23:45:49] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-07 23:45:51] [INFO ] After 1332ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-07 23:45:51] [INFO ] State equation strengthened by 1058 read => feed constraints.
[2022-06-07 23:45:59] [INFO ] After 7758ms SMT Verify possible using 1058 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-06-07 23:46:01] [INFO ] Deduced a trap composed of 23 places in 2349 ms of which 1 ms to minimize.
[2022-06-07 23:46:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2626 ms
[2022-06-07 23:46:02] [INFO ] After 10463ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-07 23:46:02] [INFO ] After 12353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-07 23:46:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-06-07 23:46:03] [INFO ] After 1238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-07 23:46:08] [INFO ] After 5571ms SMT Verify possible using 1058 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-07 23:46:11] [INFO ] Deduced a trap composed of 23 places in 2032 ms of which 1 ms to minimize.
[2022-06-07 23:46:13] [INFO ] Deduced a trap composed of 23 places in 2150 ms of which 1 ms to minimize.
[2022-06-07 23:46:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4462 ms
[2022-06-07 23:46:13] [INFO ] After 10101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2022-06-07 23:46:13] [INFO ] After 11510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 3260/3260 transitions.
Graph (complete) has 1209 edges and 159 vertex of which 149 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.12 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 149 transition count 3250
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 20 place count 140 transition count 3241
Iterating global reduction 1 with 9 rules applied. Total rules applied 29 place count 140 transition count 3241
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 38 place count 131 transition count 3232
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 131 transition count 3232
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 67 place count 121 transition count 3222
Free-agglomeration rule applied 57 times.
Iterating global reduction 1 with 57 rules applied. Total rules applied 124 place count 121 transition count 3165
Reduce places removed 57 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 513 transitions.
Iterating post reduction 1 with 570 rules applied. Total rules applied 694 place count 64 transition count 2652
Renaming transitions due to excessive name length > 1024 char.
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 704 place count 54 transition count 2642
Iterating global reduction 2 with 10 rules applied. Total rules applied 714 place count 54 transition count 2642
Drop transitions removed 1032 transitions
Redundant transition composition rules discarded 1032 transitions
Iterating global reduction 2 with 1032 rules applied. Total rules applied 1746 place count 54 transition count 1610
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1748 place count 53 transition count 1609
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1752 place count 51 transition count 1627
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 1760 place count 51 transition count 1627
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 1767 place count 51 transition count 1620
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1773 place count 45 transition count 1608
Iterating global reduction 2 with 6 rules applied. Total rules applied 1779 place count 45 transition count 1608
Applied a total of 1779 rules in 3836 ms. Remains 45 /159 variables (removed 114) and now considering 1608/3260 (removed 1652) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/159 places, 1608/3260 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Incomplete random walk after 10000 steps, including 526 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 230854 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230854 steps, saw 66350 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:46:20] [INFO ] Computed 11 place invariants in 26 ms
[2022-06-07 23:46:20] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-07 23:46:21] [INFO ] After 1085ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-07 23:46:22] [INFO ] State equation strengthened by 1058 read => feed constraints.
[2022-06-07 23:46:30] [INFO ] After 8422ms SMT Verify possible using 1058 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-07 23:46:30] [INFO ] After 9941ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-07 23:46:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-06-07 23:46:31] [INFO ] After 1361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-07 23:46:40] [INFO ] After 8372ms SMT Verify possible using 1058 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-07 23:46:40] [INFO ] After 8659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 206 ms.
[2022-06-07 23:46:40] [INFO ] After 10300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 3260/3260 transitions.
Graph (complete) has 1209 edges and 159 vertex of which 149 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.16 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 149 transition count 3251
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 20 place count 139 transition count 3241
Iterating global reduction 1 with 10 rules applied. Total rules applied 30 place count 139 transition count 3241
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 129 transition count 3231
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 129 transition count 3231
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 1 with 20 rules applied. Total rules applied 70 place count 119 transition count 3221
Free-agglomeration rule applied 56 times.
Iterating global reduction 1 with 56 rules applied. Total rules applied 126 place count 119 transition count 3165
Reduce places removed 56 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1025 transitions.
Iterating post reduction 1 with 1081 rules applied. Total rules applied 1207 place count 63 transition count 2140
Renaming transitions due to excessive name length > 1024 char.
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1217 place count 53 transition count 2130
Iterating global reduction 2 with 10 rules applied. Total rules applied 1227 place count 53 transition count 2130
Drop transitions removed 1032 transitions
Redundant transition composition rules discarded 1032 transitions
Iterating global reduction 2 with 1032 rules applied. Total rules applied 2259 place count 53 transition count 1098
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2261 place count 52 transition count 1097
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2265 place count 50 transition count 1115
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 2272 place count 50 transition count 1115
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 2278 place count 50 transition count 1109
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2283 place count 45 transition count 1099
Iterating global reduction 2 with 5 rules applied. Total rules applied 2288 place count 45 transition count 1099
Applied a total of 2288 rules in 2911 ms. Remains 45 /159 variables (removed 114) and now considering 1099/3260 (removed 2161) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/159 places, 1099/3260 transitions.
Finished random walk after 269 steps, including 0 resets, run visited all 1 properties in 29 ms. (steps per millisecond=9 )
Incomplete random walk after 10000 steps, including 526 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 201896 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201896 steps, saw 53990 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:46:46] [INFO ] Computed 11 place invariants in 26 ms
[2022-06-07 23:46:47] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-07 23:46:48] [INFO ] After 1032ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-07 23:46:48] [INFO ] State equation strengthened by 1058 read => feed constraints.
[2022-06-07 23:46:56] [INFO ] After 8385ms SMT Verify possible using 1058 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-07 23:46:56] [INFO ] After 9799ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-07 23:46:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2022-06-07 23:46:58] [INFO ] After 1501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-07 23:47:06] [INFO ] After 8341ms SMT Verify possible using 1058 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-07 23:47:09] [INFO ] Deduced a trap composed of 22 places in 2364 ms of which 1 ms to minimize.
[2022-06-07 23:47:11] [INFO ] Deduced a trap composed of 25 places in 2155 ms of which 1 ms to minimize.
[2022-06-07 23:47:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4863 ms
[2022-06-07 23:47:11] [INFO ] After 13282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2022-06-07 23:47:11] [INFO ] After 14976ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 3260/3260 transitions.
Graph (complete) has 1209 edges and 159 vertex of which 149 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.13 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 149 transition count 3250
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 20 place count 140 transition count 3241
Iterating global reduction 1 with 9 rules applied. Total rules applied 29 place count 140 transition count 3241
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 38 place count 131 transition count 3232
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 131 transition count 3232
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 67 place count 121 transition count 3222
Free-agglomeration rule applied 57 times.
Iterating global reduction 1 with 57 rules applied. Total rules applied 124 place count 121 transition count 3165
Reduce places removed 57 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 513 transitions.
Iterating post reduction 1 with 570 rules applied. Total rules applied 694 place count 64 transition count 2652
Renaming transitions due to excessive name length > 1024 char.
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 704 place count 54 transition count 2642
Iterating global reduction 2 with 10 rules applied. Total rules applied 714 place count 54 transition count 2642
Drop transitions removed 1032 transitions
Redundant transition composition rules discarded 1032 transitions
Iterating global reduction 2 with 1032 rules applied. Total rules applied 1746 place count 54 transition count 1610
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1748 place count 53 transition count 1609
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1752 place count 51 transition count 1627
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 1760 place count 51 transition count 1627
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 1767 place count 51 transition count 1620
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1773 place count 45 transition count 1608
Iterating global reduction 2 with 6 rules applied. Total rules applied 1779 place count 45 transition count 1608
Applied a total of 1779 rules in 3669 ms. Remains 45 /159 variables (removed 114) and now considering 1608/3260 (removed 1652) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/159 places, 1608/3260 transitions.
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=6 )
Incomplete random walk after 10000 steps, including 528 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 219029 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 219029 steps, saw 63654 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3260 rows 159 cols
[2022-06-07 23:47:18] [INFO ] Computed 11 place invariants in 25 ms
[2022-06-07 23:47:18] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-06-07 23:47:20] [INFO ] After 1620ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-07 23:47:20] [INFO ] State equation strengthened by 1058 read => feed constraints.

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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -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 1800 -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="StigmergyCommit-PT-09b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 StigmergyCommit-PT-09b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r301-smll-165463876800132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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