About the Execution of 2023-gold for SieveSingleMsgMbox-PT-d1m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 390.296 | 51256.00 | 78935.00 | 508.10 | 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r395-smll-171683823800031.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is SieveSingleMsgMbox-PT-d1m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683823800031
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 19:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716918038663
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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m04
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-28 17:40:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:40:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:40:42] [INFO ] Load time of PNML (sax parser for PT used): 260 ms
[2024-05-28 17:40:42] [INFO ] Transformed 1295 places.
[2024-05-28 17:40:42] [INFO ] Transformed 749 transitions.
[2024-05-28 17:40:42] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 435 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 1036 places in 20 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2024-05-28 17:40:42] [INFO ] Computed 6 invariants in 64 ms
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 5) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 959 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 964 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1003 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 962 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
[2024-05-28 17:40:43] [INFO ] Invariant cache hit.
[2024-05-28 17:40:43] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-28 17:40:43] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 17:40:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:40:43] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2024-05-28 17:40:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:40:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-28 17:40:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 19 ms returned sat
[2024-05-28 17:40:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:40:44] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2024-05-28 17:40:44] [INFO ] State equation strengthened by 587 read => feed constraints.
[2024-05-28 17:40:44] [INFO ] [Nat]Added 587 Read/Feed constraints in 383 ms returned sat
[2024-05-28 17:40:45] [INFO ] Deduced a trap composed of 32 places in 347 ms of which 9 ms to minimize.
[2024-05-28 17:40:45] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 3 ms to minimize.
[2024-05-28 17:40:45] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 2 ms to minimize.
[2024-05-28 17:40:46] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 2 ms to minimize.
[2024-05-28 17:40:46] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 2 ms to minimize.
[2024-05-28 17:40:46] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 1 ms to minimize.
[2024-05-28 17:40:47] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 1 ms to minimize.
[2024-05-28 17:40:47] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 1 ms to minimize.
[2024-05-28 17:40:47] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 1 ms to minimize.
[2024-05-28 17:40:48] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 1 ms to minimize.
[2024-05-28 17:40:48] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 1 ms to minimize.
[2024-05-28 17:40:48] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 2 ms to minimize.
[2024-05-28 17:40:49] [INFO ] Trap strengthening (SAT) tested/added 12/12 trap constraints in 4106 ms
[2024-05-28 17:40:49] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 17:40:49] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 17:40:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:40:49] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2024-05-28 17:40:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:40:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-28 17:40:49] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 17:40:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:40:49] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2024-05-28 17:40:50] [INFO ] [Nat]Added 587 Read/Feed constraints in 243 ms returned sat
[2024-05-28 17:40:50] [INFO ] Deduced a trap composed of 30 places in 259 ms of which 1 ms to minimize.
[2024-05-28 17:40:50] [INFO ] Deduced a trap composed of 30 places in 313 ms of which 2 ms to minimize.
[2024-05-28 17:40:51] [INFO ] Deduced a trap composed of 33 places in 310 ms of which 1 ms to minimize.
[2024-05-28 17:40:51] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 1 ms to minimize.
[2024-05-28 17:40:51] [INFO ] Deduced a trap composed of 26 places in 309 ms of which 1 ms to minimize.
[2024-05-28 17:40:52] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 1 ms to minimize.
[2024-05-28 17:40:52] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 1 ms to minimize.
[2024-05-28 17:40:52] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 1 ms to minimize.
[2024-05-28 17:40:53] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 1 ms to minimize.
[2024-05-28 17:40:53] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 1 ms to minimize.
[2024-05-28 17:40:53] [INFO ] Deduced a trap composed of 106 places in 195 ms of which 1 ms to minimize.
[2024-05-28 17:40:53] [INFO ] Deduced a trap composed of 95 places in 200 ms of which 1 ms to minimize.
[2024-05-28 17:40:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3887 ms
[2024-05-28 17:40:54] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 145 ms.
[2024-05-28 17:40:54] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 1 ms to minimize.
[2024-05-28 17:40:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 17:40:54] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-28 17:40:54] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 17:40:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:40:55] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2024-05-28 17:40:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:40:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 17:40:55] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 17:40:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:40:55] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2024-05-28 17:40:55] [INFO ] [Nat]Added 587 Read/Feed constraints in 238 ms returned sat
[2024-05-28 17:40:56] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 1 ms to minimize.
[2024-05-28 17:40:56] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 1 ms to minimize.
[2024-05-28 17:40:56] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 1 ms to minimize.
[2024-05-28 17:40:56] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 1 ms to minimize.
[2024-05-28 17:40:57] [INFO ] Deduced a trap composed of 137 places in 220 ms of which 1 ms to minimize.
[2024-05-28 17:40:57] [INFO ] Deduced a trap composed of 143 places in 220 ms of which 1 ms to minimize.
[2024-05-28 17:40:58] [INFO ] Deduced a trap composed of 27 places in 303 ms of which 1 ms to minimize.
[2024-05-28 17:40:58] [INFO ] Deduced a trap composed of 30 places in 301 ms of which 2 ms to minimize.
[2024-05-28 17:40:58] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 1 ms to minimize.
[2024-05-28 17:40:58] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
[2024-05-28 17:40:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3216 ms
[2024-05-28 17:40:59] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 136 ms.
[2024-05-28 17:40:59] [INFO ] Added : 26 causal constraints over 6 iterations in 817 ms. Result :sat
Minimization took 337 ms.
[2024-05-28 17:41:00] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 17:41:00] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 17:41:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:00] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2024-05-28 17:41:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:41:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 17:41:00] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 17:41:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:01] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2024-05-28 17:41:01] [INFO ] [Nat]Added 587 Read/Feed constraints in 330 ms returned sat
[2024-05-28 17:41:01] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 1 ms to minimize.
[2024-05-28 17:41:01] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 1 ms to minimize.
[2024-05-28 17:41:02] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 1 ms to minimize.
[2024-05-28 17:41:02] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 0 ms to minimize.
[2024-05-28 17:41:03] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 1 ms to minimize.
[2024-05-28 17:41:03] [INFO ] Deduced a trap composed of 30 places in 302 ms of which 1 ms to minimize.
[2024-05-28 17:41:03] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 1 ms to minimize.
[2024-05-28 17:41:04] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2024-05-28 17:41:04] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2024-05-28 17:41:04] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 1 ms to minimize.
[2024-05-28 17:41:04] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 1 ms to minimize.
[2024-05-28 17:41:05] [INFO ] Deduced a trap composed of 26 places in 298 ms of which 1 ms to minimize.
[2024-05-28 17:41:05] [INFO ] Deduced a trap composed of 76 places in 297 ms of which 1 ms to minimize.
[2024-05-28 17:41:05] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4124 ms
[2024-05-28 17:41:05] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 107 ms.
[2024-05-28 17:41:05] [INFO ] Added : 5 causal constraints over 1 iterations in 207 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [10, 10, 1, 10] Max seen :[0, 0, 0, 0]
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.6 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 301 place count 183 transition count 269
Iterating global reduction 1 with 58 rules applied. Total rules applied 359 place count 183 transition count 269
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 365 place count 183 transition count 263
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 406 place count 142 transition count 222
Iterating global reduction 2 with 41 rules applied. Total rules applied 447 place count 142 transition count 222
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 459 place count 142 transition count 210
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 483 place count 118 transition count 184
Iterating global reduction 3 with 24 rules applied. Total rules applied 507 place count 118 transition count 184
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 533 place count 118 transition count 158
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 538 place count 113 transition count 151
Iterating global reduction 4 with 5 rules applied. Total rules applied 543 place count 113 transition count 151
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 548 place count 108 transition count 146
Iterating global reduction 4 with 5 rules applied. Total rules applied 553 place count 108 transition count 146
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 555 place count 106 transition count 143
Iterating global reduction 4 with 2 rules applied. Total rules applied 557 place count 106 transition count 143
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 559 place count 104 transition count 141
Iterating global reduction 4 with 2 rules applied. Total rules applied 561 place count 104 transition count 141
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 563 place count 102 transition count 139
Iterating global reduction 4 with 2 rules applied. Total rules applied 565 place count 102 transition count 139
Applied a total of 565 rules in 189 ms. Remains 102 /259 variables (removed 157) and now considering 139/749 (removed 610) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 102/259 places, 139/749 transitions.
// Phase 1: matrix 139 rows 102 cols
[2024-05-28 17:41:06] [INFO ] Computed 4 invariants in 10 ms
Incomplete random walk after 1000000 steps, including 223970 resets, run finished after 1496 ms. (steps per millisecond=668 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103589 resets, run finished after 703 ms. (steps per millisecond=1422 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103080 resets, run finished after 635 ms. (steps per millisecond=1574 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103301 resets, run finished after 638 ms. (steps per millisecond=1567 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103504 resets, run finished after 639 ms. (steps per millisecond=1564 ) properties (out of 4) seen :0
[2024-05-28 17:41:10] [INFO ] Invariant cache hit.
[2024-05-28 17:41:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:41:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:10] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-28 17:41:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:41:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:41:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 17:41:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:10] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-28 17:41:10] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-28 17:41:10] [INFO ] [Nat]Added 70 Read/Feed constraints in 26 ms returned sat
[2024-05-28 17:41:10] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2024-05-28 17:41:10] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:41:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2024-05-28 17:41:10] [INFO ] Computed and/alt/rep : 28/72/28 causal constraints (skipped 110 transitions) in 11 ms.
[2024-05-28 17:41:10] [INFO ] Added : 22 causal constraints over 5 iterations in 95 ms. Result :sat
Minimization took 41 ms.
[2024-05-28 17:41:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:41:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:10] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-28 17:41:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:41:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:41:11] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:41:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:11] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-28 17:41:11] [INFO ] [Nat]Added 70 Read/Feed constraints in 21 ms returned sat
[2024-05-28 17:41:11] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-28 17:41:11] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2024-05-28 17:41:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2024-05-28 17:41:11] [INFO ] Computed and/alt/rep : 28/72/28 causal constraints (skipped 110 transitions) in 11 ms.
[2024-05-28 17:41:11] [INFO ] Added : 22 causal constraints over 5 iterations in 96 ms. Result :sat
Minimization took 38 ms.
[2024-05-28 17:41:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:41:11] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:11] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-28 17:41:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:41:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:41:11] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:41:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:11] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-28 17:41:11] [INFO ] [Nat]Added 70 Read/Feed constraints in 52 ms returned sat
[2024-05-28 17:41:11] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:41:11] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:41:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2024-05-28 17:41:11] [INFO ] Computed and/alt/rep : 28/72/28 causal constraints (skipped 110 transitions) in 16 ms.
[2024-05-28 17:41:11] [INFO ] Added : 22 causal constraints over 5 iterations in 143 ms. Result :sat
Minimization took 61 ms.
[2024-05-28 17:41:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:41:12] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 17:41:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:12] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-28 17:41:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:41:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:41:12] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 17:41:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:12] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-28 17:41:12] [INFO ] [Nat]Added 70 Read/Feed constraints in 24 ms returned sat
[2024-05-28 17:41:12] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:41:12] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2024-05-28 17:41:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2024-05-28 17:41:12] [INFO ] Computed and/alt/rep : 28/72/28 causal constraints (skipped 110 transitions) in 14 ms.
[2024-05-28 17:41:12] [INFO ] Added : 20 causal constraints over 4 iterations in 95 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 1, 10] Max seen :[0, 0, 0, 0]
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 19 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 102/102 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 18 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-05-28 17:41:12] [INFO ] Invariant cache hit.
[2024-05-28 17:41:12] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-28 17:41:12] [INFO ] Invariant cache hit.
[2024-05-28 17:41:13] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-28 17:41:13] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2024-05-28 17:41:13] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-28 17:41:13] [INFO ] Invariant cache hit.
[2024-05-28 17:41:13] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 102/102 places, 139/139 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-06
[2024-05-28 17:41:13] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1027 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2024-05-28 17:41:13] [INFO ] Invariant cache hit.
[2024-05-28 17:41:13] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:41:13] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 17:41:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:13] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-28 17:41:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:41:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:41:13] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 17:41:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:13] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-28 17:41:13] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-28 17:41:13] [INFO ] [Nat]Added 70 Read/Feed constraints in 25 ms returned sat
[2024-05-28 17:41:13] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-05-28 17:41:13] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-05-28 17:41:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2024-05-28 17:41:13] [INFO ] Computed and/alt/rep : 28/72/28 causal constraints (skipped 110 transitions) in 10 ms.
[2024-05-28 17:41:13] [INFO ] Added : 22 causal constraints over 5 iterations in 88 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 99 transition count 119
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 96 transition count 115
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 96 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 96 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 93 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 93 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 91 transition count 107
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 91 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 89 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 89 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 87 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 38 place count 85 transition count 98
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 84 transition count 97
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 83 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 83 transition count 96
Applied a total of 44 rules in 53 ms. Remains 83 /102 variables (removed 19) and now considering 96/139 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 83/102 places, 96/139 transitions.
// Phase 1: matrix 96 rows 83 cols
[2024-05-28 17:41:14] [INFO ] Computed 4 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224148 resets, run finished after 1052 ms. (steps per millisecond=950 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103664 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 1) seen :0
[2024-05-28 17:41:15] [INFO ] Invariant cache hit.
[2024-05-28 17:41:15] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:41:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 17:41:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:15] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-28 17:41:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:41:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:41:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 17:41:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:15] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-28 17:41:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 17:41:15] [INFO ] [Nat]Added 42 Read/Feed constraints in 16 ms returned sat
[2024-05-28 17:41:15] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-28 17:41:15] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-28 17:41:15] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-28 17:41:15] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-28 17:41:16] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-28 17:41:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 285 ms
[2024-05-28 17:41:16] [INFO ] Computed and/alt/rep : 22/52/22 causal constraints (skipped 73 transitions) in 11 ms.
[2024-05-28 17:41:16] [INFO ] Added : 19 causal constraints over 4 iterations in 102 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-28 17:41:16] [INFO ] Invariant cache hit.
[2024-05-28 17:41:16] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-28 17:41:16] [INFO ] Invariant cache hit.
[2024-05-28 17:41:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 17:41:16] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-28 17:41:16] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 17:41:16] [INFO ] Invariant cache hit.
[2024-05-28 17:41:16] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 517 ms. Remains : 83/83 places, 96/96 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-06 in 3297 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-07
// Phase 1: matrix 139 rows 102 cols
[2024-05-28 17:41:16] [INFO ] Computed 4 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1051 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2024-05-28 17:41:16] [INFO ] Invariant cache hit.
[2024-05-28 17:41:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:41:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:16] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-28 17:41:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:41:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:41:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-28 17:41:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:17] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-28 17:41:17] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-28 17:41:17] [INFO ] [Nat]Added 70 Read/Feed constraints in 34 ms returned sat
[2024-05-28 17:41:17] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-28 17:41:17] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2024-05-28 17:41:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2024-05-28 17:41:17] [INFO ] Computed and/alt/rep : 28/72/28 causal constraints (skipped 110 transitions) in 16 ms.
[2024-05-28 17:41:17] [INFO ] Added : 22 causal constraints over 5 iterations in 147 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 99 transition count 119
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 96 transition count 115
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 96 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 96 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 93 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 93 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 91 transition count 107
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 91 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 89 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 89 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 87 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 38 place count 85 transition count 98
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 84 transition count 97
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 83 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 83 transition count 96
Applied a total of 44 rules in 50 ms. Remains 83 /102 variables (removed 19) and now considering 96/139 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 83/102 places, 96/139 transitions.
// Phase 1: matrix 96 rows 83 cols
[2024-05-28 17:41:17] [INFO ] Computed 4 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224292 resets, run finished after 1504 ms. (steps per millisecond=664 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103497 resets, run finished after 799 ms. (steps per millisecond=1251 ) properties (out of 1) seen :0
[2024-05-28 17:41:19] [INFO ] Invariant cache hit.
[2024-05-28 17:41:19] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:41:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:41:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:20] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-28 17:41:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:41:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:41:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:41:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:20] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-28 17:41:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 17:41:20] [INFO ] [Nat]Added 42 Read/Feed constraints in 29 ms returned sat
[2024-05-28 17:41:20] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-28 17:41:20] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-28 17:41:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2024-05-28 17:41:20] [INFO ] Computed and/alt/rep : 22/51/22 causal constraints (skipped 73 transitions) in 10 ms.
[2024-05-28 17:41:20] [INFO ] Added : 19 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-28 17:41:20] [INFO ] Invariant cache hit.
[2024-05-28 17:41:20] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 17:41:20] [INFO ] Invariant cache hit.
[2024-05-28 17:41:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 17:41:20] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2024-05-28 17:41:20] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 17:41:20] [INFO ] Invariant cache hit.
[2024-05-28 17:41:21] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 ms. Remains : 83/83 places, 96/96 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-07 in 4309 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-08
// Phase 1: matrix 139 rows 102 cols
[2024-05-28 17:41:21] [INFO ] Computed 4 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1040 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2024-05-28 17:41:21] [INFO ] Invariant cache hit.
[2024-05-28 17:41:21] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:41:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 17:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:21] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-28 17:41:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:41:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:41:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:41:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:21] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-28 17:41:21] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-28 17:41:21] [INFO ] [Nat]Added 70 Read/Feed constraints in 51 ms returned sat
[2024-05-28 17:41:21] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2024-05-28 17:41:21] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 0 ms to minimize.
[2024-05-28 17:41:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2024-05-28 17:41:21] [INFO ] Computed and/alt/rep : 28/72/28 causal constraints (skipped 110 transitions) in 14 ms.
[2024-05-28 17:41:21] [INFO ] Added : 22 causal constraints over 5 iterations in 139 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 96 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 96 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 96 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 93 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 93 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 93 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 91 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 91 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 89 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 89 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 87 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 87 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 39 place count 85 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 85 transition count 91
Applied a total of 41 rules in 36 ms. Remains 85 /102 variables (removed 17) and now considering 91/139 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 85/102 places, 91/139 transitions.
// Phase 1: matrix 91 rows 85 cols
[2024-05-28 17:41:21] [INFO ] Computed 4 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224618 resets, run finished after 1417 ms. (steps per millisecond=705 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103928 resets, run finished after 525 ms. (steps per millisecond=1904 ) properties (out of 1) seen :0
[2024-05-28 17:41:23] [INFO ] Invariant cache hit.
[2024-05-28 17:41:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 17:41:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:23] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-28 17:41:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:41:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 17:41:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 17:41:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:23] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-28 17:41:23] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-28 17:41:23] [INFO ] [Nat]Added 35 Read/Feed constraints in 10 ms returned sat
[2024-05-28 17:41:24] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:41:24] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:41:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2024-05-28 17:41:24] [INFO ] Computed and/alt/rep : 23/52/23 causal constraints (skipped 67 transitions) in 5 ms.
[2024-05-28 17:41:24] [INFO ] Added : 18 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 85/85 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-28 17:41:24] [INFO ] Invariant cache hit.
[2024-05-28 17:41:24] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 17:41:24] [INFO ] Invariant cache hit.
[2024-05-28 17:41:24] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-28 17:41:24] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-28 17:41:24] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 17:41:24] [INFO ] Invariant cache hit.
[2024-05-28 17:41:24] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 85/85 places, 91/91 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-08 in 3533 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-14
// Phase 1: matrix 139 rows 102 cols
[2024-05-28 17:41:24] [INFO ] Computed 4 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1042 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2024-05-28 17:41:24] [INFO ] Invariant cache hit.
[2024-05-28 17:41:24] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:41:24] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:24] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-28 17:41:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:41:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:41:24] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:41:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:24] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-28 17:41:24] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-28 17:41:24] [INFO ] [Nat]Added 70 Read/Feed constraints in 36 ms returned sat
[2024-05-28 17:41:25] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2024-05-28 17:41:25] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-28 17:41:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2024-05-28 17:41:25] [INFO ] Computed and/alt/rep : 28/72/28 causal constraints (skipped 110 transitions) in 14 ms.
[2024-05-28 17:41:25] [INFO ] Added : 20 causal constraints over 4 iterations in 124 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 99 transition count 119
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 96 transition count 115
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 96 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 96 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 93 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 93 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 91 transition count 107
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 91 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 89 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 89 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 87 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 38 place count 85 transition count 98
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 84 transition count 97
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 83 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 83 transition count 96
Applied a total of 44 rules in 36 ms. Remains 83 /102 variables (removed 19) and now considering 96/139 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 83/102 places, 96/139 transitions.
// Phase 1: matrix 96 rows 83 cols
[2024-05-28 17:41:25] [INFO ] Computed 4 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224022 resets, run finished after 1121 ms. (steps per millisecond=892 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103801 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 1) seen :0
[2024-05-28 17:41:27] [INFO ] Invariant cache hit.
[2024-05-28 17:41:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:41:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 17:41:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:27] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-28 17:41:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:41:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:41:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 17:41:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 17:41:27] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-28 17:41:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 17:41:27] [INFO ] [Nat]Added 42 Read/Feed constraints in 18 ms returned sat
[2024-05-28 17:41:27] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:41:27] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-28 17:41:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2024-05-28 17:41:27] [INFO ] Computed and/alt/rep : 22/51/22 causal constraints (skipped 73 transitions) in 6 ms.
[2024-05-28 17:41:27] [INFO ] Added : 19 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-28 17:41:27] [INFO ] Invariant cache hit.
[2024-05-28 17:41:27] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 17:41:27] [INFO ] Invariant cache hit.
[2024-05-28 17:41:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 17:41:27] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-28 17:41:27] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-28 17:41:27] [INFO ] Invariant cache hit.
[2024-05-28 17:41:27] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 83/83 places, 96/96 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-14 in 3366 ms.
[2024-05-28 17:41:28] [INFO ] Flatten gal took : 90 ms
[2024-05-28 17:41:28] [INFO ] Applying decomposition
[2024-05-28 17:41:28] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12186177186162336813.txt' '-o' '/tmp/graph12186177186162336813.bin' '-w' '/tmp/graph12186177186162336813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12186177186162336813.bin' '-l' '-1' '-v' '-w' '/tmp/graph12186177186162336813.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:41:28] [INFO ] Decomposing Gal with order
[2024-05-28 17:41:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:41:28] [INFO ] Removed a total of 103 redundant transitions.
[2024-05-28 17:41:28] [INFO ] Flatten gal took : 91 ms
[2024-05-28 17:41:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 17 ms.
[2024-05-28 17:41:28] [INFO ] Time to serialize gal into /tmp/UpperBounds18412854292241668893.gal : 14 ms
[2024-05-28 17:41:28] [INFO ] Time to serialize properties into /tmp/UpperBounds9128902124257329997.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18412854292241668893.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9128902124257329997.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds9128902124257329997.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,915,0.090558,4652,219,122,1684,380,363,2066,195,728,0
Total reachable state count : 915
Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d1m04-UpperBounds-06 :0 <= i0.u0.l1189 <= 0
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-06 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m04-UpperBounds-06,0,0.093634,4652,1,0,1684,380,474,2066,235,728,371
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d1m04-UpperBounds-07 :0 <= i0.u0.l1191 <= 0
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-07 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m04-UpperBounds-07,0,0.094017,4652,1,0,1684,380,489,2066,245,728,397
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d1m04-UpperBounds-08 :0 <= i2.u5.l120 <= 0
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-08 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m04-UpperBounds-08,0,0.094377,4652,1,0,1684,380,513,2066,253,728,434
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d1m04-UpperBounds-14 :0 <= i0.u0.l1198 <= 0
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-14 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m04-UpperBounds-14,0,0.09471,4652,1,0,1684,380,528,2066,259,728,460
Total runtime 46919 ms.
BK_STOP 1716918089919
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="SieveSingleMsgMbox-PT-d1m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is SieveSingleMsgMbox-PT-d1m04, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r395-smll-171683823800031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m04.tgz
mv SieveSingleMsgMbox-PT-d1m04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;