About the Execution of 2021-gold for SieveSingleMsgMbox-PT-d2m36
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14517.415 | 3600000.00 | 3657582.00 | 11180.60 | 0 0 0 0 0 0 0 0 ? 0 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 '/data/fkordon/mcc2022-input.r323-tall-165472293000361.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is SieveSingleMsgMbox-PT-d2m36, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472293000361
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K Jun 7 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 7 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 7 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 7 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.1M Jun 6 12:11 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654795494688
Running Version 0
[2022-06-09 17:24:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 17:24:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 17:24:56] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2022-06-09 17:24:56] [INFO ] Transformed 2398 places.
[2022-06-09 17:24:56] [INFO ] Transformed 1954 transitions.
[2022-06-09 17:24:56] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 196 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1984 places in 16 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2022-06-09 17:24:56] [INFO ] Computed 6 place invariants in 67 ms
Incomplete random walk after 10000 steps, including 2201 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 958 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
// Phase 1: matrix 1954 rows 414 cols
[2022-06-09 17:24:57] [INFO ] Computed 6 place invariants in 32 ms
[2022-06-09 17:24:57] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2022-06-09 17:24:57] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:24:57] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2022-06-09 17:24:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:24:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 17:24:58] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:24:58] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2022-06-09 17:24:58] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2022-06-09 17:25:02] [INFO ] [Nat]Added 1674 Read/Feed constraints in 3365 ms returned sat
[2022-06-09 17:25:02] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 4 ms to minimize.
[2022-06-09 17:25:02] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 2 ms to minimize.
[2022-06-09 17:25:02] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 1 ms to minimize.
[2022-06-09 17:25:03] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 2 ms to minimize.
[2022-06-09 17:25:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 17:25:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:25:03] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:03] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2022-06-09 17:25:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:25:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:25:03] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:25:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:04] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2022-06-09 17:25:07] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:25:07] [INFO ] [Nat]Added 1674 Read/Feed constraints in 3727 ms returned sat
[2022-06-09 17:25:07] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 13 ms to minimize.
[2022-06-09 17:25:08] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 1 ms to minimize.
[2022-06-09 17:25:08] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 1 ms to minimize.
[2022-06-09 17:25:08] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 0 ms to minimize.
[2022-06-09 17:25:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 17:25:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:25:08] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 11 ms returned sat
[2022-06-09 17:25:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:09] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2022-06-09 17:25:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:25:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:25:09] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:25:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:09] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2022-06-09 17:25:12] [INFO ] [Nat]Added 1674 Read/Feed constraints in 3212 ms returned sat
[2022-06-09 17:25:13] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 1 ms to minimize.
[2022-06-09 17:25:13] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 1 ms to minimize.
[2022-06-09 17:25:13] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 1 ms to minimize.
[2022-06-09 17:25:14] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 1 ms to minimize.
[2022-06-09 17:25:14] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 1 ms to minimize.
[2022-06-09 17:25:14] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [42, 42, 42] Max seen :[0, 0, 0]
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.7 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 950 place count 269 transition count 372
Iterating global reduction 1 with 119 rules applied. Total rules applied 1069 place count 269 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1079 place count 269 transition count 362
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1169 place count 179 transition count 272
Iterating global reduction 2 with 90 rules applied. Total rules applied 1259 place count 179 transition count 272
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 1292 place count 179 transition count 239
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1328 place count 143 transition count 191
Iterating global reduction 3 with 36 rules applied. Total rules applied 1364 place count 143 transition count 191
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 1385 place count 143 transition count 170
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1393 place count 135 transition count 157
Iterating global reduction 4 with 8 rules applied. Total rules applied 1401 place count 135 transition count 157
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1409 place count 127 transition count 149
Iterating global reduction 4 with 8 rules applied. Total rules applied 1417 place count 127 transition count 149
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1421 place count 123 transition count 144
Iterating global reduction 4 with 4 rules applied. Total rules applied 1425 place count 123 transition count 144
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1429 place count 119 transition count 140
Iterating global reduction 4 with 4 rules applied. Total rules applied 1433 place count 119 transition count 140
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1437 place count 115 transition count 136
Iterating global reduction 4 with 4 rules applied. Total rules applied 1441 place count 115 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1443 place count 113 transition count 132
Iterating global reduction 4 with 2 rules applied. Total rules applied 1445 place count 113 transition count 132
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1446 place count 112 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 1447 place count 112 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1448 place count 111 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 1449 place count 111 transition count 130
Applied a total of 1449 rules in 116 ms. Remains 111 /414 variables (removed 303) and now considering 130/1954 (removed 1824) transitions.
Finished structural reductions, in 1 iterations. Remains : 111/414 places, 130/1954 transitions.
// Phase 1: matrix 130 rows 111 cols
[2022-06-09 17:25:14] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 223765 resets, run finished after 973 ms. (steps per millisecond=1027 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103070 resets, run finished after 527 ms. (steps per millisecond=1897 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103550 resets, run finished after 481 ms. (steps per millisecond=2079 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103159 resets, run finished after 459 ms. (steps per millisecond=2178 ) properties (out of 3) seen :0
// Phase 1: matrix 130 rows 111 cols
[2022-06-09 17:25:16] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 17:25:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:25:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:25:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:16] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-09 17:25:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:25:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:25:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:25:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:16] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:25:16] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-06-09 17:25:17] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2022-06-09 17:25:17] [INFO ] Computed and/alt/rep : 30/89/30 causal constraints (skipped 99 transitions) in 12 ms.
[2022-06-09 17:25:17] [INFO ] Added : 29 causal constraints over 6 iterations in 93 ms. Result :sat
Minimization took 35 ms.
[2022-06-09 17:25:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:25:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:17] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 17:25:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:25:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:25:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:25:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:17] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-06-09 17:25:17] [INFO ] [Nat]Added 48 Read/Feed constraints in 15 ms returned sat
[2022-06-09 17:25:17] [INFO ] Computed and/alt/rep : 30/89/30 causal constraints (skipped 99 transitions) in 15 ms.
[2022-06-09 17:25:17] [INFO ] Added : 29 causal constraints over 6 iterations in 100 ms. Result :sat
Minimization took 36 ms.
[2022-06-09 17:25:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:25:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:17] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-09 17:25:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:25:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:25:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:25:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:17] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-06-09 17:25:17] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:25:17] [INFO ] Computed and/alt/rep : 30/89/30 causal constraints (skipped 99 transitions) in 12 ms.
[2022-06-09 17:25:17] [INFO ] Added : 29 causal constraints over 6 iterations in 95 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [42, 42, 42] Max seen :[0, 0, 0]
Incomplete Parikh walk after 24400 steps, including 3956 resets, run finished after 42 ms. (steps per millisecond=580 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 34100 steps, including 6106 resets, run finished after 47 ms. (steps per millisecond=725 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 29900 steps, including 5319 resets, run finished after 36 ms. (steps per millisecond=830 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 111/111 places, 130/130 transitions.
Applied a total of 0 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 111/111 places, 130/130 transitions.
Starting structural reductions, iteration 0 : 111/111 places, 130/130 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 111 cols
[2022-06-09 17:25:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:25:17] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 130 rows 111 cols
[2022-06-09 17:25:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:25:17] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-06-09 17:25:18] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2022-06-09 17:25:18] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 130 rows 111 cols
[2022-06-09 17:25:18] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:25:18] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 111/111 places, 130/130 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-08
// Phase 1: matrix 130 rows 111 cols
[2022-06-09 17:25:18] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2227 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 1067 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 130 rows 111 cols
[2022-06-09 17:25:18] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:25:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:25:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:18] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:25:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:25:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:25:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:18] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:25:18] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-06-09 17:25:18] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:25:18] [INFO ] Computed and/alt/rep : 30/89/30 causal constraints (skipped 99 transitions) in 12 ms.
[2022-06-09 17:25:18] [INFO ] Added : 29 causal constraints over 6 iterations in 87 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 29900 steps, including 5348 resets, run finished after 37 ms. (steps per millisecond=808 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 111/111 places, 130/130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 109 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 107 transition count 122
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 107 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 106 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 105 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 105 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 104 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 104 transition count 117
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 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 103 transition count 115
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 103 transition count 115
Applied a total of 21 rules in 21 ms. Remains 103 /111 variables (removed 8) and now considering 115/130 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/111 places, 115/130 transitions.
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:18] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224381 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103218 resets, run finished after 420 ms. (steps per millisecond=2380 ) properties (out of 1) seen :0
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:19] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:25:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:25:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:25:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:19] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 17:25:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:25:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:25:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:19] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:25:19] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:25:19] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:25:19] [INFO ] Computed and/alt/rep : 27/74/27 causal constraints (skipped 87 transitions) in 11 ms.
[2022-06-09 17:25:19] [INFO ] Added : 26 causal constraints over 6 iterations in 81 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 38500 steps, including 7085 resets, run finished after 43 ms. (steps per millisecond=895 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Starting structural reductions, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:19] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:25:20] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:20] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-09 17:25:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:25:20] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2022-06-09 17:25:20] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:20] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:25:20] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-08 in 2135 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-13
// Phase 1: matrix 130 rows 111 cols
[2022-06-09 17:25:20] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2262 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 1028 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 130 rows 111 cols
[2022-06-09 17:25:20] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 17:25:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:25:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:20] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:25:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:25:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:25:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 17:25:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:20] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:25:20] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-06-09 17:25:20] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:25:20] [INFO ] Computed and/alt/rep : 30/89/30 causal constraints (skipped 99 transitions) in 12 ms.
[2022-06-09 17:25:20] [INFO ] Added : 29 causal constraints over 6 iterations in 93 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 34100 steps, including 6103 resets, run finished after 42 ms. (steps per millisecond=811 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 111/111 places, 130/130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 109 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 107 transition count 122
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 107 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 106 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 105 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 105 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 104 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 104 transition count 117
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 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 103 transition count 115
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 103 transition count 115
Applied a total of 21 rules in 18 ms. Remains 103 /111 variables (removed 8) and now considering 115/130 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/111 places, 115/130 transitions.
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:20] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224328 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103081 resets, run finished after 428 ms. (steps per millisecond=2336 ) properties (out of 1) seen :0
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:21] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 17:25:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:25:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:21] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:25:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:25:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:25:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:21] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2022-06-09 17:25:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:25:21] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:25:21] [INFO ] Computed and/alt/rep : 27/74/27 causal constraints (skipped 87 transitions) in 10 ms.
[2022-06-09 17:25:22] [INFO ] Added : 26 causal constraints over 6 iterations in 82 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 10500 steps, including 1480 resets, run finished after 17 ms. (steps per millisecond=617 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Starting structural reductions, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:25:22] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:25:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:25:22] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2022-06-09 17:25:22] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:22] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:25:22] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-13 in 2137 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-14
// Phase 1: matrix 130 rows 111 cols
[2022-06-09 17:25:22] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2231 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 1070 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 130 rows 111 cols
[2022-06-09 17:25:22] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:25:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:25:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:22] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 17:25:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:25:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:25:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:22] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:25:22] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-06-09 17:25:22] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2022-06-09 17:25:22] [INFO ] Computed and/alt/rep : 30/89/30 causal constraints (skipped 99 transitions) in 9 ms.
[2022-06-09 17:25:22] [INFO ] Added : 29 causal constraints over 6 iterations in 106 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 24400 steps, including 3926 resets, run finished after 30 ms. (steps per millisecond=813 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 111/111 places, 130/130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 109 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 107 transition count 122
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 107 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 106 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 105 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 105 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 104 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 104 transition count 117
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 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 103 transition count 115
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 103 transition count 115
Applied a total of 21 rules in 14 ms. Remains 103 /111 variables (removed 8) and now considering 115/130 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/111 places, 115/130 transitions.
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:22] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224383 resets, run finished after 900 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103435 resets, run finished after 415 ms. (steps per millisecond=2409 ) properties (out of 1) seen :0
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:24] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:25:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:25:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:24] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:25:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:25:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:25:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:25:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:25:24] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-09 17:25:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:25:24] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2022-06-09 17:25:24] [INFO ] Computed and/alt/rep : 27/74/27 causal constraints (skipped 87 transitions) in 9 ms.
[2022-06-09 17:25:24] [INFO ] Added : 26 causal constraints over 6 iterations in 68 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 10500 steps, including 1475 resets, run finished after 14 ms. (steps per millisecond=750 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Starting structural reductions, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:24] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:25:24] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:24] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:25:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:25:24] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2022-06-09 17:25:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:25:24] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:25:24] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-14 in 2154 ms.
[2022-06-09 17:25:24] [INFO ] Flatten gal took : 40 ms
[2022-06-09 17:25:24] [INFO ] Applying decomposition
[2022-06-09 17:25:24] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7387302253513248254.txt, -o, /tmp/graph7387302253513248254.bin, -w, /tmp/graph7387302253513248254.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7387302253513248254.bin, -l, -1, -v, -w, /tmp/graph7387302253513248254.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 17:25:24] [INFO ] Decomposing Gal with order
[2022-06-09 17:25:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 17:25:24] [INFO ] Removed a total of 122 redundant transitions.
[2022-06-09 17:25:24] [INFO ] Flatten gal took : 39 ms
[2022-06-09 17:25:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 8 ms.
[2022-06-09 17:25:24] [INFO ] Time to serialize gal into /tmp/UpperBounds6563511575770454579.gal : 6 ms
[2022-06-09 17:25:24] [INFO ] Time to serialize properties into /tmp/UpperBounds10957914772931276781.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds6563511575770454579.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10957914772931276781.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds6563511575770454579.gal -t CGAL -reachable-file /tmp/UpperBounds10957914772931276781.prop --nowitness
Loading property file /tmp/UpperBounds10957914772931276781.prop.
Detected timeout of ITS tools.
[2022-06-09 17:45:34] [INFO ] Flatten gal took : 15 ms
[2022-06-09 17:45:34] [INFO ] Time to serialize gal into /tmp/UpperBounds14953733658379518305.gal : 2 ms
[2022-06-09 17:45:34] [INFO ] Time to serialize properties into /tmp/UpperBounds4107384666748161487.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds14953733658379518305.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4107384666748161487.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds14953733658379518305.gal -t CGAL -reachable-file /tmp/UpperBounds4107384666748161487.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds4107384666748161487.prop.
Detected timeout of ITS tools.
[2022-06-09 18:05:43] [INFO ] Flatten gal took : 9 ms
[2022-06-09 18:05:43] [INFO ] Input system was already deterministic with 130 transitions.
[2022-06-09 18:05:43] [INFO ] Transformed 111 places.
[2022-06-09 18:05:43] [INFO ] Transformed 130 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 18:05:43] [INFO ] Time to serialize gal into /tmp/UpperBounds15780959797978290673.gal : 2 ms
[2022-06-09 18:05:43] [INFO ] Time to serialize properties into /tmp/UpperBounds11131630707350333021.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds15780959797978290673.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11131630707350333021.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds15780959797978290673.gal -t CGAL -reachable-file /tmp/UpperBounds11131630707350333021.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds11131630707350333021.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m36"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is SieveSingleMsgMbox-PT-d2m36, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r323-tall-165472293000361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m36.tgz
mv SieveSingleMsgMbox-PT-d2m36 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 ;