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.r425-tajo-167905978200429.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 ltsminxred
Input is SieveSingleMsgMbox-PT-d1m36, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978200429
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 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-d1m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679316018273

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m36
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:40:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 12:40:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:40:20] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-20 12:40:20] [INFO ] Transformed 1295 places.
[2023-03-20 12:40:20] [INFO ] Transformed 749 transitions.
[2023-03-20 12:40:20] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2023-03-20 12:40:20] [INFO ] Computed 6 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 2211 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 988 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 951 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 972 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-20 12:40:20] [INFO ] Invariant cache hit.
[2023-03-20 12:40:20] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-20 12:40:20] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:40:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:20] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2023-03-20 12:40:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:40:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 12:40:21] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:40:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:21] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-03-20 12:40:21] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-20 12:40:21] [INFO ] [Nat]Added 587 Read/Feed constraints in 140 ms returned sat
[2023-03-20 12:40:21] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 4 ms to minimize.
[2023-03-20 12:40:21] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 1 ms to minimize.
[2023-03-20 12:40:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2023-03-20 12:40:21] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 162 ms.
[2023-03-20 12:40:22] [INFO ] Added : 18 causal constraints over 4 iterations in 451 ms. Result :sat
Minimization took 178 ms.
[2023-03-20 12:40:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 12:40:22] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 11 ms returned sat
[2023-03-20 12:40:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:22] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2023-03-20 12:40:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:40:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 12:40:22] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:40:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:23] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2023-03-20 12:40:23] [INFO ] [Nat]Added 587 Read/Feed constraints in 152 ms returned sat
[2023-03-20 12:40:23] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 119 ms.
[2023-03-20 12:40:23] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 1 ms to minimize.
[2023-03-20 12:40:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-20 12:40:23] [INFO ] Added : 22 causal constraints over 6 iterations in 701 ms. Result :sat
Minimization took 285 ms.
[2023-03-20 12:40:24] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 12:40:24] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 9 ms returned sat
[2023-03-20 12:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:24] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2023-03-20 12:40:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:40:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 12:40:24] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:40:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:24] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-20 12:40:24] [INFO ] [Nat]Added 587 Read/Feed constraints in 100 ms returned sat
[2023-03-20 12:40:24] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 1 ms to minimize.
[2023-03-20 12:40:25] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 0 ms to minimize.
[2023-03-20 12:40:25] [INFO ] Deduced a trap composed of 116 places in 144 ms of which 1 ms to minimize.
[2023-03-20 12:40:25] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 0 ms to minimize.
[2023-03-20 12:40:25] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 1 ms to minimize.
[2023-03-20 12:40:25] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 1 ms to minimize.
[2023-03-20 12:40:26] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 1 ms to minimize.
[2023-03-20 12:40:26] [INFO ] Deduced a trap composed of 117 places in 129 ms of which 0 ms to minimize.
[2023-03-20 12:40:26] [INFO ] Deduced a trap composed of 157 places in 121 ms of which 0 ms to minimize.
[2023-03-20 12:40:26] [INFO ] Deduced a trap composed of 150 places in 125 ms of which 2 ms to minimize.
[2023-03-20 12:40:26] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 1 ms to minimize.
[2023-03-20 12:40:27] [INFO ] Deduced a trap composed of 95 places in 184 ms of which 1 ms to minimize.
[2023-03-20 12:40:27] [INFO ] Deduced a trap composed of 86 places in 214 ms of which 1 ms to minimize.
[2023-03-20 12:40:27] [INFO ] Deduced a trap composed of 74 places in 219 ms of which 1 ms to minimize.
[2023-03-20 12:40:27] [INFO ] Deduced a trap composed of 116 places in 162 ms of which 0 ms to minimize.
[2023-03-20 12:40:27] [INFO ] Deduced a trap composed of 171 places in 149 ms of which 0 ms to minimize.
[2023-03-20 12:40:28] [INFO ] Deduced a trap composed of 179 places in 136 ms of which 0 ms to minimize.
[2023-03-20 12:40:28] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2023-03-20 12:40:28] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 0 ms to minimize.
[2023-03-20 12:40:29] [INFO ] Deduced a trap composed of 121 places in 115 ms of which 0 ms to minimize.
[2023-03-20 12:40:29] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4313 ms
[2023-03-20 12:40:29] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 85 ms.
[2023-03-20 12:40:29] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 1 ms to minimize.
[2023-03-20 12:40:29] [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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 63, 1] Max seen :[0, 0, 0]
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 304 place count 180 transition count 230
Iterating global reduction 1 with 61 rules applied. Total rules applied 365 place count 180 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 371 place count 180 transition count 224
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 415 place count 136 transition count 180
Iterating global reduction 2 with 44 rules applied. Total rules applied 459 place count 136 transition count 180
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 475 place count 136 transition count 164
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 500 place count 111 transition count 137
Iterating global reduction 3 with 25 rules applied. Total rules applied 525 place count 111 transition count 137
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 539 place count 111 transition count 123
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 546 place count 104 transition count 113
Iterating global reduction 4 with 7 rules applied. Total rules applied 553 place count 104 transition count 113
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 560 place count 97 transition count 106
Iterating global reduction 4 with 7 rules applied. Total rules applied 567 place count 97 transition count 106
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 571 place count 93 transition count 101
Iterating global reduction 4 with 4 rules applied. Total rules applied 575 place count 93 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 576 place count 93 transition count 100
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 579 place count 90 transition count 97
Iterating global reduction 5 with 3 rules applied. Total rules applied 582 place count 90 transition count 97
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 584 place count 88 transition count 95
Iterating global reduction 5 with 2 rules applied. Total rules applied 586 place count 88 transition count 95
Applied a total of 586 rules in 133 ms. Remains 88 /259 variables (removed 171) and now considering 95/749 (removed 654) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 88/259 places, 95/749 transitions.
// Phase 1: matrix 95 rows 88 cols
[2023-03-20 12:40:29] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224058 resets, run finished after 1078 ms. (steps per millisecond=927 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103489 resets, run finished after 570 ms. (steps per millisecond=1754 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103331 resets, run finished after 432 ms. (steps per millisecond=2314 ) properties (out of 2) seen :0
[2023-03-20 12:40:32] [INFO ] Invariant cache hit.
[2023-03-20 12:40:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:40:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:32] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-20 12:40:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:40:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:40:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-20 12:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:32] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-20 12:40:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:40:32] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2023-03-20 12:40:32] [INFO ] Computed and/alt/rep : 24/55/24 causal constraints (skipped 70 transitions) in 7 ms.
[2023-03-20 12:40:32] [INFO ] Added : 18 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 19 ms.
[2023-03-20 12:40:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:40:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:32] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-20 12:40:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:40:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:40:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:32] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-20 12:40:32] [INFO ] [Nat]Added 37 Read/Feed constraints in 10 ms returned sat
[2023-03-20 12:40:32] [INFO ] Computed and/alt/rep : 24/55/24 causal constraints (skipped 70 transitions) in 6 ms.
[2023-03-20 12:40:32] [INFO ] Added : 13 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [1, 36] Max seen :[0, 0]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 95/95 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 88/88 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 95/95 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-20 12:40:32] [INFO ] Invariant cache hit.
[2023-03-20 12:40:32] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-20 12:40:32] [INFO ] Invariant cache hit.
[2023-03-20 12:40:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:40:32] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-20 12:40:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:40:32] [INFO ] Invariant cache hit.
[2023-03-20 12:40:33] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 88/88 places, 95/95 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-01
[2023-03-20 12:40:33] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1047 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2023-03-20 12:40:33] [INFO ] Invariant cache hit.
[2023-03-20 12:40:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:40:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:33] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-20 12:40:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:40:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:40:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:33] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-20 12:40:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:40:33] [INFO ] [Nat]Added 37 Read/Feed constraints in 5 ms returned sat
[2023-03-20 12:40:33] [INFO ] Computed and/alt/rep : 24/55/24 causal constraints (skipped 70 transitions) in 6 ms.
[2023-03-20 12:40:33] [INFO ] Added : 18 causal constraints over 4 iterations in 38 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 95/95 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 86 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 84 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 84 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 84 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 83 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 83 transition count 88
Applied a total of 12 rules in 18 ms. Remains 83 /88 variables (removed 5) and now considering 88/95 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 83/88 places, 88/95 transitions.
// Phase 1: matrix 88 rows 83 cols
[2023-03-20 12:40:33] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224790 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103878 resets, run finished after 406 ms. (steps per millisecond=2463 ) properties (out of 1) seen :0
[2023-03-20 12:40:34] [INFO ] Invariant cache hit.
[2023-03-20 12:40:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:40:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:34] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-20 12:40:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:40:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:40:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:34] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-20 12:40:34] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 12:40:34] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2023-03-20 12:40:34] [INFO ] Computed and/alt/rep : 23/51/23 causal constraints (skipped 64 transitions) in 6 ms.
[2023-03-20 12:40:34] [INFO ] Added : 18 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 14 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 REACHABILITY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 83/83 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-20 12:40:34] [INFO ] Invariant cache hit.
[2023-03-20 12:40:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-20 12:40:34] [INFO ] Invariant cache hit.
[2023-03-20 12:40:34] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 12:40:35] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-20 12:40:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:40:35] [INFO ] Invariant cache hit.
[2023-03-20 12:40:35] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 83/83 places, 88/88 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-01 in 2090 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-07
// Phase 1: matrix 95 rows 88 cols
[2023-03-20 12:40:35] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1019 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-20 12:40:35] [INFO ] Invariant cache hit.
[2023-03-20 12:40:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:40:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:35] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-20 12:40:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:40:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:40:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:35] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-20 12:40:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:40:35] [INFO ] [Nat]Added 37 Read/Feed constraints in 8 ms returned sat
[2023-03-20 12:40:35] [INFO ] Computed and/alt/rep : 24/55/24 causal constraints (skipped 70 transitions) in 7 ms.
[2023-03-20 12:40:35] [INFO ] Added : 13 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [36] Max seen :[0]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 95/95 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 93
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 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 84 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 83 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 83 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 82 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 81 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 81 transition count 86
Applied a total of 15 rules in 27 ms. Remains 81 /88 variables (removed 7) and now considering 86/95 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 81/88 places, 86/95 transitions.
// Phase 1: matrix 86 rows 81 cols
[2023-03-20 12:40:35] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224399 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103761 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 1) seen :0
[2023-03-20 12:40:36] [INFO ] Invariant cache hit.
[2023-03-20 12:40:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:40:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:40:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:36] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-20 12:40:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:40:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:40:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:40:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:40:36] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-20 12:40:36] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-20 12:40:36] [INFO ] [Nat]Added 34 Read/Feed constraints in 8 ms returned sat
[2023-03-20 12:40:37] [INFO ] Computed and/alt/rep : 21/48/21 causal constraints (skipped 64 transitions) in 6 ms.
[2023-03-20 12:40:37] [INFO ] Added : 13 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [36] Max seen :[0]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 9 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 81/81 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-20 12:40:37] [INFO ] Invariant cache hit.
[2023-03-20 12:40:37] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-20 12:40:37] [INFO ] Invariant cache hit.
[2023-03-20 12:40:37] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-20 12:40:37] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-20 12:40:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:40:37] [INFO ] Invariant cache hit.
[2023-03-20 12:40:37] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 81/81 places, 86/86 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-07 in 2188 ms.
[2023-03-20 12:40:37] [INFO ] Flatten gal took : 65 ms
[2023-03-20 12:40:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-20 12:40:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 88 places, 95 transitions and 378 arcs took 2 ms.
Total runtime 17693 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/641/ub_0_ --maxsum=/tmp/641/ub_1_
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-07 32 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679316887037

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name SieveSingleMsgMbox-PT-d1m36-UpperBounds-01
ub formula formula --maxsum=/tmp/641/ub_0_
ub formula name SieveSingleMsgMbox-PT-d1m36-UpperBounds-07
ub formula formula --maxsum=/tmp/641/ub_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 88 places, 95 transitions and 378 arcs
pnml2lts-sym: Petri net SieveSingleMsgMbox_PT_d1m36 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 95->93 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 88; there are 93 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 8769811 group checks and 0 next state calls
pnml2lts-sym: reachability took 830.250 real 3247.440 user 65.010 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.130 real 0.520 user 0.000 sys
pnml2lts-sym: state space has 42970854026435 states, 261634 nodes
pnml2lts-sym: Maximum sum of /tmp/641/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/641/ub_1_ is: 32
pnml2lts-sym: group_next: 12903 nodes total
pnml2lts-sym: group_explored: 17915 nodes, 29363 short vectors total
pnml2lts-sym: max token count: 36

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-d1m36"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d1m36, 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 r425-tajo-167905978200429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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