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.r323-tall-165472293000355.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 gold2021
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 r323-tall-165472293000355
=====================================================================

--------------------
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 1654794966303

Running Version 0
[2022-06-09 17:16:08] [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-09 17:16:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 17:16:08] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2022-06-09 17:16:08] [INFO ] Transformed 2398 places.
[2022-06-09 17:16:08] [INFO ] Transformed 1954 transitions.
[2022-06-09 17:16:08] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 208 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1984 places in 17 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-09 17:16:08] [INFO ] Computed 6 place invariants in 72 ms
Incomplete random walk after 10000 steps, including 2201 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 4) seen :1
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 883 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 943 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 955 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
// Phase 1: matrix 1954 rows 414 cols
[2022-06-09 17:16:09] [INFO ] Computed 6 place invariants in 33 ms
[2022-06-09 17:16:09] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2022-06-09 17:16:09] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:09] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2022-06-09 17:16:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:16:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:16:09] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:10] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2022-06-09 17:16:10] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2022-06-09 17:16:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:16:14] [INFO ] [Nat]Added 1674 Read/Feed constraints in 4415 ms returned unknown
[2022-06-09 17:16:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:16:15] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:15] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2022-06-09 17:16:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:16:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:16:15] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:15] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2022-06-09 17:16:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:16:19] [INFO ] [Nat]Added 1674 Read/Feed constraints in 3863 ms returned sat
[2022-06-09 17:16:19] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 4 ms to minimize.
[2022-06-09 17:16:20] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 2 ms to minimize.
[2022-06-09 17:16:20] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 17:16:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:16:20] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:20] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2022-06-09 17:16:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:16:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:16:20] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:16:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:21] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2022-06-09 17:16:24] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:16:25] [INFO ] [Nat]Added 1674 Read/Feed constraints in 4626 ms returned unknown
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, 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 122 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-09 17:16:26] [INFO ] Computed 4 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 224387 resets, run finished after 936 ms. (steps per millisecond=1068 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103699 resets, run finished after 482 ms. (steps per millisecond=2074 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103072 resets, run finished after 446 ms. (steps per millisecond=2242 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102927 resets, run finished after 456 ms. (steps per millisecond=2192 ) properties (out of 3) seen :0
// Phase 1: matrix 122 rows 107 cols
[2022-06-09 17:16:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:16:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:16:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:28] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:16:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:16:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:16:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 17:16:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:28] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-09 17:16:28] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-09 17:16:28] [INFO ] [Nat]Added 46 Read/Feed constraints in 10 ms returned sat
[2022-06-09 17:16:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
[2022-06-09 17:16:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2022-06-09 17:16:28] [INFO ] Computed and/alt/rep : 28/80/28 causal constraints (skipped 93 transitions) in 13 ms.
[2022-06-09 17:16:28] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
[2022-06-09 17:16:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-06-09 17:16:28] [INFO ] Added : 27 causal constraints over 6 iterations in 194 ms. Result :sat
Minimization took 44 ms.
[2022-06-09 17:16:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:16:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:28] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:16:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:16:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:16:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:16:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:28] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 17:16:28] [INFO ] [Nat]Added 46 Read/Feed constraints in 10 ms returned sat
[2022-06-09 17:16:28] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2022-06-09 17:16:28] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2022-06-09 17:16:28] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2022-06-09 17:16:29] [INFO ] Deduced a trap composed of 30 places in 18 ms of which 1 ms to minimize.
[2022-06-09 17:16:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 161 ms
[2022-06-09 17:16:29] [INFO ] Computed and/alt/rep : 28/80/28 causal constraints (skipped 93 transitions) in 13 ms.
[2022-06-09 17:16:29] [INFO ] Added : 27 causal constraints over 6 iterations in 94 ms. Result :sat
Minimization took 72 ms.
[2022-06-09 17:16:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:16:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:29] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 17:16:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:16:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:16:29] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:29] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-09 17:16:29] [INFO ] [Nat]Added 46 Read/Feed constraints in 10 ms returned sat
[2022-06-09 17:16:29] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2022-06-09 17:16:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-06-09 17:16:29] [INFO ] Computed and/alt/rep : 28/80/28 causal constraints (skipped 93 transitions) in 15 ms.
[2022-06-09 17:16:29] [INFO ] Added : 26 causal constraints over 6 iterations in 112 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [42, 6, 42] Max seen :[0, 0, 0]
Incomplete Parikh walk after 10900 steps, including 1428 resets, run finished after 19 ms. (steps per millisecond=573 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18300 steps, including 3549 resets, run finished after 29 ms. (steps per millisecond=631 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10900 steps, including 1509 resets, run finished after 17 ms. (steps per millisecond=641 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions, 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, iteration 0 : 107/107 places, 122/122 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 107 cols
[2022-06-09 17:16:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:16:29] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 122 rows 107 cols
[2022-06-09 17:16:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:16:29] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-09 17:16:29] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2022-06-09 17:16:29] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 122 rows 107 cols
[2022-06-09 17:16:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:16:29] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
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-09 17:16:29] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2195 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1043 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-09 17:16:29] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 17:16:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:16:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:30] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:16:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:16:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:16:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:16:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:30] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-06-09 17:16:30] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-09 17:16:30] [INFO ] [Nat]Added 46 Read/Feed constraints in 16 ms returned sat
[2022-06-09 17:16:30] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2022-06-09 17:16:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-06-09 17:16:30] [INFO ] Computed and/alt/rep : 28/80/28 causal constraints (skipped 93 transitions) in 15 ms.
[2022-06-09 17:16:30] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2022-06-09 17:16:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-06-09 17:16:30] [INFO ] Added : 27 causal constraints over 6 iterations in 155 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 10900 steps, including 1494 resets, run finished after 20 ms. (steps per millisecond=545 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions, 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-09 17:16:30] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224284 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102903 resets, run finished after 415 ms. (steps per millisecond=2409 ) properties (out of 1) seen :0
// Phase 1: matrix 114 rows 103 cols
[2022-06-09 17:16:31] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 17:16:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:16:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:31] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:16:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:16:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:16:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:16:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:31] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:16:31] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:16:31] [INFO ] [Nat]Added 43 Read/Feed constraints in 14 ms returned sat
[2022-06-09 17:16:31] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2022-06-09 17:16:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-06-09 17:16:31] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 86 transitions) in 11 ms.
[2022-06-09 17:16:31] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2022-06-09 17:16:31] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2022-06-09 17:16:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2022-06-09 17:16:32] [INFO ] Added : 27 causal constraints over 7 iterations in 199 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 19800 steps, including 3178 resets, run finished after 23 ms. (steps per millisecond=860 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions, 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.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 114/114 transitions.
Starting structural reductions, iteration 0 : 103/103 places, 114/114 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 103 cols
[2022-06-09 17:16:32] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:16:32] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 114 rows 103 cols
[2022-06-09 17:16:32] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:16:32] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:16:32] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2022-06-09 17:16:32] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 114 rows 103 cols
[2022-06-09 17:16:32] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:16:32] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 114/114 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-03 in 2403 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14
// Phase 1: matrix 122 rows 107 cols
[2022-06-09 17:16:32] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1008 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-09 17:16:32] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:16:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:16:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:16:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:32] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:16:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:16:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:16:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:16:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:32] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:16:32] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-09 17:16:32] [INFO ] [Nat]Added 46 Read/Feed constraints in 10 ms returned sat
[2022-06-09 17:16:32] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-06-09 17:16:32] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2022-06-09 17:16:32] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2022-06-09 17:16:32] [INFO ] Deduced a trap composed of 30 places in 19 ms of which 1 ms to minimize.
[2022-06-09 17:16:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 196 ms
[2022-06-09 17:16:32] [INFO ] Computed and/alt/rep : 28/80/28 causal constraints (skipped 93 transitions) in 12 ms.
[2022-06-09 17:16:32] [INFO ] Added : 27 causal constraints over 6 iterations in 91 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[0]
Incomplete Parikh walk after 18300 steps, including 3604 resets, run finished after 24 ms. (steps per millisecond=762 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions, 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 16 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-09 17:16:32] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224290 resets, run finished after 784 ms. (steps per millisecond=1275 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103258 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 1) seen :0
// Phase 1: matrix 108 rows 99 cols
[2022-06-09 17:16:34] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:16:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:16:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:34] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 17:16:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:16:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:16:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:16:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:34] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 17:16:34] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 17:16:34] [INFO ] [Nat]Added 41 Read/Feed constraints in 12 ms returned sat
[2022-06-09 17:16:34] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2022-06-09 17:16:34] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2022-06-09 17:16:34] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2022-06-09 17:16:34] [INFO ] Deduced a trap composed of 30 places in 17 ms of which 0 ms to minimize.
[2022-06-09 17:16:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 165 ms
[2022-06-09 17:16:34] [INFO ] Computed and/alt/rep : 25/66/25 causal constraints (skipped 82 transitions) in 12 ms.
[2022-06-09 17:16:34] [INFO ] Added : 22 causal constraints over 5 iterations in 67 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[0]
Incomplete Parikh walk after 27300 steps, including 5508 resets, run finished after 28 ms. (steps per millisecond=975 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions, 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.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 108/108 transitions.
Starting structural reductions, 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-09 17:16:34] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:16:34] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 108 rows 99 cols
[2022-06-09 17:16:34] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:16:34] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 17:16:34] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2022-06-09 17:16:34] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 108 rows 99 cols
[2022-06-09 17:16:34] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:16:34] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 108/108 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 in 2471 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-15
// Phase 1: matrix 122 rows 107 cols
[2022-06-09 17:16:34] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1045 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-09 17:16:34] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:16:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:16:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:34] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:16:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:16:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:16:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:16:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:34] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:16:34] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-09 17:16:34] [INFO ] [Nat]Added 46 Read/Feed constraints in 10 ms returned sat
[2022-06-09 17:16:34] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2022-06-09 17:16:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-06-09 17:16:35] [INFO ] Computed and/alt/rep : 28/80/28 causal constraints (skipped 93 transitions) in 11 ms.
[2022-06-09 17:16:35] [INFO ] Added : 26 causal constraints over 6 iterations in 96 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 10900 steps, including 1430 resets, run finished after 12 ms. (steps per millisecond=908 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions, 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 7 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-09 17:16:35] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224409 resets, run finished after 816 ms. (steps per millisecond=1225 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103661 resets, run finished after 420 ms. (steps per millisecond=2380 ) properties (out of 1) seen :0
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:16:36] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:16:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:16:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:36] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 17:16:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:16:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:16:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:16:36] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:16:36] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:16:36] [INFO ] [Nat]Added 43 Read/Feed constraints in 10 ms returned sat
[2022-06-09 17:16:36] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2022-06-09 17:16:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2022-06-09 17:16:36] [INFO ] Computed and/alt/rep : 27/74/27 causal constraints (skipped 87 transitions) in 10 ms.
[2022-06-09 17:16:36] [INFO ] Added : 26 causal constraints over 6 iterations in 78 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 25800 steps, including 5246 resets, run finished after 30 ms. (steps per millisecond=860 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions, 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.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Starting structural reductions, 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.
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:16:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:16:36] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:16:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:16:36] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:16:36] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2022-06-09 17:16:36] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:16:36] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:16:37] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-15 in 2197 ms.
[2022-06-09 17:16:37] [INFO ] Flatten gal took : 41 ms
[2022-06-09 17:16:37] [INFO ] Applying decomposition
[2022-06-09 17:16:37] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16079521877893852588.txt, -o, /tmp/graph16079521877893852588.bin, -w, /tmp/graph16079521877893852588.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16079521877893852588.bin, -l, -1, -v, -w, /tmp/graph16079521877893852588.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 17:16:37] [INFO ] Decomposing Gal with order
[2022-06-09 17:16:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 17:16:37] [INFO ] Removed a total of 119 redundant transitions.
[2022-06-09 17:16:37] [INFO ] Flatten gal took : 39 ms
[2022-06-09 17:16:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 9 ms.
[2022-06-09 17:16:37] [INFO ] Time to serialize gal into /tmp/UpperBounds13197518255240958168.gal : 8 ms
[2022-06-09 17:16:37] [INFO ] Time to serialize properties into /tmp/UpperBounds11134560309729381287.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds13197518255240958168.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11134560309729381287.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds13197518255240958168.gal -t CGAL -reachable-file /tmp/UpperBounds11134560309729381287.prop --nowitness
Loading property file /tmp/UpperBounds11134560309729381287.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.354629,16524,872,280,21148,1368,353,53056,108,7274,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 <= i6.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.374956,16524,1,0,21148,1368,482,53056,135,7274,1113
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 :0 <= i4.u9.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.375765,16524,1,0,21148,1368,513,53056,146,7274,1193
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m06-UpperBounds-15 :0 <= i6.u23.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.376285,16524,1,0,21148,1368,534,53056,153,7274,1224

BK_STOP 1654795002804

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="gold2021"
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 gold2021"
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 r323-tall-165472293000355"
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 ;