About the Execution of 2023-gold for Vasy2003-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 853.604 | 72737.00 | 155659.00 | 557.90 | TTTTTTTTFTFFTTTT | 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-171701123000180.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 Vasy2003-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701123000180
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 12 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:04 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 207K 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 Vasy2003-PT-none-ReachabilityFireability-2024-00
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-01
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-02
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-03
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-04
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-05
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-06
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-07
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-08
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-09
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-10
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-11
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-12
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-13
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-14
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717200086790
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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Vasy2003-PT-none
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-06-01 00:01:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:01:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:01:29] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-06-01 00:01:29] [INFO ] Transformed 485 places.
[2024-06-01 00:01:29] [INFO ] Transformed 776 transitions.
[2024-06-01 00:01:29] [INFO ] Found NUPN structural information;
[2024-06-01 00:01:29] [INFO ] Parsed PT model containing 485 places and 776 transitions and 2809 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 745 ms. (steps per millisecond=13 ) properties (out of 16) seen :6
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-06-01 00:01:31] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2024-06-01 00:01:31] [INFO ] Computed 66 invariants in 29 ms
[2024-06-01 00:01:32] [INFO ] After 618ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-01 00:01:32] [INFO ] [Nat]Absence check using 59 positive place invariants in 30 ms returned sat
[2024-06-01 00:01:32] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2024-06-01 00:01:35] [INFO ] After 2195ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2024-06-01 00:01:35] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-01 00:01:37] [INFO ] After 2487ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2024-06-01 00:01:38] [INFO ] Deduced a trap composed of 124 places in 332 ms of which 11 ms to minimize.
[2024-06-01 00:01:38] [INFO ] Deduced a trap composed of 129 places in 195 ms of which 1 ms to minimize.
[2024-06-01 00:01:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 668 ms
[2024-06-01 00:01:39] [INFO ] Deduced a trap composed of 129 places in 208 ms of which 2 ms to minimize.
[2024-06-01 00:01:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2024-06-01 00:01:41] [INFO ] After 6227ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 2248 ms.
[2024-06-01 00:01:43] [INFO ] After 11214ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 139 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 100 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 483 transition count 741
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 480 transition count 741
Discarding 116 places :
Symmetric choice reduction at 0 with 116 rule applications. Total rules 123 place count 364 transition count 625
Iterating global reduction 0 with 116 rules applied. Total rules applied 239 place count 364 transition count 625
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 266 place count 364 transition count 598
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 312 place count 318 transition count 541
Iterating global reduction 1 with 46 rules applied. Total rules applied 358 place count 318 transition count 541
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 386 place count 318 transition count 513
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 406 place count 298 transition count 485
Iterating global reduction 2 with 20 rules applied. Total rules applied 426 place count 298 transition count 485
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 438 place count 298 transition count 473
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 444 place count 292 transition count 463
Iterating global reduction 3 with 6 rules applied. Total rules applied 450 place count 292 transition count 463
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 454 place count 290 transition count 461
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 456 place count 288 transition count 459
Iterating global reduction 3 with 2 rules applied. Total rules applied 458 place count 288 transition count 459
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 462 place count 288 transition count 455
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 464 place count 286 transition count 452
Iterating global reduction 4 with 2 rules applied. Total rules applied 466 place count 286 transition count 452
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 467 place count 286 transition count 451
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 469 place count 286 transition count 449
Applied a total of 469 rules in 229 ms. Remains 286 /485 variables (removed 199) and now considering 449/752 (removed 303) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 286/485 places, 449/752 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 126921 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{3=1}
Probabilistic random walk after 126921 steps, saw 106462 distinct states, run finished after 3004 ms. (steps per millisecond=42 ) properties seen :1
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
[2024-06-01 00:01:47] [INFO ] Flow matrix only has 411 transitions (discarded 38 similar events)
// Phase 1: matrix 411 rows 286 cols
[2024-06-01 00:01:47] [INFO ] Computed 66 invariants in 6 ms
[2024-06-01 00:01:47] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-01 00:01:48] [INFO ] [Nat]Absence check using 59 positive place invariants in 18 ms returned sat
[2024-06-01 00:01:48] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 5 ms returned sat
[2024-06-01 00:01:48] [INFO ] After 859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-01 00:01:48] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 00:01:49] [INFO ] After 784ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-06-01 00:01:50] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 1 ms to minimize.
[2024-06-01 00:01:50] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2024-06-01 00:01:50] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 1 ms to minimize.
[2024-06-01 00:01:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 343 ms
[2024-06-01 00:01:50] [INFO ] After 1976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 657 ms.
[2024-06-01 00:01:51] [INFO ] After 3696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 122 ms.
Support contains 136 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 449/449 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 285 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 284 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 284 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 283 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 283 transition count 446
Applied a total of 6 rules in 34 ms. Remains 283 /286 variables (removed 3) and now considering 446/449 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 283/286 places, 446/449 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 7) seen :1
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-06-01 00:01:52] [INFO ] Flow matrix only has 408 transitions (discarded 38 similar events)
// Phase 1: matrix 408 rows 283 cols
[2024-06-01 00:01:52] [INFO ] Computed 66 invariants in 8 ms
[2024-06-01 00:01:52] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 00:01:52] [INFO ] [Nat]Absence check using 59 positive place invariants in 17 ms returned sat
[2024-06-01 00:01:52] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2024-06-01 00:01:53] [INFO ] After 709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-01 00:01:53] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 00:01:54] [INFO ] After 562ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-06-01 00:01:54] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
[2024-06-01 00:01:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2024-06-01 00:01:54] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 0 ms to minimize.
[2024-06-01 00:01:54] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 1 ms to minimize.
[2024-06-01 00:01:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2024-06-01 00:01:55] [INFO ] After 1722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 915 ms.
[2024-06-01 00:01:56] [INFO ] After 3523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 89 ms.
Support contains 129 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 446/446 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 282 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 282 transition count 445
Applied a total of 2 rules in 21 ms. Remains 282 /283 variables (removed 1) and now considering 445/446 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 282/283 places, 445/446 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 6) seen :2
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-06-01 00:01:56] [INFO ] Flow matrix only has 407 transitions (discarded 38 similar events)
// Phase 1: matrix 407 rows 282 cols
[2024-06-01 00:01:56] [INFO ] Computed 66 invariants in 6 ms
[2024-06-01 00:01:56] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 00:01:56] [INFO ] [Nat]Absence check using 59 positive place invariants in 24 ms returned sat
[2024-06-01 00:01:56] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 6 ms returned sat
[2024-06-01 00:01:57] [INFO ] After 858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 00:01:57] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 00:01:58] [INFO ] After 714ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-01 00:01:59] [INFO ] After 1368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 675 ms.
[2024-06-01 00:01:59] [INFO ] After 3096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 45 ms.
Support contains 95 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 445/445 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 282 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 444
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 281 transition count 443
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 280 transition count 443
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 26 place count 258 transition count 415
Iterating global reduction 2 with 22 rules applied. Total rules applied 48 place count 258 transition count 415
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 57 place count 258 transition count 406
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 64 place count 251 transition count 395
Iterating global reduction 3 with 7 rules applied. Total rules applied 71 place count 251 transition count 395
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 75 place count 251 transition count 391
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 250 transition count 390
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 80 place count 247 transition count 386
Iterating global reduction 4 with 3 rules applied. Total rules applied 83 place count 247 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 87 place count 247 transition count 382
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 89 place count 245 transition count 379
Iterating global reduction 5 with 2 rules applied. Total rules applied 91 place count 245 transition count 379
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 94 place count 245 transition count 376
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 98 place count 245 transition count 372
Applied a total of 98 rules in 89 ms. Remains 245 /282 variables (removed 37) and now considering 372/445 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 245/282 places, 372/445 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 171994 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171994 steps, saw 137462 distinct states, run finished after 3005 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 4 properties.
[2024-06-01 00:02:03] [INFO ] Flow matrix only has 340 transitions (discarded 32 similar events)
// Phase 1: matrix 340 rows 245 cols
[2024-06-01 00:02:03] [INFO ] Computed 66 invariants in 7 ms
[2024-06-01 00:02:03] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 00:02:03] [INFO ] [Nat]Absence check using 59 positive place invariants in 18 ms returned sat
[2024-06-01 00:02:03] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 6 ms returned sat
[2024-06-01 00:02:04] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 00:02:04] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-06-01 00:02:04] [INFO ] After 393ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-01 00:02:05] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 0 ms to minimize.
[2024-06-01 00:02:05] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 0 ms to minimize.
[2024-06-01 00:02:05] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 0 ms to minimize.
[2024-06-01 00:02:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 366 ms
[2024-06-01 00:02:05] [INFO ] After 1365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 443 ms.
[2024-06-01 00:02:06] [INFO ] After 2471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 55 ms.
Support contains 95 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 372/372 transitions.
Applied a total of 0 rules in 14 ms. Remains 245 /245 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 245/245 places, 372/372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 372/372 transitions.
Applied a total of 0 rules in 13 ms. Remains 245 /245 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-06-01 00:02:06] [INFO ] Flow matrix only has 340 transitions (discarded 32 similar events)
[2024-06-01 00:02:06] [INFO ] Invariant cache hit.
[2024-06-01 00:02:06] [INFO ] Implicit Places using invariants in 261 ms returned [95, 98, 104, 105, 106, 109, 216]
Discarding 7 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 266 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 238/245 places, 370/372 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 238 transition count 367
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 367
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 233 transition count 365
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 233 transition count 365
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 232 transition count 366
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 232 transition count 365
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 232 transition count 362
Applied a total of 16 rules in 42 ms. Remains 232 /238 variables (removed 6) and now considering 362/370 (removed 8) transitions.
[2024-06-01 00:02:06] [INFO ] Flow matrix only has 334 transitions (discarded 28 similar events)
// Phase 1: matrix 334 rows 232 cols
[2024-06-01 00:02:06] [INFO ] Computed 57 invariants in 5 ms
[2024-06-01 00:02:06] [INFO ] Implicit Places using invariants in 194 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 231/245 places, 362/372 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 361
Applied a total of 2 rules in 15 ms. Remains 230 /231 variables (removed 1) and now considering 361/362 (removed 1) transitions.
[2024-06-01 00:02:06] [INFO ] Flow matrix only has 333 transitions (discarded 28 similar events)
// Phase 1: matrix 333 rows 230 cols
[2024-06-01 00:02:06] [INFO ] Computed 56 invariants in 4 ms
[2024-06-01 00:02:07] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 00:02:07] [INFO ] Flow matrix only has 333 transitions (discarded 28 similar events)
[2024-06-01 00:02:07] [INFO ] Invariant cache hit.
[2024-06-01 00:02:07] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 00:02:07] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 230/245 places, 361/372 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1076 ms. Remains : 230/245 places, 361/372 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 193594 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193594 steps, saw 145292 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 4 properties.
[2024-06-01 00:02:10] [INFO ] Flow matrix only has 333 transitions (discarded 28 similar events)
[2024-06-01 00:02:10] [INFO ] Invariant cache hit.
[2024-06-01 00:02:11] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 00:02:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 19 ms returned sat
[2024-06-01 00:02:11] [INFO ] [Nat]Absence check using 50 positive and 6 generalized place invariants in 12 ms returned sat
[2024-06-01 00:02:11] [INFO ] After 756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 00:02:11] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 00:02:12] [INFO ] After 421ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-01 00:02:12] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 1 ms to minimize.
[2024-06-01 00:02:12] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 4 ms to minimize.
[2024-06-01 00:02:13] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 1 ms to minimize.
[2024-06-01 00:02:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 450 ms
[2024-06-01 00:02:13] [INFO ] After 1294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 403 ms.
[2024-06-01 00:02:13] [INFO ] After 2637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 95 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 361/361 transitions.
Applied a total of 0 rules in 14 ms. Remains 230 /230 variables (removed 0) and now considering 361/361 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 230/230 places, 361/361 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 361/361 transitions.
Applied a total of 0 rules in 14 ms. Remains 230 /230 variables (removed 0) and now considering 361/361 (removed 0) transitions.
[2024-06-01 00:02:13] [INFO ] Flow matrix only has 333 transitions (discarded 28 similar events)
[2024-06-01 00:02:13] [INFO ] Invariant cache hit.
[2024-06-01 00:02:13] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 00:02:13] [INFO ] Flow matrix only has 333 transitions (discarded 28 similar events)
[2024-06-01 00:02:13] [INFO ] Invariant cache hit.
[2024-06-01 00:02:14] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 00:02:14] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-06-01 00:02:14] [INFO ] Redundant transitions in 28 ms returned []
[2024-06-01 00:02:14] [INFO ] Flow matrix only has 333 transitions (discarded 28 similar events)
[2024-06-01 00:02:14] [INFO ] Invariant cache hit.
[2024-06-01 00:02:14] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1024 ms. Remains : 230/230 places, 361/361 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 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 0 with 29 rules applied. Total rules applied 29 place count 230 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 229 transition count 332
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 30 place count 229 transition count 319
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 56 place count 216 transition count 319
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 214 transition count 317
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 214 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 213 transition count 309
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 213 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 212 transition count 308
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 212 transition count 307
Applied a total of 72 rules in 64 ms. Remains 212 /230 variables (removed 18) and now considering 307/361 (removed 54) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 307 rows 212 cols
[2024-06-01 00:02:14] [INFO ] Computed 55 invariants in 15 ms
[2024-06-01 00:02:14] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 00:02:15] [INFO ] [Nat]Absence check using 50 positive place invariants in 19 ms returned sat
[2024-06-01 00:02:15] [INFO ] [Nat]Absence check using 50 positive and 5 generalized place invariants in 7 ms returned sat
[2024-06-01 00:02:15] [INFO ] After 633ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 00:02:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 00:02:16] [INFO ] After 479ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-01 00:02:16] [INFO ] After 990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 496 ms.
[2024-06-01 00:02:17] [INFO ] After 2317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-06-01 00:02:17] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 00:02:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 230 places, 361 transitions and 1413 arcs took 3 ms.
[2024-06-01 00:02:17] [INFO ] Flatten gal took : 136 ms
Total runtime 48382 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Vasy2003-PT-none
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/365
ReachabilityFireability
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1717200159527
--------------------
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 ReachabilityFireability -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/365/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/365/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/365/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 16 (type EXCL) for 0 Vasy2003-PT-none-ReachabilityFireability-2024-02
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 0 Vasy2003-PT-none-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 0 Vasy2003-PT-none-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 0 Vasy2003-PT-none-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/365/ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Vasy2003-PT-none-ReachabilityFireability-2024-02: EF 0 1 4 0 1 0 0 0
Vasy2003-PT-none-ReachabilityFireability-2024-03: EF 0 5 0 0 1 0 0 0
Vasy2003-PT-none-ReachabilityFireability-2024-14: EF 0 5 0 0 1 0 0 0
Vasy2003-PT-none-ReachabilityFireability-2024-15: EF 0 5 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 EF FNDP 5/599 0/5 Vasy2003-PT-none-ReachabilityFireability-2024-02 718949 t fired, 1 attempts, .
13 EF STEQ 5/719 0/5 Vasy2003-PT-none-ReachabilityFireability-2024-02 sara is running.
15 EF SRCH 5/719 2/5 Vasy2003-PT-none-ReachabilityFireability-2024-02 332260 m, 66452 m/sec, 701302 t fired, .
16 EF EXCL 5/899 1/32 Vasy2003-PT-none-ReachabilityFireability-2024-02 55986 m, 11197 m/sec, 81308 t fired, .
Time elapsed: 6 secs. Pages in use: 3
# running tasks: 4 of 4 Visible: 4
lola: FINISHED task # 13 (type EQUN) for Vasy2003-PT-none-ReachabilityFireability-2024-02
lola: result : true
lola: CANCELED task # 12 (type FNDP) for Vasy2003-PT-none-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 15 (type SRCH) for Vasy2003-PT-none-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 16 (type EXCL) for Vasy2003-PT-none-ReachabilityFireability-2024-02 (obsolete)
lola: LAUNCH task # 22 (type EXCL) for 6 Vasy2003-PT-none-ReachabilityFireability-2024-14
lola: time limit : 1197 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 30 (type FNDP) for 3 Vasy2003-PT-none-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 31 (type EQUN) for 3 Vasy2003-PT-none-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 33 (type SRCH) for 3 Vasy2003-PT-none-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 12 (type FNDP) for Vasy2003-PT-none-ReachabilityFireability-2024-02
lola: result : unknown
lola: fired transitions : 783256
lola: tried executions : 2
lola: time used : 6.000000
lola: memory pages used : 0
lola: FINISHED task # 33 (type SRCH) for Vasy2003-PT-none-ReachabilityFireability-2024-03
lola: result : true
lola: markings : 17
lola: fired transitions : 16
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 30 (type FNDP) for Vasy2003-PT-none-ReachabilityFireability-2024-03 (obsolete)
lola: CANCELED task # 31 (type EQUN) for Vasy2003-PT-none-ReachabilityFireability-2024-03 (obsolete)
lola: LAUNCH task # 24 (type FNDP) for 9 Vasy2003-PT-none-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type EQUN) for 9 Vasy2003-PT-none-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 27 (type SRCH) for 9 Vasy2003-PT-none-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 30 (type FNDP) for Vasy2003-PT-none-ReachabilityFireability-2024-03
lola: result : true
lola: fired transitions : 15
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/365/ReachabilityFireability-25.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Vasy2003-PT-none-ReachabilityFireability-2024-02: EF true state equation
Vasy2003-PT-none-ReachabilityFireability-2024-03: EF true tandem / insertion
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Vasy2003-PT-none-ReachabilityFireability-2024-14: EF 0 4 1 0 1 0 0 0
Vasy2003-PT-none-ReachabilityFireability-2024-15: EF 0 2 3 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
22 EF EXCL 4/1796 1/32 Vasy2003-PT-none-ReachabilityFireability-2024-14 23863 m, 4772 m/sec, 42929 t fired, .
24 EF FNDP 4/1197 0/5 Vasy2003-PT-none-ReachabilityFireability-2024-15 461787 t fired, 1 attempts, .
25 EF STEQ 4/1197 0/5 Vasy2003-PT-none-ReachabilityFireability-2024-15 sara is running.
27 EF SRCH 4/1796 1/5 Vasy2003-PT-none-ReachabilityFireability-2024-15 198098 m, 39619 m/sec, 340359 t fired, .
Time elapsed: 11 secs. Pages in use: 3
# running tasks: 4 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Vasy2003-PT-none-ReachabilityFireability-2024-02: EF true state equation
Vasy2003-PT-none-ReachabilityFireability-2024-03: EF true tandem / insertion
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Vasy2003-PT-none-ReachabilityFireability-2024-14: EF 0 4 1 0 1 0 0 0
Vasy2003-PT-none-ReachabilityFireability-2024-15: EF 0 2 3 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
22 EF EXCL 9/1796 1/32 Vasy2003-PT-none-ReachabilityFireability-2024-14 48847 m, 4996 m/sec, 88234 t fired, .
24 EF FNDP 9/1193 0/5 Vasy2003-PT-none-ReachabilityFireability-2024-15 1138258 t fired, 2 attempts, .
25 EF STEQ 9/1193 0/5 Vasy2003-PT-none-ReachabilityFireability-2024-15 sara is running.
27 EF SRCH 9/1792 2/5 Vasy2003-PT-none-ReachabilityFireability-2024-15 419863 m, 44353 m/sec, 717729 t fired, .
Time elapsed: 16 secs. Pages in use: 3
# running tasks: 4 of 4 Visible: 4
lola: FINISHED task # 24 (type FNDP) for Vasy2003-PT-none-ReachabilityFireability-2024-15
lola: result : true
lola: fired transitions : 1730837
lola: tried executions : 2
lola: time used : 14.000000
lola: memory pages used : 0
lola: CANCELED task # 25 (type EQUN) for Vasy2003-PT-none-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 27 (type SRCH) for Vasy2003-PT-none-ReachabilityFireability-2024-15 (obsolete)
lola: LAUNCH task # 18 (type FNDP) for 6 Vasy2003-PT-none-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 6 Vasy2003-PT-none-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type SRCH) for 6 Vasy2003-PT-none-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 25 (type EQUN) for Vasy2003-PT-none-ReachabilityFireability-2024-15
lola: result : unknown
sara: try reading problem file /home/mcc/execution/365/ReachabilityFireability-19.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 18 (type FNDP) for Vasy2003-PT-none-ReachabilityFireability-2024-14
lola: result : true
lola: fired transitions : 87
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 19 (type EQUN) for Vasy2003-PT-none-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 21 (type SRCH) for Vasy2003-PT-none-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 22 (type EXCL) for Vasy2003-PT-none-ReachabilityFireability-2024-14 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Vasy2003-PT-none-ReachabilityFireability-2024-02: EF true state equation
Vasy2003-PT-none-ReachabilityFireability-2024-03: EF true tandem / insertion
Vasy2003-PT-none-ReachabilityFireability-2024-14: EF true findpath
Vasy2003-PT-none-ReachabilityFireability-2024-15: EF true findpath
Time elapsed: 21 secs. Pages in use: 4
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="Vasy2003-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
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 Vasy2003-PT-none, 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 r461-smll-171701123000180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Vasy2003-PT-none.tgz
mv Vasy2003-PT-none 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 ;