About the Execution of 2023-gold for DiscoveryGPU-PT-14b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
353.752 | 8784.00 | 16926.00 | 339.60 | FFFFTFTTFFTTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151600314.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DiscoveryGPU-PT-14b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151600314
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 02:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 02:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:42 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 DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-12
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-13
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-14
FORMULA_NAME DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716421587008
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-14b
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-22 23:46:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 23:46:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:46:28] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-22 23:46:28] [INFO ] Transformed 408 places.
[2024-05-22 23:46:28] [INFO ] Transformed 434 transitions.
[2024-05-22 23:46:28] [INFO ] Found NUPN structural information;
[2024-05-22 23:46:28] [INFO ] Parsed PT model containing 408 places and 434 transitions and 1135 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 15) seen :12
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :1
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 408 cols
[2024-05-22 23:46:29] [INFO ] Computed 16 invariants in 22 ms
[2024-05-22 23:46:29] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:46:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-22 23:46:30] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:46:30] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-22 23:46:30] [INFO ] After 540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 39 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 434/434 transitions.
Graph (complete) has 706 edges and 408 vertex of which 356 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.4 ms
Discarding 52 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 356 transition count 333
Reduce places removed 62 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 66 rules applied. Total rules applied 142 place count 294 transition count 329
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 146 place count 290 transition count 329
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 146 place count 290 transition count 301
Deduced a syphon composed of 28 places in 6 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 202 place count 262 transition count 301
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 223 place count 241 transition count 280
Iterating global reduction 3 with 21 rules applied. Total rules applied 244 place count 241 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 244 place count 241 transition count 279
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 246 place count 240 transition count 279
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 256 place count 230 transition count 269
Iterating global reduction 3 with 10 rules applied. Total rules applied 266 place count 230 transition count 269
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 275 place count 221 transition count 260
Iterating global reduction 3 with 9 rules applied. Total rules applied 284 place count 221 transition count 260
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 291 place count 214 transition count 246
Iterating global reduction 3 with 7 rules applied. Total rules applied 298 place count 214 transition count 246
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 303 place count 209 transition count 241
Iterating global reduction 3 with 5 rules applied. Total rules applied 308 place count 209 transition count 241
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 418 place count 154 transition count 186
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 422 place count 150 transition count 178
Iterating global reduction 3 with 4 rules applied. Total rules applied 426 place count 150 transition count 178
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 429 place count 147 transition count 175
Iterating global reduction 3 with 3 rules applied. Total rules applied 432 place count 147 transition count 175
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 435 place count 144 transition count 172
Iterating global reduction 3 with 3 rules applied. Total rules applied 438 place count 144 transition count 172
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 440 place count 142 transition count 170
Iterating global reduction 3 with 2 rules applied. Total rules applied 442 place count 142 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
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 444 place count 141 transition count 171
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 448 place count 141 transition count 167
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 451 place count 141 transition count 164
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 454 place count 138 transition count 164
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 458 place count 138 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 459 place count 137 transition count 163
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 461 place count 136 transition count 162
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 3 rules applied. Total rules applied 464 place count 135 transition count 160
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 467 place count 133 transition count 159
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 467 place count 133 transition count 150
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 485 place count 124 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 491 place count 121 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 492 place count 121 transition count 146
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 493 place count 121 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 494 place count 121 transition count 145
Applied a total of 494 rules in 164 ms. Remains 121 /408 variables (removed 287) and now considering 145/434 (removed 289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 121/408 places, 145/434 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2584786 steps, run timeout after 3001 ms. (steps per millisecond=861 ) properties seen :{}
Probabilistic random walk after 2584786 steps, saw 448613 distinct states, run finished after 3002 ms. (steps per millisecond=861 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:46:33] [INFO ] Flow matrix only has 130 transitions (discarded 15 similar events)
// Phase 1: matrix 130 rows 121 cols
[2024-05-22 23:46:33] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:46:33] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:46:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:46:33] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:46:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:46:33] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:46:33] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-22 23:46:33] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 39 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 145/145 transitions.
Applied a total of 0 rules in 6 ms. Remains 121 /121 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 121/121 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 145/145 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2024-05-22 23:46:33] [INFO ] Flow matrix only has 130 transitions (discarded 15 similar events)
[2024-05-22 23:46:33] [INFO ] Invariant cache hit.
[2024-05-22 23:46:34] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 23:46:34] [INFO ] Flow matrix only has 130 transitions (discarded 15 similar events)
[2024-05-22 23:46:34] [INFO ] Invariant cache hit.
[2024-05-22 23:46:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:46:34] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-22 23:46:34] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-22 23:46:34] [INFO ] Flow matrix only has 130 transitions (discarded 15 similar events)
[2024-05-22 23:46:34] [INFO ] Invariant cache hit.
[2024-05-22 23:46:34] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 121/121 places, 145/145 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 121 transition count 130
Applied a total of 15 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 130/145 (removed 15) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 130 rows 121 cols
[2024-05-22 23:46:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:46:34] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:46:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:46:34] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:46:34] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-22 23:46:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-22 23:46:34] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-22 23:46:34] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:46:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-22 23:46:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 145 transitions and 466 arcs took 1 ms.
[2024-05-22 23:46:34] [INFO ] Flatten gal took : 39 ms
Total runtime 6109 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DiscoveryGPU-PT-14b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityCardinality
FORMULA DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1716421595792
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 8 (type EXCL) for 0 DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-09
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 7 (type SRCH) for 0 DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SRCH) for DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-09
lola: result : true
lola: markings : 34
lola: fired transitions : 34
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 5 (type EQUN) for DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 8 (type EXCL) for DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-09 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DiscoveryGPU-PT-14b-ReachabilityCardinality-2024-09: AG false tandem / insertion
Time elapsed: 0 secs. Pages in use: 2
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="DiscoveryGPU-PT-14b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DiscoveryGPU-PT-14b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631151600314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-14b.tgz
mv DiscoveryGPU-PT-14b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;