fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r281-smll-167863551100383
Last Updated
May 14, 2023

About the Execution of Smart+red for Peterson-PT-3

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
303.199 199468.00 376445.00 523.50 F normal

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.r281-smll-167863551100383.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Peterson-PT-3, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r281-smll-167863551100383
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 29K Feb 25 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 25 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 25 22:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 93K Feb 25 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 439K Feb 25 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 283K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 143K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678923504472

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=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-3
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 23:38:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-15 23:38:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 23:38:27] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2023-03-15 23:38:27] [INFO ] Transformed 244 places.
[2023-03-15 23:38:27] [INFO ] Transformed 332 transitions.
[2023-03-15 23:38:27] [INFO ] Found NUPN structural information;
[2023-03-15 23:38:27] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-15 23:38:27] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 228 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 820 ms. (steps per millisecond=12 ) properties (out of 244) seen :140
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 104) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 104) seen :0
Running SMT prover for 104 properties.
[2023-03-15 23:38:28] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-15 23:38:28] [INFO ] Computed 15 place invariants in 18 ms
[2023-03-15 23:38:29] [INFO ] After 1134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:104
[2023-03-15 23:38:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-15 23:38:30] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 23:38:32] [INFO ] After 1554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :104
[2023-03-15 23:38:32] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 23:38:34] [INFO ] After 1523ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :104
[2023-03-15 23:38:34] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 17 ms to minimize.
[2023-03-15 23:38:34] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 2 ms to minimize.
[2023-03-15 23:38:34] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 1 ms to minimize.
[2023-03-15 23:38:34] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 4 ms to minimize.
[2023-03-15 23:38:35] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 0 ms to minimize.
[2023-03-15 23:38:35] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 0 ms to minimize.
[2023-03-15 23:38:35] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 1 ms to minimize.
[2023-03-15 23:38:35] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2023-03-15 23:38:35] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2023-03-15 23:38:35] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2023-03-15 23:38:35] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2023-03-15 23:38:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1470 ms
[2023-03-15 23:38:36] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 1 ms to minimize.
[2023-03-15 23:38:36] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-15 23:38:36] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 1 ms to minimize.
[2023-03-15 23:38:36] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2023-03-15 23:38:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 625 ms
[2023-03-15 23:38:36] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2023-03-15 23:38:36] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2023-03-15 23:38:36] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2023-03-15 23:38:36] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2023-03-15 23:38:36] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2023-03-15 23:38:37] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-15 23:38:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 575 ms
[2023-03-15 23:38:37] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2023-03-15 23:38:37] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2023-03-15 23:38:37] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 0 ms to minimize.
[2023-03-15 23:38:37] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2023-03-15 23:38:37] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2023-03-15 23:38:37] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2023-03-15 23:38:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 579 ms
[2023-03-15 23:38:37] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2023-03-15 23:38:37] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2023-03-15 23:38:37] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2023-03-15 23:38:38] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2023-03-15 23:38:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 388 ms
[2023-03-15 23:38:38] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 0 ms to minimize.
[2023-03-15 23:38:38] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2023-03-15 23:38:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2023-03-15 23:38:38] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2023-03-15 23:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-15 23:38:38] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 6 ms to minimize.
[2023-03-15 23:38:38] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 0 ms to minimize.
[2023-03-15 23:38:38] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2023-03-15 23:38:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 333 ms
[2023-03-15 23:38:38] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2023-03-15 23:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-15 23:38:39] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 0 ms to minimize.
[2023-03-15 23:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-15 23:38:39] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 2 ms to minimize.
[2023-03-15 23:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-15 23:38:39] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 1 ms to minimize.
[2023-03-15 23:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-15 23:38:39] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 1 ms to minimize.
[2023-03-15 23:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-15 23:38:39] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2023-03-15 23:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-15 23:38:40] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 1 ms to minimize.
[2023-03-15 23:38:40] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2023-03-15 23:38:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2023-03-15 23:38:40] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 0 ms to minimize.
[2023-03-15 23:38:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-15 23:38:40] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 0 ms to minimize.
[2023-03-15 23:38:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-15 23:38:40] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2023-03-15 23:38:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-15 23:38:41] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 0 ms to minimize.
[2023-03-15 23:38:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-15 23:38:41] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 0 ms to minimize.
[2023-03-15 23:38:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-15 23:38:41] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2023-03-15 23:38:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-15 23:38:42] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2023-03-15 23:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-15 23:38:42] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2023-03-15 23:38:42] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2023-03-15 23:38:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2023-03-15 23:38:43] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2023-03-15 23:38:43] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 2 ms to minimize.
[2023-03-15 23:38:43] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 1 ms to minimize.
[2023-03-15 23:38:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 293 ms
[2023-03-15 23:38:43] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2023-03-15 23:38:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-15 23:38:43] [INFO ] After 11039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :104
Attempting to minimize the solution found.
Minimization took 1993 ms.
[2023-03-15 23:38:45] [INFO ] After 16178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :104
Parikh walk visited 45 properties in 3830 ms.
Support contains 59 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 244 transition count 268
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 180 transition count 268
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 128 place count 180 transition count 230
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 204 place count 142 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 214 place count 137 transition count 225
Applied a total of 214 rules in 45 ms. Remains 137 /244 variables (removed 107) and now considering 225/332 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 137/244 places, 225/332 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 28658 ms. (steps per millisecond=34 ) properties (out of 59) seen :8
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 474 ms. (steps per millisecond=210 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=259 ) properties (out of 50) seen :6
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=268 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 612 ms. (steps per millisecond=163 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1306 ms. (steps per millisecond=76 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1196 ms. (steps per millisecond=83 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1241 ms. (steps per millisecond=80 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 746 ms. (steps per millisecond=134 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1136 ms. (steps per millisecond=88 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1100 ms. (steps per millisecond=90 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1204 ms. (steps per millisecond=83 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1155 ms. (steps per millisecond=86 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1131 ms. (steps per millisecond=88 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1214 ms. (steps per millisecond=82 ) properties (out of 44) seen :7
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 641 ms. (steps per millisecond=156 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=177 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=182 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 541 ms. (steps per millisecond=184 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=186 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=180 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 547 ms. (steps per millisecond=182 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=162 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=190 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=189 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=168 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 579 ms. (steps per millisecond=172 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=171 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=181 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=183 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 541 ms. (steps per millisecond=184 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 552 ms. (steps per millisecond=181 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=174 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 588 ms. (steps per millisecond=170 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=178 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 593 ms. (steps per millisecond=168 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=181 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 529 ms. (steps per millisecond=189 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=188 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=187 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 531 ms. (steps per millisecond=188 ) properties (out of 37) seen :0
Running SMT prover for 37 properties.
[2023-03-15 23:39:46] [INFO ] Flow matrix only has 201 transitions (discarded 24 similar events)
// Phase 1: matrix 201 rows 137 cols
[2023-03-15 23:39:46] [INFO ] Computed 15 place invariants in 5 ms
[2023-03-15 23:39:46] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:37
[2023-03-15 23:39:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 23:39:46] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 23:39:46] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :37
[2023-03-15 23:39:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 23:39:47] [INFO ] After 355ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :37
[2023-03-15 23:39:47] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2023-03-15 23:39:47] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2023-03-15 23:39:47] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2023-03-15 23:39:47] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2023-03-15 23:39:47] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2023-03-15 23:39:47] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2023-03-15 23:39:47] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2023-03-15 23:39:47] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2023-03-15 23:39:47] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2023-03-15 23:39:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 593 ms
[2023-03-15 23:39:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2023-03-15 23:39:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 199 ms
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 438 ms
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2023-03-15 23:39:48] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2023-03-15 23:39:49] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2023-03-15 23:39:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 162 ms
[2023-03-15 23:39:49] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2023-03-15 23:39:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-15 23:39:49] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2023-03-15 23:39:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-15 23:39:49] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2023-03-15 23:39:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-15 23:39:49] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2023-03-15 23:39:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-15 23:39:49] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-15 23:39:49] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-15 23:39:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-15 23:39:49] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2023-03-15 23:39:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-15 23:39:49] [INFO ] After 2843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :37
Attempting to minimize the solution found.
Minimization took 358 ms.
[2023-03-15 23:39:50] [INFO ] After 3892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :37
Parikh walk visited 1 properties in 853 ms.
Support contains 36 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 225/225 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 137 transition count 211
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 123 transition count 211
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 28 place count 123 transition count 207
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 119 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 118 transition count 206
Applied a total of 38 rules in 25 ms. Remains 118 /137 variables (removed 19) and now considering 206/225 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 118/137 places, 206/225 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 29358 ms. (steps per millisecond=34 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 671 ms. (steps per millisecond=149 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 674 ms. (steps per millisecond=148 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 659 ms. (steps per millisecond=151 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 581 ms. (steps per millisecond=172 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=180 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=187 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 549 ms. (steps per millisecond=182 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=176 ) properties (out of 36) seen :4
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 542 ms. (steps per millisecond=184 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=177 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=191 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=181 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=185 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 540 ms. (steps per millisecond=185 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 542 ms. (steps per millisecond=184 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 533 ms. (steps per millisecond=187 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 809 ms. (steps per millisecond=123 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1122 ms. (steps per millisecond=89 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1061 ms. (steps per millisecond=94 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 742 ms. (steps per millisecond=134 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 736 ms. (steps per millisecond=135 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 708 ms. (steps per millisecond=141 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 740 ms. (steps per millisecond=135 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 738 ms. (steps per millisecond=135 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1002 ms. (steps per millisecond=99 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1087 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1106 ms. (steps per millisecond=90 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1123 ms. (steps per millisecond=89 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1075 ms. (steps per millisecond=93 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 774 ms. (steps per millisecond=129 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 657 ms. (steps per millisecond=152 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 687 ms. (steps per millisecond=145 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-15 23:40:44] [INFO ] Flow matrix only has 182 transitions (discarded 24 similar events)
// Phase 1: matrix 182 rows 118 cols
[2023-03-15 23:40:44] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-15 23:40:44] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-15 23:40:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 23:40:44] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 23:40:45] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-15 23:40:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 23:40:45] [INFO ] After 326ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-15 23:40:45] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2023-03-15 23:40:45] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-15 23:40:45] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2023-03-15 23:40:45] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2023-03-15 23:40:45] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2023-03-15 23:40:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 385 ms
[2023-03-15 23:40:45] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2023-03-15 23:40:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-15 23:40:45] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-03-15 23:40:45] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 187 ms
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 357 ms
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 230 ms
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-15 23:40:46] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2023-03-15 23:40:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-15 23:40:47] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2023-03-15 23:40:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-15 23:40:47] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-15 23:40:47] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2023-03-15 23:40:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-03-15 23:40:47] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2023-03-15 23:40:47] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2023-03-15 23:40:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2023-03-15 23:40:47] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2023-03-15 23:40:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-15 23:40:47] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2023-03-15 23:40:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-15 23:40:47] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2023-03-15 23:40:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-15 23:40:47] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2023-03-15 23:40:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-15 23:40:47] [INFO ] After 2851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 341 ms.
[2023-03-15 23:40:48] [INFO ] After 3798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Parikh walk visited 0 properties in 3 ms.
Support contains 32 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 206/206 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 118 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 116 transition count 204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 116 transition count 203
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 115 transition count 203
Applied a total of 6 rules in 15 ms. Remains 115 /118 variables (removed 3) and now considering 203/206 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 115/118 places, 203/206 transitions.
Interrupted random walk after 965496 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 680 ms. (steps per millisecond=147 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=151 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 688 ms. (steps per millisecond=145 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 693 ms. (steps per millisecond=144 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 694 ms. (steps per millisecond=144 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 715 ms. (steps per millisecond=139 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 962 ms. (steps per millisecond=103 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1053 ms. (steps per millisecond=94 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1072 ms. (steps per millisecond=93 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 685 ms. (steps per millisecond=145 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=148 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=164 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=147 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 690 ms. (steps per millisecond=144 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 687 ms. (steps per millisecond=145 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 690 ms. (steps per millisecond=144 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 693 ms. (steps per millisecond=144 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=147 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 688 ms. (steps per millisecond=145 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 688 ms. (steps per millisecond=145 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 670 ms. (steps per millisecond=149 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 678 ms. (steps per millisecond=147 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 684 ms. (steps per millisecond=146 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 704 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 690 ms. (steps per millisecond=144 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 696 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 705 ms. (steps per millisecond=141 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 681 ms. (steps per millisecond=146 ) properties (out of 32) seen :0
Finished probabilistic random walk after 243920 steps, run visited all 32 properties in 1772 ms. (steps per millisecond=137 )
Probabilistic random walk after 243920 steps, saw 48936 distinct states, run finished after 1772 ms. (steps per millisecond=137 ) properties seen :32
Able to resolve query StableMarking after proving 244 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 195960 ms.
ITS solved all properties within timeout

BK_STOP 1678923703940

--------------------
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 StableMarking -timeout 180 -rebuildPNML

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="Peterson-PT-3"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is Peterson-PT-3, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r281-smll-167863551100383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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