fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r461-smll-171701122600004
Last Updated
July 7, 2024

About the Execution of 2023-gold for UtahNoC-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
391.380 22164.00 44254.00 575.30 TTTFTFFFTFTFFFTT 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.r461-smll-171701122600004.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 UtahNoC-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701122600004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 10:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 10:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 10:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 205K May 18 16:43 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 UtahNoC-PT-none-ReachabilityCardinality-2024-00
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-01
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-02
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-03
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-04
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-05
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-06
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-07
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-08
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-09
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-10
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-11
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-12
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-13
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-14
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717171388233

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=UtahNoC-PT-none
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-31 16:03:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 16:03:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 16:03:11] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-31 16:03:11] [INFO ] Transformed 216 places.
[2024-05-31 16:03:11] [INFO ] Transformed 977 transitions.
[2024-05-31 16:03:11] [INFO ] Found NUPN structural information;
[2024-05-31 16:03:11] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 819 ms. (steps per millisecond=12 ) properties (out of 12) seen :7
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-31 16:03:12] [INFO ] Flow matrix only has 427 transitions (discarded 402 similar events)
// Phase 1: matrix 427 rows 216 cols
[2024-05-31 16:03:12] [INFO ] Computed 8 invariants in 15 ms
[2024-05-31 16:03:13] [INFO ] After 554ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 16:03:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-05-31 16:03:14] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-31 16:03:14] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 16:03:14] [INFO ] After 241ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-31 16:03:14] [INFO ] After 575ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 245 ms.
[2024-05-31 16:03:15] [INFO ] After 1648ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 65 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 829/829 transitions.
Graph (trivial) has 214 edges and 216 vertex of which 43 / 216 are part of one of the 12 SCC in 20 ms
Free SCC test removed 31 places
Drop transitions removed 174 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 192 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 635
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 183 transition count 635
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 183 transition count 634
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 182 transition count 634
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 31 place count 158 transition count 541
Iterating global reduction 2 with 24 rules applied. Total rules applied 55 place count 158 transition count 541
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 75 place count 158 transition count 521
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 78 place count 155 transition count 511
Iterating global reduction 3 with 3 rules applied. Total rules applied 81 place count 155 transition count 511
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 155 transition count 509
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 89 place count 152 transition count 506
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 93 place count 152 transition count 502
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 94 place count 151 transition count 500
Iterating global reduction 5 with 1 rules applied. Total rules applied 95 place count 151 transition count 500
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 96 place count 151 transition count 499
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 98 place count 150 transition count 503
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 109 place count 150 transition count 492
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 115 place count 150 transition count 486
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 124 place count 144 transition count 483
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 127 place count 144 transition count 483
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 128 place count 144 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 129 place count 144 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 130 place count 143 transition count 481
Applied a total of 130 rules in 328 ms. Remains 143 /216 variables (removed 73) and now considering 481/829 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 143/216 places, 481/829 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 4) seen :1
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 16:03:16] [INFO ] Flow matrix only has 282 transitions (discarded 199 similar events)
// Phase 1: matrix 282 rows 143 cols
[2024-05-31 16:03:16] [INFO ] Computed 8 invariants in 4 ms
[2024-05-31 16:03:16] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 16:03:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-31 16:03:16] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-31 16:03:16] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-31 16:03:16] [INFO ] After 163ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-31 16:03:16] [INFO ] After 350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 159 ms.
[2024-05-31 16:03:17] [INFO ] After 826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 62 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 481/481 transitions.
Graph (trivial) has 45 edges and 143 vertex of which 2 / 143 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 140 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 140 transition count 471
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 7 place count 140 transition count 469
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 140 transition count 468
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 140 transition count 471
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 139 transition count 470
Applied a total of 11 rules in 58 ms. Remains 139 /143 variables (removed 4) and now considering 470/481 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 139/143 places, 470/481 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 280517 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 280517 steps, saw 175847 distinct states, run finished after 3003 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-31 16:03:20] [INFO ] Flow matrix only has 277 transitions (discarded 193 similar events)
// Phase 1: matrix 277 rows 139 cols
[2024-05-31 16:03:20] [INFO ] Computed 8 invariants in 2 ms
[2024-05-31 16:03:20] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 16:03:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 16:03:20] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-31 16:03:20] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-31 16:03:21] [INFO ] After 158ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-31 16:03:21] [INFO ] After 350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-31 16:03:21] [INFO ] After 810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 62 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 470/470 transitions.
Applied a total of 0 rules in 8 ms. Remains 139 /139 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 139/139 places, 470/470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 470/470 transitions.
Applied a total of 0 rules in 8 ms. Remains 139 /139 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-05-31 16:03:21] [INFO ] Flow matrix only has 277 transitions (discarded 193 similar events)
[2024-05-31 16:03:21] [INFO ] Invariant cache hit.
[2024-05-31 16:03:21] [INFO ] Implicit Places using invariants in 69 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 138/139 places, 470/470 transitions.
Graph (trivial) has 52 edges and 138 vertex of which 9 / 138 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 130 transition count 449
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 130 transition count 449
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 130 transition count 445
Applied a total of 11 rules in 18 ms. Remains 130 /138 variables (removed 8) and now considering 445/470 (removed 25) transitions.
[2024-05-31 16:03:21] [INFO ] Flow matrix only has 261 transitions (discarded 184 similar events)
// Phase 1: matrix 261 rows 130 cols
[2024-05-31 16:03:21] [INFO ] Computed 7 invariants in 2 ms
[2024-05-31 16:03:21] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 16:03:21] [INFO ] Flow matrix only has 261 transitions (discarded 184 similar events)
[2024-05-31 16:03:21] [INFO ] Invariant cache hit.
[2024-05-31 16:03:21] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-31 16:03:21] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 130/139 places, 445/470 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 333 ms. Remains : 130/139 places, 445/470 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 189526 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189526 steps, saw 117571 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-31 16:03:25] [INFO ] Flow matrix only has 261 transitions (discarded 184 similar events)
[2024-05-31 16:03:25] [INFO ] Invariant cache hit.
[2024-05-31 16:03:25] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 16:03:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-31 16:03:25] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-31 16:03:25] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-31 16:03:25] [INFO ] After 149ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-31 16:03:25] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 135 ms.
[2024-05-31 16:03:25] [INFO ] After 783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 ms.
Support contains 62 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 130 /130 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 130/130 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 130 /130 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2024-05-31 16:03:26] [INFO ] Flow matrix only has 261 transitions (discarded 184 similar events)
[2024-05-31 16:03:26] [INFO ] Invariant cache hit.
[2024-05-31 16:03:26] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 16:03:26] [INFO ] Flow matrix only has 261 transitions (discarded 184 similar events)
[2024-05-31 16:03:26] [INFO ] Invariant cache hit.
[2024-05-31 16:03:26] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-31 16:03:26] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-05-31 16:03:26] [INFO ] Redundant transitions in 51 ms returned []
[2024-05-31 16:03:26] [INFO ] Flow matrix only has 261 transitions (discarded 184 similar events)
[2024-05-31 16:03:26] [INFO ] Invariant cache hit.
[2024-05-31 16:03:26] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 755 ms. Remains : 130/130 places, 445/445 transitions.
Graph (trivial) has 132 edges and 130 vertex of which 10 / 130 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 91 transitions
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 196 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 124 transition count 245
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 120 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 119 transition count 244
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 11 place count 119 transition count 241
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 17 place count 116 transition count 241
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 115 transition count 240
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 115 transition count 240
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 39 place count 105 transition count 230
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 61 place count 105 transition count 208
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 105 transition count 206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 103 transition count 206
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 74 place count 103 transition count 206
Applied a total of 74 rules in 67 ms. Remains 103 /130 variables (removed 27) and now considering 206/445 (removed 239) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 206 rows 103 cols
[2024-05-31 16:03:26] [INFO ] Computed 7 invariants in 2 ms
[2024-05-31 16:03:26] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 16:03:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-31 16:03:27] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-31 16:03:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 16:03:27] [INFO ] After 111ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-31 16:03:27] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-31 16:03:27] [INFO ] After 664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-31 16:03:27] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-31 16:03:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 130 places, 445 transitions and 1492 arcs took 5 ms.
[2024-05-31 16:03:28] [INFO ] Flatten gal took : 135 ms
Total runtime 16927 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT UtahNoC-PT-none
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityCardinality

FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717171410397

--------------------
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: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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 # 14 (type EXCL) for 0 UtahNoC-PT-none-ReachabilityCardinality-2024-03
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type FNDP) for 0 UtahNoC-PT-none-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type EQUN) for 0 UtahNoC-PT-none-ReachabilityCardinality-2024-03
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 # 13 (type SRCH) for 0 UtahNoC-PT-none-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 10 (type FNDP) for UtahNoC-PT-none-ReachabilityCardinality-2024-03
lola: result : true
lola: fired transitions : 8
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 11 (type EQUN) for UtahNoC-PT-none-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 13 (type SRCH) for UtahNoC-PT-none-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 14 (type EXCL) for UtahNoC-PT-none-ReachabilityCardinality-2024-03 (obsolete)
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 # 21 (type EXCL) for 6 UtahNoC-PT-none-ReachabilityCardinality-2024-12
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 17 (type FNDP) for 6 UtahNoC-PT-none-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type EQUN) for 6 UtahNoC-PT-none-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type SRCH) for 6 UtahNoC-PT-none-ReachabilityCardinality-2024-12
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: 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
sara: try reading problem file /home/mcc/execution/372/ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 17 (type FNDP) for UtahNoC-PT-none-ReachabilityCardinality-2024-12
lola: result : true
lola: fired transitions : 1595
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 18 (type EQUN) for UtahNoC-PT-none-ReachabilityCardinality-2024-12 (obsolete)
lola: CANCELED task # 20 (type SRCH) for UtahNoC-PT-none-ReachabilityCardinality-2024-12 (obsolete)
lola: CANCELED task # 21 (type EXCL) for UtahNoC-PT-none-ReachabilityCardinality-2024-12 (obsolete)
lola: LAUNCH task # 28 (type EXCL) for 3 UtahNoC-PT-none-ReachabilityCardinality-2024-06
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 24 (type FNDP) for 3 UtahNoC-PT-none-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type EQUN) for 3 UtahNoC-PT-none-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type SRCH) for 3 UtahNoC-PT-none-ReachabilityCardinality-2024-06
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: FINISHED task # 11 (type EQUN) for UtahNoC-PT-none-ReachabilityCardinality-2024-03
lola: result : true
sara: try reading problem file /home/mcc/execution/372/ReachabilityCardinality-25.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 24 (type FNDP) for UtahNoC-PT-none-ReachabilityCardinality-2024-06
lola: result : true
lola: fired transitions : 5949
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 25 (type EQUN) for UtahNoC-PT-none-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 27 (type SRCH) for UtahNoC-PT-none-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 28 (type EXCL) for UtahNoC-PT-none-ReachabilityCardinality-2024-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtahNoC-PT-none-ReachabilityCardinality-2024-03: AG false findpath
UtahNoC-PT-none-ReachabilityCardinality-2024-06: AG false findpath
UtahNoC-PT-none-ReachabilityCardinality-2024-12: AG false findpath


Time elapsed: 1 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="UtahNoC-PT-none"
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 UtahNoC-PT-none, 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 r461-smll-171701122600004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtahNoC-PT-none.tgz
mv UtahNoC-PT-none 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;