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-165472293000364.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-d2m64, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472293000364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.6K Jun 7 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 7 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Jun 7 17:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 7 17:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.1M Jun 6 12:11 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654796048844

Running Version 0
[2022-06-09 17:34:10] [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:34:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 17:34:10] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2022-06-09 17:34:10] [INFO ] Transformed 2398 places.
[2022-06-09 17:34:10] [INFO ] Transformed 1954 transitions.
[2022-06-09 17:34:10] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 212 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 80 ms.
Deduced a syphon composed of 1984 places in 23 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2022-06-09 17:34:10] [INFO ] Computed 6 place invariants in 75 ms
Incomplete random walk after 10000 steps, including 2172 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
// Phase 1: matrix 1954 rows 414 cols
[2022-06-09 17:34:11] [INFO ] Computed 6 place invariants in 45 ms
[2022-06-09 17:34:11] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2022-06-09 17:34:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-09 17:34:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:34:11] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2022-06-09 17:34:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:34:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:34:12] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:34:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:34:12] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2022-06-09 17:34:12] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2022-06-09 17:34:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:34:16] [INFO ] [Nat]Added 1674 Read/Feed constraints in 3717 ms returned sat
[2022-06-09 17:34:16] [INFO ] Deduced a trap composed of 26 places in 248 ms of which 3 ms to minimize.
[2022-06-09 17:34:17] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 1 ms to minimize.
[2022-06-09 17:34:17] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 1 ms to minimize.
[2022-06-09 17:34:17] [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)
Current structural bounds on expressions (after SMT) : [42] Max seen :[0]
Support contains 1 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.10 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 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1171 place count 177 transition count 270
Iterating global reduction 2 with 92 rules applied. Total rules applied 1263 place count 177 transition count 270
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1298 place count 177 transition count 235
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1336 place count 139 transition count 183
Iterating global reduction 3 with 38 rules applied. Total rules applied 1374 place count 139 transition count 183
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1397 place count 139 transition count 160
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1406 place count 130 transition count 146
Iterating global reduction 4 with 9 rules applied. Total rules applied 1415 place count 130 transition count 146
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1424 place count 121 transition count 137
Iterating global reduction 4 with 9 rules applied. Total rules applied 1433 place count 121 transition count 137
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1438 place count 116 transition count 131
Iterating global reduction 4 with 5 rules applied. Total rules applied 1443 place count 116 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1444 place count 116 transition count 130
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1449 place count 111 transition count 125
Iterating global reduction 5 with 5 rules applied. Total rules applied 1454 place count 111 transition count 125
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1458 place count 107 transition count 121
Iterating global reduction 5 with 4 rules applied. Total rules applied 1462 place count 107 transition count 121
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1464 place count 105 transition count 117
Iterating global reduction 5 with 2 rules applied. Total rules applied 1466 place count 105 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1467 place count 104 transition count 116
Iterating global reduction 5 with 1 rules applied. Total rules applied 1468 place count 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1469 place count 103 transition count 115
Iterating global reduction 5 with 1 rules applied. Total rules applied 1470 place count 103 transition count 115
Applied a total of 1470 rules in 157 ms. Remains 103 /414 variables (removed 311) and now considering 115/1954 (removed 1839) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/414 places, 115/1954 transitions.
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:34:17] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224487 resets, run finished after 877 ms. (steps per millisecond=1140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102838 resets, run finished after 469 ms. (steps per millisecond=2132 ) properties (out of 1) seen :0
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:34:18] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 17:34:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:34:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:34:18] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-09 17:34:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:34:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:34:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:34:18] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-06-09 17:34:18] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:34:18] [INFO ] [Nat]Added 43 Read/Feed constraints in 14 ms returned sat
[2022-06-09 17:34:18] [INFO ] Computed and/alt/rep : 27/74/27 causal constraints (skipped 87 transitions) in 10 ms.
[2022-06-09 17:34:19] [INFO ] Added : 26 causal constraints over 6 iterations in 100 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [42] Max seen :[0]
Incomplete Parikh walk after 25700 steps, including 4430 resets, run finished after 48 ms. (steps per millisecond=535 ) 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 8 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 10 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:34:19] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:34:19] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:34:19] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:34:19] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:34:19] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2022-06-09 17:34:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:34:19] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-09 17:34:19] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-05
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:34:19] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1059 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:34:19] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:34:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:34:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:34:19] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 17:34:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:34:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:34:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:34:19] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-06-09 17:34:19] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:34:19] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:34:19] [INFO ] Computed and/alt/rep : 27/74/27 causal constraints (skipped 87 transitions) in 10 ms.
[2022-06-09 17:34:19] [INFO ] Added : 26 causal constraints over 6 iterations in 84 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 25700 steps, including 4446 resets, run finished after 40 ms. (steps per millisecond=642 ) 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 6 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.
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:34:19] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224449 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103497 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 1) seen :0
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:34:21] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:34:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:34:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:34:21] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 17:34:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:34:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:34:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:34:21] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-09 17:34:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:34:21] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:34:21] [INFO ] Computed and/alt/rep : 27/74/27 causal constraints (skipped 87 transitions) in 10 ms.
[2022-06-09 17:34:21] [INFO ] Added : 26 causal constraints over 6 iterations in 85 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 25700 steps, including 4510 resets, run finished after 33 ms. (steps per millisecond=778 ) 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 7 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 5 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:34:21] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:34:21] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:34:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:34:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:34:21] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2022-06-09 17:34:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:34:21] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:34:21] [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-d2m64-UpperBounds-05 in 2164 ms.
[2022-06-09 17:34:21] [INFO ] Flatten gal took : 41 ms
[2022-06-09 17:34:21] [INFO ] Applying decomposition
[2022-06-09 17:34:21] [INFO ] Flatten gal took : 12 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/graph15475097290911295504.txt, -o, /tmp/graph15475097290911295504.bin, -w, /tmp/graph15475097290911295504.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/graph15475097290911295504.bin, -l, -1, -v, -w, /tmp/graph15475097290911295504.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 17:34:21] [INFO ] Decomposing Gal with order
[2022-06-09 17:34:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 17:34:21] [INFO ] Removed a total of 104 redundant transitions.
[2022-06-09 17:34:21] [INFO ] Flatten gal took : 37 ms
[2022-06-09 17:34:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 8 ms.
[2022-06-09 17:34:21] [INFO ] Time to serialize gal into /tmp/UpperBounds12847525624574708787.gal : 6 ms
[2022-06-09 17:34:21] [INFO ] Time to serialize properties into /tmp/UpperBounds16551749156174868187.prop : 1 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/UpperBounds12847525624574708787.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16551749156174868187.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/UpperBounds12847525624574708787.gal -t CGAL -reachable-file /tmp/UpperBounds16551749156174868187.prop --nowitness
Loading property file /tmp/UpperBounds16551749156174868187.prop.
Detected timeout of ITS tools.
[2022-06-09 17:54:25] [INFO ] Flatten gal took : 8 ms
[2022-06-09 17:54:25] [INFO ] Time to serialize gal into /tmp/UpperBounds11427590020873879758.gal : 3 ms
[2022-06-09 17:54:25] [INFO ] Time to serialize properties into /tmp/UpperBounds4611451538196135438.prop : 2 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/UpperBounds11427590020873879758.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4611451538196135438.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/UpperBounds11427590020873879758.gal -t CGAL -reachable-file /tmp/UpperBounds4611451538196135438.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds4611451538196135438.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.14903e+17,873.246,6268740,2,65822,5,2.81076e+07,6,0,529,2.23308e+07,0
Total reachable state count : 314902727632089538

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m64-UpperBounds-05 :0 <= p90 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m64-UpperBounds-05,0,873.267,6268740,1,0,7,2.81076e+07,9,1,697,2.23308e+07,4

BK_STOP 1654798140112

--------------------
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-d2m64"
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-d2m64, 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-165472293000364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m64.tgz
mv SieveSingleMsgMbox-PT-d2m64 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;