About the Execution of Marcie+red for SieveSingleMsgMbox-PT-d1m64
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10669.191 | 3600000.00 | 3657725.00 | 819.40 | 0 0 0 ? 0 0 ? 0 ? 0 1 0 0 ? 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978900437.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 marciexred
Input is SieveSingleMsgMbox-PT-d1m64, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978900437
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.0K Feb 26 10:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 10:29 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-d1m64-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679353212989
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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m64
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 23:00:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 23:00:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 23:00:15] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-20 23:00:15] [INFO ] Transformed 1295 places.
[2023-03-20 23:00:15] [INFO ] Transformed 749 transitions.
[2023-03-20 23:00:15] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 1036 places in 15 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2023-03-20 23:00:15] [INFO ] Computed 6 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 2231 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 5) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 940 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 996 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1001 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
[2023-03-20 23:00:16] [INFO ] Invariant cache hit.
[2023-03-20 23:00:16] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-20 23:00:16] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 23:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:16] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2023-03-20 23:00:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:16] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 23:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:16] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-20 23:00:17] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-20 23:00:17] [INFO ] [Nat]Added 587 Read/Feed constraints in 113 ms returned sat
[2023-03-20 23:00:17] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 144 ms.
[2023-03-20 23:00:17] [INFO ] Added : 12 causal constraints over 3 iterations in 491 ms. Result :sat
Minimization took 467 ms.
[2023-03-20 23:00:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 23:00:18] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 23:00:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:18] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2023-03-20 23:00:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 23:00:18] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 23:00:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:18] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2023-03-20 23:00:19] [INFO ] [Nat]Added 587 Read/Feed constraints in 315 ms returned sat
[2023-03-20 23:00:19] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 7 ms to minimize.
[2023-03-20 23:00:19] [INFO ] Deduced a trap composed of 115 places in 82 ms of which 1 ms to minimize.
[2023-03-20 23:00:19] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 4 ms to minimize.
[2023-03-20 23:00:19] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2023-03-20 23:00:19] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 1 ms to minimize.
[2023-03-20 23:00:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 672 ms
[2023-03-20 23:00:19] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 115 ms.
[2023-03-20 23:00:20] [INFO ] Added : 23 causal constraints over 5 iterations in 545 ms. Result :sat
Minimization took 264 ms.
[2023-03-20 23:00:20] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 23:00:20] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 23:00:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:20] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-20 23:00:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-20 23:00:21] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 23:00:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:21] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2023-03-20 23:00:21] [INFO ] [Nat]Added 587 Read/Feed constraints in 129 ms returned sat
[2023-03-20 23:00:21] [INFO ] Deduced a trap composed of 29 places in 514 ms of which 1 ms to minimize.
[2023-03-20 23:00:22] [INFO ] Deduced a trap composed of 88 places in 225 ms of which 0 ms to minimize.
[2023-03-20 23:00:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 905 ms
[2023-03-20 23:00:22] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 167 ms.
[2023-03-20 23:00:25] [INFO ] Deduced a trap composed of 152 places in 2162 ms of which 1 ms to minimize.
[2023-03-20 23:00:25] [INFO ] Deduced a trap composed of 138 places in 221 ms of which 1 ms to minimize.
[2023-03-20 23:00:25] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 0 ms to minimize.
[2023-03-20 23:00:25] [INFO ] Deduced a trap composed of 141 places in 128 ms of which 1 ms to minimize.
[2023-03-20 23:00:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2880 ms
[2023-03-20 23:00:26] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 0 ms to minimize.
[2023-03-20 23:00:26] [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)
[2023-03-20 23:00:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 23:00:26] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 23:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:26] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2023-03-20 23:00:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 23:00:26] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 23:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:26] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2023-03-20 23:00:26] [INFO ] [Nat]Added 587 Read/Feed constraints in 105 ms returned sat
[2023-03-20 23:00:27] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 1 ms to minimize.
[2023-03-20 23:00:27] [INFO ] Deduced a trap composed of 96 places in 200 ms of which 1 ms to minimize.
[2023-03-20 23:00:27] [INFO ] Deduced a trap composed of 77 places in 200 ms of which 1 ms to minimize.
[2023-03-20 23:00:27] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 1 ms to minimize.
[2023-03-20 23:00:28] [INFO ] Deduced a trap composed of 59 places in 220 ms of which 1 ms to minimize.
[2023-03-20 23:00:28] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 1 ms to minimize.
[2023-03-20 23:00:28] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 1 ms to minimize.
[2023-03-20 23:00:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1507 ms
[2023-03-20 23:00:28] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 88 ms.
[2023-03-20 23:00:28] [INFO ] Added : 26 causal constraints over 6 iterations in 495 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : [91, 10, 1, 10] Max seen :[0, 0, 0, 0]
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.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 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 301 place count 183 transition count 247
Iterating global reduction 1 with 58 rules applied. Total rules applied 359 place count 183 transition count 247
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 365 place count 183 transition count 241
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 408 place count 140 transition count 198
Iterating global reduction 2 with 43 rules applied. Total rules applied 451 place count 140 transition count 198
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 466 place count 140 transition count 183
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 490 place count 116 transition count 157
Iterating global reduction 3 with 24 rules applied. Total rules applied 514 place count 116 transition count 157
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 534 place count 116 transition count 137
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 540 place count 110 transition count 129
Iterating global reduction 4 with 6 rules applied. Total rules applied 546 place count 110 transition count 129
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 552 place count 104 transition count 123
Iterating global reduction 4 with 6 rules applied. Total rules applied 558 place count 104 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 560 place count 102 transition count 120
Iterating global reduction 4 with 2 rules applied. Total rules applied 562 place count 102 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 564 place count 100 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 566 place count 100 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 568 place count 98 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 570 place count 98 transition count 116
Applied a total of 570 rules in 109 ms. Remains 98 /259 variables (removed 161) and now considering 116/749 (removed 633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 98/259 places, 116/749 transitions.
// Phase 1: matrix 116 rows 98 cols
[2023-03-20 23:00:29] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 224805 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103266 resets, run finished after 506 ms. (steps per millisecond=1976 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103407 resets, run finished after 463 ms. (steps per millisecond=2159 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103548 resets, run finished after 478 ms. (steps per millisecond=2092 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103292 resets, run finished after 458 ms. (steps per millisecond=2183 ) properties (out of 4) seen :0
[2023-03-20 23:00:32] [INFO ] Invariant cache hit.
[2023-03-20 23:00:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:32] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-20 23:00:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:32] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-20 23:00:32] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 23:00:32] [INFO ] [Nat]Added 52 Read/Feed constraints in 13 ms returned sat
[2023-03-20 23:00:32] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-20 23:00:32] [INFO ] Added : 13 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 60 ms.
[2023-03-20 23:00:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:32] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-20 23:00:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:33] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-20 23:00:33] [INFO ] [Nat]Added 52 Read/Feed constraints in 16 ms returned sat
[2023-03-20 23:00:33] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-20 23:00:33] [INFO ] Added : 14 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 20 ms.
[2023-03-20 23:00:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:33] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-20 23:00:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:33] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-20 23:00:33] [INFO ] [Nat]Added 52 Read/Feed constraints in 12 ms returned sat
[2023-03-20 23:00:33] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-20 23:00:33] [INFO ] Added : 19 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 20 ms.
[2023-03-20 23:00:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:33] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-20 23:00:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-20 23:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:33] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-20 23:00:33] [INFO ] [Nat]Added 52 Read/Feed constraints in 11 ms returned sat
[2023-03-20 23:00:33] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2023-03-20 23:00:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-20 23:00:33] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-20 23:00:33] [INFO ] Added : 19 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [64, 10, 1, 10] Max seen :[0, 0, 0, 0]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 98/98 places, 116/116 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-20 23:00:33] [INFO ] Invariant cache hit.
[2023-03-20 23:00:33] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-20 23:00:33] [INFO ] Invariant cache hit.
[2023-03-20 23:00:33] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 23:00:34] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-20 23:00:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 23:00:34] [INFO ] Invariant cache hit.
[2023-03-20 23:00:34] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 98/98 places, 116/116 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-03
[2023-03-20 23:00:34] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2266 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 1041 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-20 23:00:34] [INFO ] Invariant cache hit.
[2023-03-20 23:00:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:34] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:34] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-20 23:00:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:34] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-20 23:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:34] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-20 23:00:34] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 23:00:34] [INFO ] [Nat]Added 52 Read/Feed constraints in 10 ms returned sat
[2023-03-20 23:00:34] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 9 ms.
[2023-03-20 23:00:34] [INFO ] Added : 13 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [64] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 105
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 95 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 92 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 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 14 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 89 transition count 97
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 89 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 89 transition count 96
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 87 transition count 93
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 27 place count 85 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 85 transition count 91
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 83 transition count 89
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 83 transition count 88
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 36 place count 81 transition count 86
Iterating global reduction 4 with 2 rules applied. Total rules applied 38 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 39 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 45 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 77 transition count 81
Applied a total of 46 rules in 35 ms. Remains 77 /98 variables (removed 21) and now considering 81/116 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 77/98 places, 81/116 transitions.
// Phase 1: matrix 81 rows 77 cols
[2023-03-20 23:00:34] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224429 resets, run finished after 780 ms. (steps per millisecond=1282 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103765 resets, run finished after 346 ms. (steps per millisecond=2890 ) properties (out of 1) seen :0
[2023-03-20 23:00:35] [INFO ] Invariant cache hit.
[2023-03-20 23:00:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:35] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-20 23:00:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:35] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-20 23:00:35] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 23:00:35] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2023-03-20 23:00:35] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 60 transitions) in 5 ms.
[2023-03-20 23:00:35] [INFO ] Added : 13 causal constraints over 3 iterations in 56 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [64] Max seen :[0]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 77/77 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-20 23:00:35] [INFO ] Invariant cache hit.
[2023-03-20 23:00:36] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-20 23:00:36] [INFO ] Invariant cache hit.
[2023-03-20 23:00:36] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 23:00:36] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-20 23:00:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 23:00:36] [INFO ] Invariant cache hit.
[2023-03-20 23:00:36] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 77/77 places, 81/81 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-03 in 2065 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-06
// Phase 1: matrix 116 rows 98 cols
[2023-03-20 23:00:36] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2218 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 1053 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-20 23:00:36] [INFO ] Invariant cache hit.
[2023-03-20 23:00:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:36] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-20 23:00:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-20 23:00:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:36] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-20 23:00:36] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 23:00:36] [INFO ] [Nat]Added 52 Read/Feed constraints in 12 ms returned sat
[2023-03-20 23:00:36] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 7 ms.
[2023-03-20 23:00:36] [INFO ] Added : 14 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 105
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 95 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 93 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 93 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 93 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 90 transition count 98
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 90 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 90 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 21 place count 88 transition count 94
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 88 transition count 94
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 86 transition count 92
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 86 transition count 92
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 84 transition count 90
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 84 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 84 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 34 place count 82 transition count 87
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 81 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 39 place count 80 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 80 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 78 transition count 82
Applied a total of 44 rules in 37 ms. Remains 78 /98 variables (removed 20) and now considering 82/116 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 78/98 places, 82/116 transitions.
// Phase 1: matrix 82 rows 78 cols
[2023-03-20 23:00:36] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224312 resets, run finished after 642 ms. (steps per millisecond=1557 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103440 resets, run finished after 359 ms. (steps per millisecond=2785 ) properties (out of 1) seen :0
[2023-03-20 23:00:37] [INFO ] Invariant cache hit.
[2023-03-20 23:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 23:00:37] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:37] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-20 23:00:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:00:37] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:37] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-20 23:00:37] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 23:00:37] [INFO ] [Nat]Added 32 Read/Feed constraints in 14 ms returned sat
[2023-03-20 23:00:37] [INFO ] Computed and/alt/rep : 20/47/20 causal constraints (skipped 61 transitions) in 8 ms.
[2023-03-20 23:00:37] [INFO ] Added : 16 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 78/78 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-20 23:00:37] [INFO ] Invariant cache hit.
[2023-03-20 23:00:38] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-20 23:00:38] [INFO ] Invariant cache hit.
[2023-03-20 23:00:38] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 23:00:38] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-20 23:00:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 23:00:38] [INFO ] Invariant cache hit.
[2023-03-20 23:00:38] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 78/78 places, 82/82 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-06 in 2172 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-08
// Phase 1: matrix 116 rows 98 cols
[2023-03-20 23:00:38] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2219 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1023 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
[2023-03-20 23:00:38] [INFO ] Invariant cache hit.
[2023-03-20 23:00:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:38] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-20 23:00:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:38] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-20 23:00:38] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 23:00:38] [INFO ] [Nat]Added 52 Read/Feed constraints in 15 ms returned sat
[2023-03-20 23:00:38] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-20 23:00:38] [INFO ] Added : 19 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 95 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 93 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 93 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 13 place count 93 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 92 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 92 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 92 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 91 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 91 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 90 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 90 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 89 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 89 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 89 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 24 place count 88 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 88 transition count 93
Applied a total of 25 rules in 37 ms. Remains 88 /98 variables (removed 10) and now considering 93/116 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 88/98 places, 93/116 transitions.
// Phase 1: matrix 93 rows 88 cols
[2023-03-20 23:00:38] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224359 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103662 resets, run finished after 375 ms. (steps per millisecond=2666 ) properties (out of 1) seen :0
[2023-03-20 23:00:40] [INFO ] Invariant cache hit.
[2023-03-20 23:00:40] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2023-03-20 23:00:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:40] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-20 23:00:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2023-03-20 23:00:40] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:40] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-20 23:00:40] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 23:00:40] [INFO ] [Nat]Added 35 Read/Feed constraints in 7 ms returned sat
[2023-03-20 23:00:40] [INFO ] Computed and/alt/rep : 24/53/24 causal constraints (skipped 68 transitions) in 4 ms.
[2023-03-20 23:00:40] [INFO ] Added : 20 causal constraints over 5 iterations in 196 ms. Result :sat
Minimization took 26 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, 93/93 transitions.
Applied a total of 0 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 88/88 places, 93/93 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 93/93 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2023-03-20 23:00:40] [INFO ] Invariant cache hit.
[2023-03-20 23:00:40] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-20 23:00:40] [INFO ] Invariant cache hit.
[2023-03-20 23:00:40] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 23:00:41] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-20 23:00:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 23:00:41] [INFO ] Invariant cache hit.
[2023-03-20 23:00:41] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 88/88 places, 93/93 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-08 in 2663 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-13
// Phase 1: matrix 116 rows 98 cols
[2023-03-20 23:00:41] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2191 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1042 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-20 23:00:41] [INFO ] Invariant cache hit.
[2023-03-20 23:00:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:41] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-20 23:00:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:41] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-20 23:00:41] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 23:00:41] [INFO ] [Nat]Added 52 Read/Feed constraints in 17 ms returned sat
[2023-03-20 23:00:41] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2023-03-20 23:00:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-20 23:00:41] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 9 ms.
[2023-03-20 23:00:41] [INFO ] Added : 19 causal constraints over 4 iterations in 98 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 113
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 95 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 93 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 93 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 91 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 91 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 90 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 90 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 89 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 89 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 88 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 88 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 87 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 87 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 86 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 85 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 84 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 83 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 83 transition count 96
Applied a total of 33 rules in 44 ms. Remains 83 /98 variables (removed 15) and now considering 96/116 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 83/98 places, 96/116 transitions.
// Phase 1: matrix 96 rows 83 cols
[2023-03-20 23:00:41] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224447 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103115 resets, run finished after 445 ms. (steps per millisecond=2247 ) properties (out of 1) seen :0
[2023-03-20 23:00:43] [INFO ] Invariant cache hit.
[2023-03-20 23:00:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:00:43] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:43] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-20 23:00:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 23:00:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:00:43] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 23:00:43] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-20 23:00:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 23:00:43] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2023-03-20 23:00:43] [INFO ] Computed and/alt/rep : 22/51/22 causal constraints (skipped 73 transitions) in 7 ms.
[2023-03-20 23:00:43] [INFO ] Added : 17 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-20 23:00:43] [INFO ] Invariant cache hit.
[2023-03-20 23:00:43] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-20 23:00:43] [INFO ] Invariant cache hit.
[2023-03-20 23:00:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 23:00:43] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-20 23:00:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 23:00:43] [INFO ] Invariant cache hit.
[2023-03-20 23:00:43] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 83/83 places, 96/96 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-13 in 2828 ms.
[2023-03-20 23:00:44] [INFO ] Flatten gal took : 61 ms
[2023-03-20 23:00:44] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2023-03-20 23:00:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 116 transitions and 461 arcs took 4 ms.
Total runtime 28694 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: SieveSingleMsgMbox_PT_d1m64
(NrP: 98 NrTr: 116 NrArc: 461)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.169sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 5475492 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16099452 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
6669 15612 25436 37154 53952 70170 98293 120840 263907 273475 296447 344720 363791 333773 331187 289809
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-d1m64"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is SieveSingleMsgMbox-PT-d1m64, 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 r426-tajo-167905978900437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m64.tgz
mv SieveSingleMsgMbox-PT-d1m64 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;