About the Execution of 2021-gold for BusinessProcesses-PT-09
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
271.359 | 13738.00 | 25788.00 | 875.80 | TFTFTFFTTTFFFTFF | 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.r028-tall-165251936100147.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 BusinessProcesses-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100147
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 5.7K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 30 00:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 00:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 00:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 30 00:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 104K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1655083108229
Running Version 0
[2022-06-13 01:18:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-13 01:18:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:18:30] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2022-06-13 01:18:30] [INFO ] Transformed 403 places.
[2022-06-13 01:18:30] [INFO ] Transformed 374 transitions.
[2022-06-13 01:18:30] [INFO ] Found NUPN structural information;
[2022-06-13 01:18:30] [INFO ] Parsed PT model containing 403 places and 374 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 109 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :8
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 374 rows 403 cols
[2022-06-13 01:18:30] [INFO ] Computed 65 place invariants in 36 ms
[2022-06-13 01:18:30] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-06-13 01:18:30] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 2 ms returned unsat
[2022-06-13 01:18:30] [INFO ] [Real]Absence check using 36 positive place invariants in 31 ms returned sat
[2022-06-13 01:18:30] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 5 ms returned unsat
[2022-06-13 01:18:30] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-06-13 01:18:30] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2022-06-13 01:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:31] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2022-06-13 01:18:31] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 4 ms to minimize.
[2022-06-13 01:18:31] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2022-06-13 01:18:31] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:18:31] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
[2022-06-13 01:18:31] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2022-06-13 01:18:31] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2022-06-13 01:18:31] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2022-06-13 01:18:31] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2022-06-13 01:18:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 627 ms
[2022-06-13 01:18:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-06-13 01:18:31] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2022-06-13 01:18:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:31] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2022-06-13 01:18:32] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2022-06-13 01:18:32] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:18:32] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2022-06-13 01:18:32] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2022-06-13 01:18:32] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2022-06-13 01:18:32] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2022-06-13 01:18:32] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2022-06-13 01:18:32] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2022-06-13 01:18:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 493 ms
[2022-06-13 01:18:32] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 23 ms.
[2022-06-13 01:18:33] [INFO ] Added : 214 causal constraints over 43 iterations in 1277 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-13 01:18:33] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-06-13 01:18:33] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 10 ms returned sat
[2022-06-13 01:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:34] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-06-13 01:18:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-06-13 01:18:34] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 12 ms returned sat
[2022-06-13 01:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:34] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 0 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 637 ms
[2022-06-13 01:18:35] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-06-13 01:18:35] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 8 ms returned sat
[2022-06-13 01:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:35] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-06-13 01:18:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-06-13 01:18:35] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 8 ms returned sat
[2022-06-13 01:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:35] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 190 ms
[2022-06-13 01:18:35] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 21 ms.
[2022-06-13 01:18:36] [INFO ] Added : 190 causal constraints over 38 iterations in 1021 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-13 01:18:36] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-13 01:18:36] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 10 ms returned sat
[2022-06-13 01:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:37] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2022-06-13 01:18:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned unsat
[2022-06-13 01:18:37] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-13 01:18:37] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 8 ms returned sat
[2022-06-13 01:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:37] [INFO ] [Real]Absence check using state equation in 121 ms returned unsat
[2022-06-13 01:18:37] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned unsat
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 21000 steps, including 257 resets, run finished after 54 ms. (steps per millisecond=388 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11500 steps, including 125 resets, run finished after 26 ms. (steps per millisecond=442 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 17 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 374/374 transitions.
Graph (trivial) has 211 edges and 403 vertex of which 4 / 403 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 841 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 398 transition count 289
Reduce places removed 80 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 84 rules applied. Total rules applied 166 place count 318 transition count 285
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 170 place count 314 transition count 285
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 170 place count 314 transition count 227
Deduced a syphon composed of 58 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 294 place count 248 transition count 227
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 340 place count 202 transition count 181
Iterating global reduction 3 with 46 rules applied. Total rules applied 386 place count 202 transition count 181
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 386 place count 202 transition count 178
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 393 place count 198 transition count 178
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 507 place count 140 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 509 place count 139 transition count 125
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 512 place count 139 transition count 122
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 515 place count 136 transition count 122
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 520 place count 136 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 521 place count 135 transition count 121
Applied a total of 521 rules in 120 ms. Remains 135 /403 variables (removed 268) and now considering 121/374 (removed 253) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/403 places, 121/374 transitions.
[2022-06-13 01:18:37] [INFO ] Flatten gal took : 52 ms
[2022-06-13 01:18:37] [INFO ] Flatten gal took : 18 ms
[2022-06-13 01:18:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15645313449067265255.gal : 11 ms
[2022-06-13 01:18:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5081082205943048414.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/ReachabilityCardinality15645313449067265255.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5081082205943048414.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/ReachabilityCardinality15645313449067265255.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5081082205943048414.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5081082205943048414.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 33
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :33 after 55
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :55 after 333
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :333 after 617
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :617 after 6611
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6611 after 98024
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :98024 after 8.01869e+06
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.20857e+07,0.965592,30600,2,4762,14,158985,7,0,687,69901,0
Total reachable state count : 32085688
Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-09-ReachabilityFireability-07 is true.
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-09-ReachabilityFireability-07,102592,0.969336,30600,2,459,14,158985,7,0,697,69901,0
All properties solved without resorting to model-checking.
BK_STOP 1655083121967
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="BusinessProcesses-PT-09"
export BK_EXAMINATION="ReachabilityFireability"
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 BusinessProcesses-PT-09, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-tall-165251936100147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-09.tgz
mv BusinessProcesses-PT-09 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;