Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r447-tajo-167905989500052.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is SieveSingleMsgMbox-PT-d1m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r447-tajo-167905989500052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679573601223

Running Version 202205111006
[2023-03-23 12:13:22] [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]
[2023-03-23 12:13:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:13:22] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-23 12:13:22] [INFO ] Transformed 1295 places.
[2023-03-23 12:13:22] [INFO ] Transformed 749 transitions.
[2023-03-23 12:13:22] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 233 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1036 places in 14 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2023-03-23 12:13:22] [INFO ] Computed 6 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 2221 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 5) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 980 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1007 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 981 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 936 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
// Phase 1: matrix 749 rows 259 cols
[2023-03-23 12:13:23] [INFO ] Computed 6 place invariants in 15 ms
[2023-03-23 12:13:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 10 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:23] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2023-03-23 12:13:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:23] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-23 12:13:23] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-23 12:13:23] [INFO ] [Nat]Added 587 Read/Feed constraints in 136 ms returned sat
[2023-03-23 12:13:23] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 4 ms to minimize.
[2023-03-23 12:13:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-23 12:13:24] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 129 ms.
[2023-03-23 12:13:24] [INFO ] Added : 22 causal constraints over 5 iterations in 414 ms. Result :sat
Minimization took 100 ms.
[2023-03-23 12:13:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:13:24] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-23 12:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:24] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2023-03-23 12:13:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:13:24] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-23 12:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:25] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Nat]Added 587 Read/Feed constraints in 133 ms returned sat
[2023-03-23 12:13:25] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2023-03-23 12:13:25] [INFO ] Deduced a trap composed of 86 places in 170 ms of which 2 ms to minimize.
[2023-03-23 12:13:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 413 ms
[2023-03-23 12:13:25] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 104 ms.
[2023-03-23 12:13:26] [INFO ] Added : 20 causal constraints over 4 iterations in 400 ms. Result :sat
Minimization took 197 ms.
[2023-03-23 12:13:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 18 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:26] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2023-03-23 12:13:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:26] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Nat]Added 587 Read/Feed constraints in 181 ms returned sat
[2023-03-23 12:13:27] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 96 ms.
[2023-03-23 12:13:27] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 1 ms to minimize.
[2023-03-23 12:13:27] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 0 ms to minimize.
[2023-03-23 12:13:28] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 1 ms to minimize.
[2023-03-23 12:13:28] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 1 ms to minimize.
[2023-03-23 12:13:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 992 ms
[2023-03-23 12:13:28] [INFO ] Added : 22 causal constraints over 6 iterations in 1481 ms. Result :sat
Minimization took 205 ms.
[2023-03-23 12:13:28] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:28] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-23 12:13:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:13:28] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-23 12:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:29] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2023-03-23 12:13:29] [INFO ] [Nat]Added 587 Read/Feed constraints in 118 ms returned sat
[2023-03-23 12:13:29] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 1 ms to minimize.
[2023-03-23 12:13:29] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 1 ms to minimize.
[2023-03-23 12:13:29] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 0 ms to minimize.
[2023-03-23 12:13:29] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 0 ms to minimize.
[2023-03-23 12:13:30] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 1 ms to minimize.
[2023-03-23 12:13:30] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 0 ms to minimize.
[2023-03-23 12:13:30] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 1 ms to minimize.
[2023-03-23 12:13:30] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 0 ms to minimize.
[2023-03-23 12:13:30] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 1 ms to minimize.
[2023-03-23 12:13:31] [INFO ] Deduced a trap composed of 159 places in 129 ms of which 1 ms to minimize.
[2023-03-23 12:13:31] [INFO ] Deduced a trap composed of 158 places in 137 ms of which 0 ms to minimize.
[2023-03-23 12:13:31] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 0 ms to minimize.
[2023-03-23 12:13:31] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2023-03-23 12:13:32] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 1 ms to minimize.
[2023-03-23 12:13:32] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 1 ms to minimize.
[2023-03-23 12:13:32] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 0 ms to minimize.
[2023-03-23 12:13:32] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 0 ms to minimize.
[2023-03-23 12:13:33] [INFO ] Deduced a trap composed of 69 places in 150 ms of which 1 ms to minimize.
[2023-03-23 12:13:33] [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 3
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.verifyPossible(DeadlockTester.java:918)
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)
Current structural bounds on expressions (after SMT) : [1, 10, 29, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 242 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.6 ms
Discarding 17 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 226 transitions.
Iterating post reduction 0 with 226 rules applied. Total rules applied 227 place count 242 transition count 523
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 288 place count 181 transition count 231
Iterating global reduction 1 with 61 rules applied. Total rules applied 349 place count 181 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 355 place count 181 transition count 225
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 397 place count 139 transition count 183
Iterating global reduction 2 with 42 rules applied. Total rules applied 439 place count 139 transition count 183
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 454 place count 139 transition count 168
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 478 place count 115 transition count 142
Iterating global reduction 3 with 24 rules applied. Total rules applied 502 place count 115 transition count 142
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 516 place count 115 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 522 place count 109 transition count 119
Iterating global reduction 4 with 6 rules applied. Total rules applied 528 place count 109 transition count 119
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 534 place count 103 transition count 113
Iterating global reduction 4 with 6 rules applied. Total rules applied 540 place count 103 transition count 113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 543 place count 100 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 546 place count 100 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 547 place count 100 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 549 place count 98 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 551 place count 98 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 552 place count 97 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 553 place count 97 transition count 106
Applied a total of 553 rules in 94 ms. Remains 97 /259 variables (removed 162) and now considering 106/749 (removed 643) transitions.
Finished structural reductions, in 1 iterations. Remains : 97/259 places, 106/749 transitions.
// Phase 1: matrix 106 rows 97 cols
[2023-03-23 12:13:34] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224127 resets, run finished after 1010 ms. (steps per millisecond=990 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103236 resets, run finished after 526 ms. (steps per millisecond=1901 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103678 resets, run finished after 472 ms. (steps per millisecond=2118 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103951 resets, run finished after 441 ms. (steps per millisecond=2267 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102951 resets, run finished after 436 ms. (steps per millisecond=2293 ) properties (out of 4) seen :0
// Phase 1: matrix 106 rows 97 cols
[2023-03-23 12:13:37] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 12:13:37] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:37] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:37] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-23 12:13:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:37] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:37] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-23 12:13:37] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-23 12:13:37] [INFO ] [Nat]Added 41 Read/Feed constraints in 13 ms returned sat
[2023-03-23 12:13:37] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2023-03-23 12:13:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-23 12:13:37] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 11 ms.
[2023-03-23 12:13:37] [INFO ] Added : 18 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 22 ms.
[2023-03-23 12:13:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:37] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:37] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-23 12:13:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:37] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:37] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 12:13:37] [INFO ] [Nat]Added 41 Read/Feed constraints in 7 ms returned sat
[2023-03-23 12:13:37] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2023-03-23 12:13:37] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
[2023-03-23 12:13:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2023-03-23 12:13:37] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 9 ms.
[2023-03-23 12:13:38] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-23 12:13:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-23 12:13:38] [INFO ] Added : 18 causal constraints over 5 iterations in 140 ms. Result :sat
Minimization took 31 ms.
[2023-03-23 12:13:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:38] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-23 12:13:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:38] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 12:13:38] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2023-03-23 12:13:38] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 7 ms.
[2023-03-23 12:13:38] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2023-03-23 12:13:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-23 12:13:38] [INFO ] Added : 13 causal constraints over 3 iterations in 163 ms. Result :sat
Minimization took 40 ms.
[2023-03-23 12:13:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:38] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-23 12:13:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:38] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-23 12:13:38] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2023-03-23 12:13:38] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 8 ms.
[2023-03-23 12:13:38] [INFO ] Added : 6 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1, 10, 29, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 97/97 places, 106/106 transitions.
Applied a total of 0 rules in 9 ms. Remains 97 /97 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 97/97 places, 106/106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 97/97 places, 106/106 transitions.
Applied a total of 0 rules in 8 ms. Remains 97 /97 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 97 cols
[2023-03-23 12:13:38] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 12:13:38] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 106 rows 97 cols
[2023-03-23 12:13:38] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-23 12:13:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-23 12:13:39] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-23 12:13:39] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 97 cols
[2023-03-23 12:13:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:39] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/97 places, 106/106 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-01
// Phase 1: matrix 106 rows 97 cols
[2023-03-23 12:13:39] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1067 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 106 rows 97 cols
[2023-03-23 12:13:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:39] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-23 12:13:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:39] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-23 12:13:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-23 12:13:39] [INFO ] [Nat]Added 41 Read/Feed constraints in 14 ms returned sat
[2023-03-23 12:13:39] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2023-03-23 12:13:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-23 12:13:39] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 12 ms.
[2023-03-23 12:13:39] [INFO ] Added : 18 causal constraints over 4 iterations in 73 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [17] Max seen :[0]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 97/97 places, 106/106 transitions.
Graph (complete) has 269 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 94 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 94 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 94 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 92 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 92 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 92 transition count 99
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 14 place count 90 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 90 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 88 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 88 transition count 95
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 86 transition count 92
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 86 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 86 transition count 91
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 27 place count 84 transition count 89
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 84 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 83 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 83 transition count 88
Applied a total of 31 rules in 39 ms. Remains 83 /97 variables (removed 14) and now considering 88/106 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/97 places, 88/106 transitions.
// Phase 1: matrix 88 rows 83 cols
[2023-03-23 12:13:39] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224270 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103651 resets, run finished after 357 ms. (steps per millisecond=2801 ) properties (out of 1) seen :0
// Phase 1: matrix 88 rows 83 cols
[2023-03-23 12:13:41] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:41] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:41] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-23 12:13:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:13:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:41] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-23 12:13:41] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-23 12:13:41] [INFO ] [Nat]Added 33 Read/Feed constraints in 9 ms returned sat
[2023-03-23 12:13:41] [INFO ] Computed and/alt/rep : 23/51/23 causal constraints (skipped 64 transitions) in 8 ms.
[2023-03-23 12:13:41] [INFO ] Added : 19 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 9 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 88/88 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 83 cols
[2023-03-23 12:13:41] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:41] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 88 rows 83 cols
[2023-03-23 12:13:41] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-23 12:13:41] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-23 12:13:41] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-23 12:13:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 88 rows 83 cols
[2023-03-23 12:13:41] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:41] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 88/88 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-01 in 2449 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-08
// Phase 1: matrix 106 rows 97 cols
[2023-03-23 12:13:41] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2237 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1035 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 106 rows 97 cols
[2023-03-23 12:13:41] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:41] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-23 12:13:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:41] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-23 12:13:41] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-23 12:13:41] [INFO ] [Nat]Added 41 Read/Feed constraints in 15 ms returned sat
[2023-03-23 12:13:41] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2023-03-23 12:13:41] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 1 ms to minimize.
[2023-03-23 12:13:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2023-03-23 12:13:42] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 8 ms.
[2023-03-23 12:13:42] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-23 12:13:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-23 12:13:42] [INFO ] Added : 18 causal constraints over 5 iterations in 118 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 97/97 places, 106/106 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 94 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 94 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 94 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 91 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 91 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 91 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 88 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 88 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 85 transition count 91
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 85 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 82 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 82 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 82 transition count 85
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 79 transition count 82
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 79 transition count 82
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 77 transition count 80
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 77 transition count 80
Applied a total of 44 rules in 25 ms. Remains 77 /97 variables (removed 20) and now considering 80/106 (removed 26) transitions.
Finished structural reductions, in 1 iterations. Remains : 77/97 places, 80/106 transitions.
// Phase 1: matrix 80 rows 77 cols
[2023-03-23 12:13:42] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224889 resets, run finished after 783 ms. (steps per millisecond=1277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103523 resets, run finished after 358 ms. (steps per millisecond=2793 ) properties (out of 1) seen :0
// Phase 1: matrix 80 rows 77 cols
[2023-03-23 12:13:43] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:43] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:43] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-23 12:13:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-23 12:13:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:43] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-23 12:13:43] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 12:13:43] [INFO ] [Nat]Added 31 Read/Feed constraints in 8 ms returned sat
[2023-03-23 12:13:43] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 59 transitions) in 7 ms.
[2023-03-23 12:13:43] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 3 ms to minimize.
[2023-03-23 12:13:43] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-23 12:13:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2023-03-23 12:13:43] [INFO ] Added : 16 causal constraints over 5 iterations in 170 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 77/77 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 77/77 places, 80/80 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 77/77 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 77 cols
[2023-03-23 12:13:43] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:43] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 80 rows 77 cols
[2023-03-23 12:13:43] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:43] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 12:13:43] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-23 12:13:43] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 80 rows 77 cols
[2023-03-23 12:13:43] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:44] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 77/77 places, 80/80 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-08 in 2327 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-10
// Phase 1: matrix 106 rows 97 cols
[2023-03-23 12:13:44] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2239 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1040 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 106 rows 97 cols
[2023-03-23 12:13:44] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:44] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:44] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-23 12:13:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:44] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:44] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 12:13:44] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-23 12:13:44] [INFO ] [Nat]Added 41 Read/Feed constraints in 17 ms returned sat
[2023-03-23 12:13:44] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 9 ms.
[2023-03-23 12:13:44] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-03-23 12:13:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-23 12:13:44] [INFO ] Added : 13 causal constraints over 3 iterations in 139 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 97/97 places, 106/106 transitions.
Graph (complete) has 269 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 94 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 94 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 92 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 92 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 92 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 90 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 90 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 88 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 88 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 86 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 86 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 84 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 84 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 82 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 82 transition count 88
Applied a total of 31 rules in 28 ms. Remains 82 /97 variables (removed 15) and now considering 88/106 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/97 places, 88/106 transitions.
// Phase 1: matrix 88 rows 82 cols
[2023-03-23 12:13:44] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224211 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103444 resets, run finished after 408 ms. (steps per millisecond=2450 ) properties (out of 1) seen :0
// Phase 1: matrix 88 rows 82 cols
[2023-03-23 12:13:45] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:45] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:45] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-23 12:13:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:45] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-23 12:13:45] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-23 12:13:45] [INFO ] [Nat]Added 34 Read/Feed constraints in 8 ms returned sat
[2023-03-23 12:13:45] [INFO ] Computed and/alt/rep : 22/52/22 causal constraints (skipped 65 transitions) in 6 ms.
[2023-03-23 12:13:45] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-23 12:13:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-23 12:13:45] [INFO ] Added : 16 causal constraints over 4 iterations in 126 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 88/88 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 82 cols
[2023-03-23 12:13:46] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:46] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2023-03-23 12:13:46] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:46] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-23 12:13:46] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-23 12:13:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2023-03-23 12:13:46] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 12:13:46] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 88/88 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-10 in 2332 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-11
// Phase 1: matrix 106 rows 97 cols
[2023-03-23 12:13:46] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1026 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 106 rows 97 cols
[2023-03-23 12:13:46] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:46] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:46] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-23 12:13:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:46] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-23 12:13:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-23 12:13:46] [INFO ] [Nat]Added 41 Read/Feed constraints in 7 ms returned sat
[2023-03-23 12:13:46] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 8 ms.
[2023-03-23 12:13:46] [INFO ] Added : 6 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 97/97 places, 106/106 transitions.
Graph (complete) has 269 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 94 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 94 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 94 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 92 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 92 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 92 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 90 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 90 transition count 96
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 19 place count 88 transition count 94
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 88 transition count 94
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 86 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 86 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 86 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 84 transition count 88
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 84 transition count 88
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 31 place count 83 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 83 transition count 87
Applied a total of 32 rules in 18 ms. Remains 83 /97 variables (removed 14) and now considering 87/106 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/97 places, 87/106 transitions.
// Phase 1: matrix 87 rows 83 cols
[2023-03-23 12:13:46] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224197 resets, run finished after 795 ms. (steps per millisecond=1257 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103769 resets, run finished after 455 ms. (steps per millisecond=2197 ) properties (out of 1) seen :0
// Phase 1: matrix 87 rows 83 cols
[2023-03-23 12:13:47] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:47] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-23 12:13:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:48] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 12:13:48] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-23 12:13:48] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2023-03-23 12:13:48] [INFO ] Computed and/alt/rep : 22/49/22 causal constraints (skipped 64 transitions) in 5 ms.
[2023-03-23 12:13:48] [INFO ] Added : 8 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 87/87 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 83 cols
[2023-03-23 12:13:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-23 12:13:48] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 87 rows 83 cols
[2023-03-23 12:13:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:48] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-23 12:13:48] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-23 12:13:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 87 rows 83 cols
[2023-03-23 12:13:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:48] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 87/87 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-11 in 2007 ms.
[2023-03-23 12:13:48] [INFO ] Flatten gal took : 36 ms
[2023-03-23 12:13:48] [INFO ] Applying decomposition
[2023-03-23 12:13:48] [INFO ] Flatten gal took : 12 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/graph2147627163943080904.txt' '-o' '/tmp/graph2147627163943080904.bin' '-w' '/tmp/graph2147627163943080904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2147627163943080904.bin' '-l' '-1' '-v' '-w' '/tmp/graph2147627163943080904.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:13:48] [INFO ] Decomposing Gal with order
[2023-03-23 12:13:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:13:48] [INFO ] Removed a total of 105 redundant transitions.
[2023-03-23 12:13:48] [INFO ] Flatten gal took : 46 ms
[2023-03-23 12:13:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 8 ms.
[2023-03-23 12:13:48] [INFO ] Time to serialize gal into /tmp/UpperBounds11474972801515978940.gal : 6 ms
[2023-03-23 12:13:48] [INFO ] Time to serialize properties into /tmp/UpperBounds3501730578096588575.prop : 0 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/UpperBounds11474972801515978940.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3501730578096588575.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/UpperBounds3501730578096588575.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,68989,0.519721,19612,804,205,24487,3143,369,77212,65,17171,0
Total reachable state count : 68989

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m06-UpperBounds-01 :0 <= i3.i0.u7.p13 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-01 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-d1m06-UpperBounds-01,0,0.541028,19612,1,0,24487,3143,484,77212,84,17171,1112
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m06-UpperBounds-08 :0 <= i7.i1.u25.l1017 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-08 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-d1m06-UpperBounds-08,0,0.541952,19612,1,0,24487,3143,516,77212,89,17171,1379
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m06-UpperBounds-10 :0 <= i7.i0.u24.p73 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-10 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-d1m06-UpperBounds-10,0,0.542442,19612,1,0,24487,3143,537,77212,94,17171,1516
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m06-UpperBounds-11 :0 <= i5.u17.p41 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-11 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-d1m06-UpperBounds-11,0,0.542679,19612,1,0,24487,3143,559,77212,94,17171,1602
Total runtime 26901 ms.

BK_STOP 1679573629428

--------------------
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-d1m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is SieveSingleMsgMbox-PT-d1m06, 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 r447-tajo-167905989500052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m06.tgz
mv SieveSingleMsgMbox-PT-d1m06 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 ;