Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472283000949.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d2m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472283000949
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 7 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 7 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 7 17:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 7 17:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 7 17:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.1M Jun 6 12:11 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-d2m06-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654958989740

Running Version 202205111006
[2022-06-11 14:49:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 14:49:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 14:49:51] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2022-06-11 14:49:51] [INFO ] Transformed 2398 places.
[2022-06-11 14:49:51] [INFO ] Transformed 1954 transitions.
[2022-06-11 14:49:51] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 322 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1984 places in 19 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2022-06-11 14:49:51] [INFO ] Computed 6 place invariants in 75 ms
Incomplete random walk after 10000 steps, including 2197 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 4) seen :1
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 942 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 943 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
// Phase 1: matrix 1954 rows 414 cols
[2022-06-11 14:49:51] [INFO ] Computed 6 place invariants in 48 ms
[2022-06-11 14:49:52] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-06-11 14:49:52] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 14:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 14:49:52] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2022-06-11 14:49:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 14:49:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 14:49:52] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 14:49:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 14:49:53] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2022-06-11 14:49:53] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2022-06-11 14:49:53] [INFO ] [Nat]Added 1674 Read/Feed constraints in 596 ms returned sat
[2022-06-11 14:49:54] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 405 ms.
[2022-06-11 14:49:55] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 3 ms to minimize.
[2022-06-11 14:49:55] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 1 ms to minimize.
[2022-06-11 14:49:56] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 1 ms to minimize.
[2022-06-11 14:49:56] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 1 ms to minimize.
[2022-06-11 14:49:56] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 2 ms to minimize.
[2022-06-11 14:49:56] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 1 ms to minimize.
[2022-06-11 14:49:57] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 1 ms to minimize.
[2022-06-11 14:49:57] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 2548 ms
[2022-06-11 14:49:57] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 1 ms to minimize.
[2022-06-11 14:49:57] [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 0
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 14:49:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 14:49:57] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 12 ms returned sat
[2022-06-11 14:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 14:49:58] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2022-06-11 14:49:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 14:49:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 14:49:58] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 14:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 14:49:58] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2022-06-11 14:49:59] [INFO ] [Nat]Added 1674 Read/Feed constraints in 418 ms returned sat
[2022-06-11 14:49:59] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 173 ms.
[2022-06-11 14:50:00] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 0 ms to minimize.
[2022-06-11 14:50:00] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 0 ms to minimize.
[2022-06-11 14:50:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 730 ms
[2022-06-11 14:50:01] [INFO ] Added : 29 causal constraints over 7 iterations in 1980 ms. Result :sat
Minimization took 1415 ms.
[2022-06-11 14:50:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 14:50:02] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 14:50:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:03] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2022-06-11 14:50:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 14:50:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 14:50:03] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2022-06-11 14:50:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:03] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2022-06-11 14:50:04] [INFO ] [Nat]Added 1674 Read/Feed constraints in 655 ms returned sat
[2022-06-11 14:50:04] [INFO ] Deduced a trap composed of 30 places in 320 ms of which 1 ms to minimize.
[2022-06-11 14:50:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 638 ms
[2022-06-11 14:50:05] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 176 ms.
[2022-06-11 14:50:05] [INFO ] Added : 24 causal constraints over 5 iterations in 893 ms. Result :sat
Minimization took 469 ms.
Current structural bounds on expressions (after SMT) : [42, 57, 42] Max seen :[0, 0, 0]
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.8 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 374
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 374
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1078 place count 270 transition count 363
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 1163 place count 185 transition count 278
Iterating global reduction 2 with 85 rules applied. Total rules applied 1248 place count 185 transition count 278
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 1277 place count 185 transition count 249
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1319 place count 143 transition count 194
Iterating global reduction 3 with 42 rules applied. Total rules applied 1361 place count 143 transition count 194
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1383 place count 143 transition count 172
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1392 place count 134 transition count 153
Iterating global reduction 4 with 9 rules applied. Total rules applied 1401 place count 134 transition count 153
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1410 place count 125 transition count 144
Iterating global reduction 4 with 9 rules applied. Total rules applied 1419 place count 125 transition count 144
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1424 place count 120 transition count 138
Iterating global reduction 4 with 5 rules applied. Total rules applied 1429 place count 120 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1430 place count 120 transition count 137
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1435 place count 115 transition count 132
Iterating global reduction 5 with 5 rules applied. Total rules applied 1440 place count 115 transition count 132
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1444 place count 111 transition count 128
Iterating global reduction 5 with 4 rules applied. Total rules applied 1448 place count 111 transition count 128
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1450 place count 109 transition count 124
Iterating global reduction 5 with 2 rules applied. Total rules applied 1452 place count 109 transition count 124
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1453 place count 108 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 1454 place count 108 transition count 123
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1455 place count 107 transition count 122
Iterating global reduction 5 with 1 rules applied. Total rules applied 1456 place count 107 transition count 122
Applied a total of 1456 rules in 120 ms. Remains 107 /414 variables (removed 307) and now considering 122/1954 (removed 1832) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/414 places, 122/1954 transitions.
// Phase 1: matrix 122 rows 107 cols
[2022-06-11 14:50:06] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 223997 resets, run finished after 986 ms. (steps per millisecond=1014 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103090 resets, run finished after 514 ms. (steps per millisecond=1945 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103285 resets, run finished after 480 ms. (steps per millisecond=2083 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103391 resets, run finished after 466 ms. (steps per millisecond=2145 ) properties (out of 3) seen :0
// Phase 1: matrix 122 rows 107 cols
[2022-06-11 14:50:08] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-11 14:50:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:09] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-06-11 14:50:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 14:50:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:09] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-11 14:50:09] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:50:09] [INFO ] [Nat]Added 46 Read/Feed constraints in 20 ms returned sat
[2022-06-11 14:50:09] [INFO ] Computed and/alt/rep : 28/80/28 causal constraints (skipped 93 transitions) in 9 ms.
[2022-06-11 14:50:09] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2022-06-11 14:50:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-06-11 14:50:09] [INFO ] Added : 15 causal constraints over 3 iterations in 151 ms. Result :sat
Minimization took 27 ms.
[2022-06-11 14:50:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:09] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-11 14:50:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 14:50:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:09] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Nat]Added 46 Read/Feed constraints in 12 ms returned sat
[2022-06-11 14:50:09] [INFO ] Computed and/alt/rep : 28/80/28 causal constraints (skipped 93 transitions) in 9 ms.
[2022-06-11 14:50:09] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2022-06-11 14:50:09] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2022-06-11 14:50:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2022-06-11 14:50:09] [INFO ] Added : 15 causal constraints over 4 iterations in 208 ms. Result :sat
Minimization took 45 ms.
[2022-06-11 14:50:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:09] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-11 14:50:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 14:50:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:09] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-11 14:50:09] [INFO ] [Nat]Added 46 Read/Feed constraints in 9 ms returned sat
[2022-06-11 14:50:09] [INFO ] Computed and/alt/rep : 28/80/28 causal constraints (skipped 93 transitions) in 7 ms.
[2022-06-11 14:50:09] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2022-06-11 14:50:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2022-06-11 14:50:09] [INFO ] Added : 15 causal constraints over 3 iterations in 111 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [42, 6, 42] Max seen :[0, 0, 0]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 122/122 transitions.
Applied a total of 0 rules in 9 ms. Remains 107 /107 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 122/122 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 122/122 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 107 cols
[2022-06-11 14:50:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:50:10] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 122 rows 107 cols
[2022-06-11 14:50:10] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-11 14:50:10] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:50:10] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2022-06-11 14:50:10] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 122 rows 107 cols
[2022-06-11 14:50:10] [INFO ] Computed 4 place invariants in 9 ms
[2022-06-11 14:50:10] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 122/122 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-03
// Phase 1: matrix 122 rows 107 cols
[2022-06-11 14:50:10] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1001 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 122 rows 107 cols
[2022-06-11 14:50:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:50:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:50:10] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 14:50:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:10] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-11 14:50:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 14:50:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:50:10] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 14:50:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:10] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-11 14:50:10] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:50:10] [INFO ] [Nat]Added 46 Read/Feed constraints in 9 ms returned sat
[2022-06-11 14:50:10] [INFO ] Computed and/alt/rep : 28/80/28 causal constraints (skipped 93 transitions) in 8 ms.
[2022-06-11 14:50:10] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2022-06-11 14:50:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2022-06-11 14:50:10] [INFO ] Added : 15 causal constraints over 3 iterations in 112 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 105 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 105 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 5 place count 105 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 103 transition count 116
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 103 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 103 transition count 114
Applied a total of 11 rules in 12 ms. Remains 103 /107 variables (removed 4) and now considering 114/122 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/107 places, 114/122 transitions.
// Phase 1: matrix 114 rows 103 cols
[2022-06-11 14:50:10] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224429 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103612 resets, run finished after 428 ms. (steps per millisecond=2336 ) properties (out of 1) seen :0
// Phase 1: matrix 114 rows 103 cols
[2022-06-11 14:50:12] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 14:50:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 14:50:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 8 ms returned sat
[2022-06-11 14:50:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:12] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-11 14:50:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 14:50:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 14:50:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 14:50:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:12] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-06-11 14:50:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 14:50:12] [INFO ] [Nat]Added 43 Read/Feed constraints in 12 ms returned sat
[2022-06-11 14:50:12] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 86 transitions) in 8 ms.
[2022-06-11 14:50:12] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2022-06-11 14:50:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-06-11 14:50:12] [INFO ] Added : 15 causal constraints over 3 iterations in 110 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 114/114 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 114/114 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 114/114 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 103 cols
[2022-06-11 14:50:12] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 14:50:12] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 114 rows 103 cols
[2022-06-11 14:50:12] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 14:50:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 14:50:12] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2022-06-11 14:50:12] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 114 rows 103 cols
[2022-06-11 14:50:12] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:50:12] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 114/114 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-03 in 2244 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14
// Phase 1: matrix 122 rows 107 cols
[2022-06-11 14:50:12] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1008 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 122 rows 107 cols
[2022-06-11 14:50:12] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 14:50:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:50:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 14:50:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:12] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-11 14:50:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 14:50:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 14:50:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 14:50:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:12] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-11 14:50:12] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:50:12] [INFO ] [Nat]Added 46 Read/Feed constraints in 10 ms returned sat
[2022-06-11 14:50:12] [INFO ] Computed and/alt/rep : 28/80/28 causal constraints (skipped 93 transitions) in 7 ms.
[2022-06-11 14:50:12] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2022-06-11 14:50:13] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2022-06-11 14:50:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2022-06-11 14:50:13] [INFO ] Added : 15 causal constraints over 4 iterations in 176 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[0]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 105 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 105 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 5 place count 105 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 103 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 103 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 11 place count 103 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 102 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 102 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 101 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 101 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 100 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 100 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 18 place count 100 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 99 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 99 transition count 108
Applied a total of 20 rules in 24 ms. Remains 99 /107 variables (removed 8) and now considering 108/122 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/107 places, 108/122 transitions.
// Phase 1: matrix 108 rows 99 cols
[2022-06-11 14:50:13] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224537 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103656 resets, run finished after 409 ms. (steps per millisecond=2444 ) properties (out of 1) seen :0
// Phase 1: matrix 108 rows 99 cols
[2022-06-11 14:50:14] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 14:50:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 14:50:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 14:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:14] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-11 14:50:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 14:50:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 14:50:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 14:50:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:14] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-11 14:50:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-11 14:50:14] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2022-06-11 14:50:14] [INFO ] Computed and/alt/rep : 25/66/25 causal constraints (skipped 82 transitions) in 6 ms.
[2022-06-11 14:50:14] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2022-06-11 14:50:14] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2022-06-11 14:50:14] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2022-06-11 14:50:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 148 ms
[2022-06-11 14:50:14] [INFO ] Added : 13 causal constraints over 4 iterations in 193 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[0]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 108/108 transitions.
Applied a total of 0 rules in 11 ms. Remains 99 /99 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 108/108 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 99 cols
[2022-06-11 14:50:14] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 14:50:14] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 108 rows 99 cols
[2022-06-11 14:50:14] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 14:50:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-11 14:50:14] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2022-06-11 14:50:15] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 108 rows 99 cols
[2022-06-11 14:50:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:50:15] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 108/108 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 in 2361 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-15
// Phase 1: matrix 122 rows 107 cols
[2022-06-11 14:50:15] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1050 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 122 rows 107 cols
[2022-06-11 14:50:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 14:50:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:50:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 14:50:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:15] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-11 14:50:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 14:50:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:50:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 14:50:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:15] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-06-11 14:50:15] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:50:15] [INFO ] [Nat]Added 46 Read/Feed constraints in 8 ms returned sat
[2022-06-11 14:50:15] [INFO ] Computed and/alt/rep : 28/80/28 causal constraints (skipped 93 transitions) in 10 ms.
[2022-06-11 14:50:15] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2022-06-11 14:50:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2022-06-11 14:50:15] [INFO ] Added : 15 causal constraints over 3 iterations in 133 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 105 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 105 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 103 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 103 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 103 transition count 115
Applied a total of 10 rules in 16 ms. Remains 103 /107 variables (removed 4) and now considering 115/122 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/107 places, 115/122 transitions.
// Phase 1: matrix 115 rows 103 cols
[2022-06-11 14:50:15] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224782 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103305 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 1) seen :0
// Phase 1: matrix 115 rows 103 cols
[2022-06-11 14:50:16] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 14:50:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 14:50:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 14:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:16] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-11 14:50:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 14:50:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:50:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 14:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 14:50:16] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-11 14:50:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 14:50:16] [INFO ] [Nat]Added 43 Read/Feed constraints in 10 ms returned sat
[2022-06-11 14:50:16] [INFO ] Computed and/alt/rep : 27/74/27 causal constraints (skipped 87 transitions) in 8 ms.
[2022-06-11 14:50:16] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2022-06-11 14:50:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2022-06-11 14:50:16] [INFO ] Added : 15 causal constraints over 3 iterations in 123 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 103 cols
[2022-06-11 14:50:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:50:17] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-11 14:50:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 14:50:17] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 14:50:17] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2022-06-11 14:50:17] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-11 14:50:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 14:50:17] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-15 in 2265 ms.
[2022-06-11 14:50:17] [INFO ] Flatten gal took : 40 ms
[2022-06-11 14:50:17] [INFO ] Applying decomposition
[2022-06-11 14:50:17] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13783498045986791903.txt' '-o' '/tmp/graph13783498045986791903.bin' '-w' '/tmp/graph13783498045986791903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13783498045986791903.bin' '-l' '-1' '-v' '-w' '/tmp/graph13783498045986791903.weights' '-q' '0' '-e' '0.001'
[2022-06-11 14:50:17] [INFO ] Decomposing Gal with order
[2022-06-11 14:50:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 14:50:17] [INFO ] Removed a total of 109 redundant transitions.
[2022-06-11 14:50:17] [INFO ] Flatten gal took : 49 ms
[2022-06-11 14:50:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 8 ms.
[2022-06-11 14:50:17] [INFO ] Time to serialize gal into /tmp/UpperBounds5137313501733690242.gal : 6 ms
[2022-06-11 14:50:17] [INFO ] Time to serialize properties into /tmp/UpperBounds14665877629217192353.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5137313501733690242.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14665877629217192353.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds14665877629217192353.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,129086,0.583718,23140,872,431,25797,6268,371,100379,124,35154,0
Total reachable state count : 129086

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m06-UpperBounds-03 :0 <= i0.i0.u23.p125 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-03 1 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-d2m06-UpperBounds-03,0,0.599722,23140,1,0,25797,6268,498,100379,150,35154,970
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 :0 <= i3.u8.l280 <= 2
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 2 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-d2m06-UpperBounds-14,0,0.600838,23140,1,0,25797,6268,530,100379,151,35154,1336
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m06-UpperBounds-15 :0 <= i0.i0.u0.p126 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-15 1 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-d2m06-UpperBounds-15,0,0.601975,23140,1,0,25797,6268,554,100379,162,35154,1748
Total runtime 27447 ms.

BK_STOP 1654959018431

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m06, 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 r312-tall-165472283000949"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m06.tgz
mv SieveSingleMsgMbox-PT-d2m06 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;