fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813598200650
Last Updated
May 14, 2023

About the Execution of LTSMin+red for AutonomousCar-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1624.367 3600000.00 14121957.00 87.40 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813598200650.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is AutonomousCar-PT-08b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200650
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 517K Mar 5 18:22 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 AutonomousCar-PT-08b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678639246967

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:40:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:40:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:40:50] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-12 16:40:50] [INFO ] Transformed 357 places.
[2023-03-12 16:40:50] [INFO ] Transformed 1128 transitions.
[2023-03-12 16:40:50] [INFO ] Found NUPN structural information;
[2023-03-12 16:40:50] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 75 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 312 transition count 1083
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 312 transition count 1083
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 346 place count 312 transition count 827
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 354 place count 304 transition count 819
Iterating global reduction 1 with 8 rules applied. Total rules applied 362 place count 304 transition count 819
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 363 place count 303 transition count 818
Iterating global reduction 1 with 1 rules applied. Total rules applied 364 place count 303 transition count 818
Applied a total of 364 rules in 74 ms. Remains 303 /357 variables (removed 54) and now considering 818/1128 (removed 310) transitions.
// Phase 1: matrix 818 rows 303 cols
[2023-03-12 16:40:51] [INFO ] Computed 13 place invariants in 28 ms
[2023-03-12 16:40:51] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-03-12 16:40:51] [INFO ] Invariant cache hit.
[2023-03-12 16:40:52] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
[2023-03-12 16:40:52] [INFO ] Invariant cache hit.
[2023-03-12 16:40:53] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/357 places, 818/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2438 ms. Remains : 303/357 places, 818/1128 transitions.
Support contains 75 out of 303 places after structural reductions.
[2023-03-12 16:40:54] [INFO ] Flatten gal took : 144 ms
[2023-03-12 16:40:54] [INFO ] Flatten gal took : 136 ms
[2023-03-12 16:40:54] [INFO ] Input system was already deterministic with 818 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 76) seen :25
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) 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 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Running SMT prover for 51 properties.
[2023-03-12 16:40:55] [INFO ] Invariant cache hit.
[2023-03-12 16:40:56] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-12 16:40:58] [INFO ] After 1983ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:51
[2023-03-12 16:40:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 16:41:04] [INFO ] After 4847ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :48
[2023-03-12 16:41:09] [INFO ] Deduced a trap composed of 5 places in 1441 ms of which 9 ms to minimize.
[2023-03-12 16:41:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1527 ms
[2023-03-12 16:41:09] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2023-03-12 16:41:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-12 16:41:14] [INFO ] After 14123ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :48
Attempting to minimize the solution found.
Minimization took 5019 ms.
[2023-03-12 16:41:19] [INFO ] After 20624ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :48
Fused 51 Parikh solutions to 48 different solutions.
Parikh walk visited 0 properties in 769 ms.
Support contains 55 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 818/818 transitions.
Graph (trivial) has 215 edges and 303 vertex of which 4 / 303 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1330 edges and 301 vertex of which 299 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 299 transition count 720
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 133 rules applied. Total rules applied 229 place count 207 transition count 679
Reduce places removed 24 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 28 rules applied. Total rules applied 257 place count 183 transition count 675
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 263 place count 179 transition count 673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 264 place count 178 transition count 673
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 264 place count 178 transition count 661
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 288 place count 166 transition count 661
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 292 place count 162 transition count 657
Iterating global reduction 5 with 4 rules applied. Total rules applied 296 place count 162 transition count 657
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 374 place count 123 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 375 place count 123 transition count 617
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 377 place count 121 transition count 601
Iterating global reduction 6 with 2 rules applied. Total rules applied 379 place count 121 transition count 601
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 381 place count 121 transition count 599
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 7 with 2 rules applied. Total rules applied 383 place count 120 transition count 598
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 384 place count 120 transition count 597
Free-agglomeration rule applied 20 times.
Iterating global reduction 7 with 20 rules applied. Total rules applied 404 place count 120 transition count 577
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 424 place count 100 transition count 577
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 425 place count 100 transition count 576
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 428 place count 100 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 429 place count 99 transition count 575
Applied a total of 429 rules in 268 ms. Remains 99 /303 variables (removed 204) and now considering 575/818 (removed 243) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 99/303 places, 575/818 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 48) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
// Phase 1: matrix 575 rows 99 cols
[2023-03-12 16:41:20] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-12 16:41:21] [INFO ] [Real]Absence check using 13 positive place invariants in 105 ms returned sat
[2023-03-12 16:41:22] [INFO ] After 1536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-12 16:41:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:41:25] [INFO ] After 2433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :34
[2023-03-12 16:41:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:41:27] [INFO ] After 2196ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :34
[2023-03-12 16:41:28] [INFO ] Deduced a trap composed of 16 places in 312 ms of which 3 ms to minimize.
[2023-03-12 16:41:28] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 14 ms to minimize.
[2023-03-12 16:41:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 565 ms
[2023-03-12 16:41:30] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 0 ms to minimize.
[2023-03-12 16:41:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-12 16:41:30] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 0 ms to minimize.
[2023-03-12 16:41:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2023-03-12 16:41:31] [INFO ] After 6375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :34
Attempting to minimize the solution found.
Minimization took 2577 ms.
[2023-03-12 16:41:34] [INFO ] After 11766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :34
Parikh walk visited 0 properties in 480 ms.
Support contains 43 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 575/575 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 99 transition count 573
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 97 transition count 573
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 94 transition count 570
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 93 transition count 569
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 93 transition count 569
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 93 transition count 566
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 90 transition count 566
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 90 transition count 566
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 89 transition count 565
Applied a total of 20 rules in 179 ms. Remains 89 /99 variables (removed 10) and now considering 565/575 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 89/99 places, 565/575 transitions.
Incomplete random walk after 10000 steps, including 296 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Interrupted probabilistic random walk after 404223 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{0=1, 5=1}
Probabilistic random walk after 404223 steps, saw 69103 distinct states, run finished after 3002 ms. (steps per millisecond=134 ) properties seen :2
Running SMT prover for 30 properties.
// Phase 1: matrix 565 rows 89 cols
[2023-03-12 16:41:38] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-12 16:41:39] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 16:41:39] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-12 16:41:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 16:41:42] [INFO ] After 2617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-03-12 16:41:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:41:44] [INFO ] After 2809ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :30
[2023-03-12 16:41:47] [INFO ] After 5513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 1818 ms.
[2023-03-12 16:41:49] [INFO ] After 10265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
Parikh walk visited 0 properties in 191 ms.
Support contains 41 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 565/565 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 563
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 87 transition count 555
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 87 transition count 555
Applied a total of 13 rules in 48 ms. Remains 87 /89 variables (removed 2) and now considering 555/565 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 87/89 places, 555/565 transitions.
Incomplete random walk after 10000 steps, including 209 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 555 rows 87 cols
[2023-03-12 16:41:50] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-12 16:41:50] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 16:41:50] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-12 16:41:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 16:41:52] [INFO ] After 1911ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-12 16:41:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:41:54] [INFO ] After 1512ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-03-12 16:41:56] [INFO ] Deduced a trap composed of 6 places in 356 ms of which 1 ms to minimize.
[2023-03-12 16:41:56] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 0 ms to minimize.
[2023-03-12 16:41:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 743 ms
[2023-03-12 16:41:57] [INFO ] After 5009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 1686 ms.
[2023-03-12 16:41:59] [INFO ] After 8869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 0 properties in 213 ms.
Support contains 41 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 555/555 transitions.
Applied a total of 0 rules in 17 ms. Remains 87 /87 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 87/87 places, 555/555 transitions.
Incomplete random walk after 10000 steps, including 249 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 26) seen :3
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-12 16:42:00] [INFO ] Invariant cache hit.
[2023-03-12 16:42:00] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 16:42:00] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-12 16:42:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:42:02] [INFO ] After 1491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-12 16:42:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:42:03] [INFO ] After 1439ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-03-12 16:42:05] [INFO ] After 3146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 1487 ms.
[2023-03-12 16:42:06] [INFO ] After 6301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 217 ms.
Support contains 39 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 555/555 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 554
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 86 transition count 554
Applied a total of 3 rules in 96 ms. Remains 86 /87 variables (removed 1) and now considering 554/555 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 86/87 places, 554/555 transitions.
Incomplete random walk after 10000 steps, including 232 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 379639 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{3=1, 4=1, 8=1, 16=1}
Probabilistic random walk after 379639 steps, saw 60626 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :4
Running SMT prover for 17 properties.
// Phase 1: matrix 554 rows 86 cols
[2023-03-12 16:42:10] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-12 16:42:10] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:42:11] [INFO ] After 1311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-12 16:42:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:42:13] [INFO ] After 1191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-12 16:42:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:42:14] [INFO ] After 896ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-12 16:42:15] [INFO ] After 2193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 1015 ms.
[2023-03-12 16:42:16] [INFO ] After 4527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 102 ms.
Support contains 34 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 554/554 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 86 transition count 553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 85 transition count 553
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 84 transition count 545
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 84 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 84 transition count 544
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 8 place count 84 transition count 541
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 19 place count 81 transition count 533
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 81 transition count 533
Applied a total of 20 rules in 61 ms. Remains 81 /86 variables (removed 5) and now considering 533/554 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 81/86 places, 533/554 transitions.
Incomplete random walk after 10000 steps, including 46 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 17) seen :3
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 533 rows 81 cols
[2023-03-12 16:42:17] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-12 16:42:17] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 16:42:17] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:42:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 66 ms returned sat
[2023-03-12 16:42:18] [INFO ] After 375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 16:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:42:18] [INFO ] After 326ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 16:42:19] [INFO ] After 716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 327 ms.
[2023-03-12 16:42:19] [INFO ] After 1639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 55 ms.
Support contains 20 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 533/533 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 80 transition count 525
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 525
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 80 transition count 524
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 77 transition count 521
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 19 place count 72 transition count 516
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 72 transition count 512
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 43 place count 68 transition count 496
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 68 transition count 496
Applied a total of 44 rules in 87 ms. Remains 68 /81 variables (removed 13) and now considering 496/533 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 68/81 places, 496/533 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 496 rows 68 cols
[2023-03-12 16:42:19] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-12 16:42:20] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 16:42:20] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:42:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 16:42:21] [INFO ] After 595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 16:42:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:42:21] [INFO ] After 256ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 16:42:21] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-12 16:42:22] [INFO ] After 1663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 59 ms.
Support contains 19 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 496/496 transitions.
Applied a total of 0 rules in 32 ms. Remains 68 /68 variables (removed 0) and now considering 496/496 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 68/68 places, 496/496 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 16:42:22] [INFO ] Invariant cache hit.
[2023-03-12 16:42:22] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:42:22] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:42:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:42:23] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:42:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:42:23] [INFO ] After 231ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 16:42:23] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-12 16:42:23] [INFO ] After 1093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 17 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 496/496 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 495
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 67 transition count 495
Applied a total of 3 rules in 65 ms. Remains 67 /68 variables (removed 1) and now considering 495/496 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 67/68 places, 495/496 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 895383 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{1=1}
Probabilistic random walk after 895383 steps, saw 126971 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 495 rows 67 cols
[2023-03-12 16:42:27] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-12 16:42:27] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 16:42:27] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:42:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 16:42:27] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:42:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:42:27] [INFO ] After 162ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:42:27] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-12 16:42:28] [INFO ] After 745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 15 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 495/495 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 494
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 494
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 66 transition count 494
Applied a total of 3 rules in 60 ms. Remains 66 /67 variables (removed 1) and now considering 494/495 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 66/67 places, 494/495 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 984438 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 984438 steps, saw 139013 distinct states, run finished after 3004 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 494 rows 66 cols
[2023-03-12 16:42:31] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-12 16:42:31] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 16:42:31] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:42:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:42:32] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:42:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:42:32] [INFO ] After 90ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:42:32] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-12 16:42:32] [INFO ] After 766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 15 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 494/494 transitions.
Applied a total of 0 rules in 24 ms. Remains 66 /66 variables (removed 0) and now considering 494/494 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 66/66 places, 494/494 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 494/494 transitions.
Applied a total of 0 rules in 15 ms. Remains 66 /66 variables (removed 0) and now considering 494/494 (removed 0) transitions.
[2023-03-12 16:42:32] [INFO ] Invariant cache hit.
[2023-03-12 16:42:32] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-12 16:42:32] [INFO ] Invariant cache hit.
[2023-03-12 16:42:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:42:33] [INFO ] Implicit Places using invariants and state equation in 934 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1135 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/66 places, 494/494 transitions.
Applied a total of 0 rules in 12 ms. Remains 65 /65 variables (removed 0) and now considering 494/494 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1187 ms. Remains : 65/66 places, 494/494 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1036032 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :{}
Probabilistic random walk after 1036032 steps, saw 146233 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 494 rows 65 cols
[2023-03-12 16:42:36] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:42:37] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:42:37] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:42:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:42:37] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:42:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:42:37] [INFO ] After 158ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:42:38] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 196 ms.
[2023-03-12 16:42:38] [INFO ] After 892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 15 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 494/494 transitions.
Applied a total of 0 rules in 13 ms. Remains 65 /65 variables (removed 0) and now considering 494/494 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 65/65 places, 494/494 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 494/494 transitions.
Applied a total of 0 rules in 25 ms. Remains 65 /65 variables (removed 0) and now considering 494/494 (removed 0) transitions.
[2023-03-12 16:42:38] [INFO ] Invariant cache hit.
[2023-03-12 16:42:38] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-12 16:42:38] [INFO ] Invariant cache hit.
[2023-03-12 16:42:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:42:38] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-12 16:42:38] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 16:42:38] [INFO ] Invariant cache hit.
[2023-03-12 16:42:39] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 772 ms. Remains : 65/65 places, 494/494 transitions.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-12 16:42:39] [INFO ] Flatten gal took : 59 ms
[2023-03-12 16:42:39] [INFO ] Flatten gal took : 59 ms
[2023-03-12 16:42:39] [INFO ] Input system was already deterministic with 818 transitions.
Computed a total of 51 stabilizing places and 52 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Graph (trivial) has 243 edges and 303 vertex of which 4 / 303 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 300 transition count 710
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 148 rules applied. Total rules applied 254 place count 195 transition count 667
Reduce places removed 25 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 28 rules applied. Total rules applied 282 place count 170 transition count 664
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 287 place count 167 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 288 place count 166 transition count 662
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 288 place count 166 transition count 652
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 308 place count 156 transition count 652
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 314 place count 150 transition count 646
Iterating global reduction 5 with 6 rules applied. Total rules applied 320 place count 150 transition count 646
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 323 place count 147 transition count 629
Iterating global reduction 5 with 3 rules applied. Total rules applied 326 place count 147 transition count 629
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 330 place count 147 transition count 625
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 332 place count 145 transition count 625
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 402 place count 110 transition count 590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 403 place count 110 transition count 589
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 408 place count 105 transition count 549
Iterating global reduction 8 with 5 rules applied. Total rules applied 413 place count 105 transition count 549
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 8 with 8 rules applied. Total rules applied 421 place count 105 transition count 541
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 425 place count 101 transition count 541
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 10 with 2 rules applied. Total rules applied 427 place count 100 transition count 540
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 428 place count 100 transition count 539
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 430 place count 98 transition count 537
Applied a total of 430 rules in 204 ms. Remains 98 /303 variables (removed 205) and now considering 537/818 (removed 281) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 204 ms. Remains : 98/303 places, 537/818 transitions.
[2023-03-12 16:42:39] [INFO ] Flatten gal took : 57 ms
[2023-03-12 16:42:39] [INFO ] Flatten gal took : 59 ms
[2023-03-12 16:42:39] [INFO ] Input system was already deterministic with 537 transitions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 294 transition count 809
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 294 transition count 809
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 291 transition count 806
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 291 transition count 806
Applied a total of 24 rules in 31 ms. Remains 291 /303 variables (removed 12) and now considering 806/818 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 291/303 places, 806/818 transitions.
[2023-03-12 16:42:39] [INFO ] Flatten gal took : 49 ms
[2023-03-12 16:42:39] [INFO ] Flatten gal took : 49 ms
[2023-03-12 16:42:40] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 296 transition count 811
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 296 transition count 811
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 294 transition count 809
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 294 transition count 809
Applied a total of 18 rules in 18 ms. Remains 294 /303 variables (removed 9) and now considering 809/818 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 294/303 places, 809/818 transitions.
[2023-03-12 16:42:40] [INFO ] Flatten gal took : 44 ms
[2023-03-12 16:42:40] [INFO ] Flatten gal took : 46 ms
[2023-03-12 16:42:40] [INFO ] Input system was already deterministic with 809 transitions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 296 transition count 811
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 296 transition count 811
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 293 transition count 808
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 293 transition count 808
Applied a total of 20 rules in 17 ms. Remains 293 /303 variables (removed 10) and now considering 808/818 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 293/303 places, 808/818 transitions.
[2023-03-12 16:42:40] [INFO ] Flatten gal took : 44 ms
[2023-03-12 16:42:40] [INFO ] Flatten gal took : 43 ms
[2023-03-12 16:42:40] [INFO ] Input system was already deterministic with 808 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Graph (trivial) has 271 edges and 303 vertex of which 4 / 303 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 300 transition count 698
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 163 rules applied. Total rules applied 281 place count 183 transition count 652
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 308 place count 156 transition count 652
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 308 place count 156 transition count 645
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 322 place count 149 transition count 645
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 328 place count 143 transition count 639
Iterating global reduction 3 with 6 rules applied. Total rules applied 334 place count 143 transition count 639
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 337 place count 140 transition count 622
Iterating global reduction 3 with 3 rules applied. Total rules applied 340 place count 140 transition count 622
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 344 place count 140 transition count 618
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 346 place count 138 transition count 618
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 434 place count 94 transition count 574
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 435 place count 94 transition count 573
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 447 place count 82 transition count 471
Iterating global reduction 6 with 12 rules applied. Total rules applied 459 place count 82 transition count 471
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 12 rules applied. Total rules applied 471 place count 82 transition count 459
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 477 place count 76 transition count 459
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 8 with 2 rules applied. Total rules applied 479 place count 75 transition count 458
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 480 place count 75 transition count 457
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 482 place count 73 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 483 place count 72 transition count 455
Applied a total of 483 rules in 116 ms. Remains 72 /303 variables (removed 231) and now considering 455/818 (removed 363) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 116 ms. Remains : 72/303 places, 455/818 transitions.
[2023-03-12 16:42:40] [INFO ] Flatten gal took : 42 ms
[2023-03-12 16:42:40] [INFO ] Flatten gal took : 42 ms
[2023-03-12 16:42:40] [INFO ] Input system was already deterministic with 455 transitions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 295 transition count 810
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 295 transition count 810
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 292 transition count 807
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 292 transition count 807
Applied a total of 22 rules in 15 ms. Remains 292 /303 variables (removed 11) and now considering 807/818 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 292/303 places, 807/818 transitions.
[2023-03-12 16:42:41] [INFO ] Flatten gal took : 43 ms
[2023-03-12 16:42:41] [INFO ] Flatten gal took : 46 ms
[2023-03-12 16:42:41] [INFO ] Input system was already deterministic with 807 transitions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 295 transition count 810
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 295 transition count 810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 293 transition count 808
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 293 transition count 808
Applied a total of 20 rules in 12 ms. Remains 293 /303 variables (removed 10) and now considering 808/818 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 293/303 places, 808/818 transitions.
[2023-03-12 16:42:41] [INFO ] Flatten gal took : 41 ms
[2023-03-12 16:42:41] [INFO ] Flatten gal took : 43 ms
[2023-03-12 16:42:41] [INFO ] Input system was already deterministic with 808 transitions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 294 transition count 809
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 294 transition count 809
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 291 transition count 806
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 291 transition count 806
Applied a total of 24 rules in 12 ms. Remains 291 /303 variables (removed 12) and now considering 806/818 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 291/303 places, 806/818 transitions.
[2023-03-12 16:42:41] [INFO ] Flatten gal took : 41 ms
[2023-03-12 16:42:41] [INFO ] Flatten gal took : 44 ms
[2023-03-12 16:42:41] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Graph (trivial) has 286 edges and 303 vertex of which 4 / 303 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 300 transition count 698
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 163 rules applied. Total rules applied 281 place count 183 transition count 652
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 308 place count 156 transition count 652
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 308 place count 156 transition count 646
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 320 place count 150 transition count 646
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 326 place count 144 transition count 640
Iterating global reduction 3 with 6 rules applied. Total rules applied 332 place count 144 transition count 640
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 335 place count 141 transition count 623
Iterating global reduction 3 with 3 rules applied. Total rules applied 338 place count 141 transition count 623
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 342 place count 141 transition count 619
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 344 place count 139 transition count 619
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 448 place count 87 transition count 567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 449 place count 87 transition count 566
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 462 place count 74 transition count 455
Iterating global reduction 6 with 13 rules applied. Total rules applied 475 place count 74 transition count 455
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 12 rules applied. Total rules applied 487 place count 74 transition count 443
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 493 place count 68 transition count 443
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 8 with 2 rules applied. Total rules applied 495 place count 67 transition count 442
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 496 place count 67 transition count 441
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 498 place count 65 transition count 439
Applied a total of 498 rules in 103 ms. Remains 65 /303 variables (removed 238) and now considering 439/818 (removed 379) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 104 ms. Remains : 65/303 places, 439/818 transitions.
[2023-03-12 16:42:41] [INFO ] Flatten gal took : 39 ms
[2023-03-12 16:42:41] [INFO ] Flatten gal took : 42 ms
[2023-03-12 16:42:41] [INFO ] Input system was already deterministic with 439 transitions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 295 transition count 810
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 295 transition count 810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 293 transition count 808
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 293 transition count 808
Applied a total of 20 rules in 11 ms. Remains 293 /303 variables (removed 10) and now considering 808/818 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 293/303 places, 808/818 transitions.
[2023-03-12 16:42:41] [INFO ] Flatten gal took : 41 ms
[2023-03-12 16:42:42] [INFO ] Flatten gal took : 44 ms
[2023-03-12 16:42:42] [INFO ] Input system was already deterministic with 808 transitions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 294 transition count 809
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 294 transition count 809
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 291 transition count 806
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 291 transition count 806
Applied a total of 24 rules in 23 ms. Remains 291 /303 variables (removed 12) and now considering 806/818 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 291/303 places, 806/818 transitions.
[2023-03-12 16:42:42] [INFO ] Flatten gal took : 56 ms
[2023-03-12 16:42:42] [INFO ] Flatten gal took : 44 ms
[2023-03-12 16:42:42] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Graph (trivial) has 286 edges and 303 vertex of which 4 / 303 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 300 transition count 698
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 163 rules applied. Total rules applied 281 place count 183 transition count 652
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 308 place count 156 transition count 652
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 308 place count 156 transition count 646
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 320 place count 150 transition count 646
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 325 place count 145 transition count 641
Iterating global reduction 3 with 5 rules applied. Total rules applied 330 place count 145 transition count 641
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 332 place count 143 transition count 625
Iterating global reduction 3 with 2 rules applied. Total rules applied 334 place count 143 transition count 625
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 338 place count 143 transition count 621
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 340 place count 141 transition count 621
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 444 place count 89 transition count 569
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 445 place count 89 transition count 568
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 458 place count 76 transition count 456
Iterating global reduction 6 with 13 rules applied. Total rules applied 471 place count 76 transition count 456
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 481 place count 76 transition count 446
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 486 place count 71 transition count 446
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 8 with 2 rules applied. Total rules applied 488 place count 70 transition count 445
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 489 place count 70 transition count 444
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 491 place count 68 transition count 442
Applied a total of 491 rules in 101 ms. Remains 68 /303 variables (removed 235) and now considering 442/818 (removed 376) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 101 ms. Remains : 68/303 places, 442/818 transitions.
[2023-03-12 16:42:42] [INFO ] Flatten gal took : 43 ms
[2023-03-12 16:42:42] [INFO ] Flatten gal took : 44 ms
[2023-03-12 16:42:42] [INFO ] Input system was already deterministic with 442 transitions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 294 transition count 809
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 294 transition count 809
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 291 transition count 806
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 291 transition count 806
Applied a total of 24 rules in 25 ms. Remains 291 /303 variables (removed 12) and now considering 806/818 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 291/303 places, 806/818 transitions.
[2023-03-12 16:42:42] [INFO ] Flatten gal took : 50 ms
[2023-03-12 16:42:42] [INFO ] Flatten gal took : 40 ms
[2023-03-12 16:42:42] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 294 transition count 809
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 294 transition count 809
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 291 transition count 806
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 291 transition count 806
Applied a total of 24 rules in 11 ms. Remains 291 /303 variables (removed 12) and now considering 806/818 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 291/303 places, 806/818 transitions.
[2023-03-12 16:42:43] [INFO ] Flatten gal took : 40 ms
[2023-03-12 16:42:43] [INFO ] Flatten gal took : 42 ms
[2023-03-12 16:42:43] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 294 transition count 809
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 294 transition count 809
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 291 transition count 806
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 291 transition count 806
Applied a total of 24 rules in 10 ms. Remains 291 /303 variables (removed 12) and now considering 806/818 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 291/303 places, 806/818 transitions.
[2023-03-12 16:42:43] [INFO ] Flatten gal took : 37 ms
[2023-03-12 16:42:43] [INFO ] Flatten gal took : 39 ms
[2023-03-12 16:42:43] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 818/818 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 294 transition count 809
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 294 transition count 809
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 291 transition count 806
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 291 transition count 806
Applied a total of 24 rules in 10 ms. Remains 291 /303 variables (removed 12) and now considering 806/818 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 291/303 places, 806/818 transitions.
[2023-03-12 16:42:43] [INFO ] Flatten gal took : 37 ms
[2023-03-12 16:42:43] [INFO ] Flatten gal took : 39 ms
[2023-03-12 16:42:43] [INFO ] Input system was already deterministic with 806 transitions.
[2023-03-12 16:42:43] [INFO ] Flatten gal took : 57 ms
[2023-03-12 16:42:43] [INFO ] Flatten gal took : 45 ms
[2023-03-12 16:42:43] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-12 16:42:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 303 places, 818 transitions and 7298 arcs took 6 ms.
Total runtime 113111 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/620/ctl_0_ --ctl=/tmp/620/ctl_1_ --ctl=/tmp/620/ctl_2_ --ctl=/tmp/620/ctl_3_ --ctl=/tmp/620/ctl_4_ --ctl=/tmp/620/ctl_5_ --ctl=/tmp/620/ctl_6_ --ctl=/tmp/620/ctl_7_ --ctl=/tmp/620/ctl_8_ --ctl=/tmp/620/ctl_9_ --ctl=/tmp/620/ctl_10_ --ctl=/tmp/620/ctl_11_ --ctl=/tmp/620/ctl_12_ --ctl=/tmp/620/ctl_13_ --ctl=/tmp/620/ctl_14_ --ctl=/tmp/620/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 15328288 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097408 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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="AutonomousCar-PT-08b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-08b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598200650"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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