fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r490-tall-167912709701230
Last Updated
May 14, 2023

About the Execution of Marcie+red for Vasy2003-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5448.216 23653.00 36308.00 319.00 FTTTTFFTFTTTTFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r490-tall-167912709701230.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Vasy2003-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709701230
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.5K Feb 25 14:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 14:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 14:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 207K Mar 5 18:23 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-ReachabilityCardinality-00
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-01
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-02
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-03
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-04
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-05
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-06
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-07
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-08
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-09
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-10
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-11
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-12
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-13
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-14
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679400868933

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Vasy2003-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 12:14:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 12:14:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 12:14:30] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-21 12:14:30] [INFO ] Transformed 485 places.
[2023-03-21 12:14:30] [INFO ] Transformed 776 transitions.
[2023-03-21 12:14:30] [INFO ] Found NUPN structural information;
[2023-03-21 12:14:30] [INFO ] Parsed PT model containing 485 places and 776 transitions and 2809 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
FORMULA Vasy2003-PT-none-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 10) seen :2
FORMULA Vasy2003-PT-none-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 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 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-21 12:14:31] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2023-03-21 12:14:31] [INFO ] Computed 66 place invariants in 24 ms
[2023-03-21 12:14:31] [INFO ] [Real]Absence check using 59 positive place invariants in 18 ms returned sat
[2023-03-21 12:14:31] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-21 12:14:31] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 12:14:31] [INFO ] [Nat]Absence check using 59 positive place invariants in 15 ms returned sat
[2023-03-21 12:14:31] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-21 12:14:32] [INFO ] After 525ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-21 12:14:32] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-21 12:14:32] [INFO ] After 409ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2023-03-21 12:14:33] [INFO ] Deduced a trap composed of 129 places in 143 ms of which 6 ms to minimize.
[2023-03-21 12:14:33] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 1 ms to minimize.
[2023-03-21 12:14:33] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 1 ms to minimize.
[2023-03-21 12:14:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 507 ms
[2023-03-21 12:14:33] [INFO ] After 1417ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 502 ms.
[2023-03-21 12:14:34] [INFO ] After 2713ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
FORMULA Vasy2003-PT-none-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Vasy2003-PT-none-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 94 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 116 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1555 edges and 483 vertex of which 481 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 6 place count 481 transition count 739
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 480 transition count 739
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 7 place count 480 transition count 733
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 19 place count 474 transition count 733
Discarding 110 places :
Symmetric choice reduction at 2 with 110 rule applications. Total rules 129 place count 364 transition count 623
Iterating global reduction 2 with 110 rules applied. Total rules applied 239 place count 364 transition count 623
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 263 place count 364 transition count 599
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 309 place count 318 transition count 543
Iterating global reduction 3 with 46 rules applied. Total rules applied 355 place count 318 transition count 543
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 377 place count 318 transition count 521
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 398 place count 297 transition count 490
Iterating global reduction 4 with 21 rules applied. Total rules applied 419 place count 297 transition count 490
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 432 place count 297 transition count 477
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 439 place count 290 transition count 466
Iterating global reduction 5 with 7 rules applied. Total rules applied 446 place count 290 transition count 466
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 449 place count 290 transition count 463
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 471 place count 279 transition count 452
Graph (complete) has 956 edges and 279 vertex of which 259 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 472 place count 259 transition count 447
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 482 place count 259 transition count 437
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 484 place count 257 transition count 435
Iterating global reduction 8 with 2 rules applied. Total rules applied 486 place count 257 transition count 435
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 490 place count 257 transition count 431
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 492 place count 255 transition count 428
Iterating global reduction 9 with 2 rules applied. Total rules applied 494 place count 255 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 495 place count 255 transition count 427
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 10 with 12 rules applied. Total rules applied 507 place count 255 transition count 415
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 510 place count 255 transition count 412
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 518 place count 252 transition count 407
Applied a total of 518 rules in 142 ms. Remains 252 /485 variables (removed 233) and now considering 407/752 (removed 345) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 252/485 places, 407/752 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :1
FORMULA Vasy2003-PT-none-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :1
FORMULA Vasy2003-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
[2023-03-21 12:14:34] [INFO ] Flow matrix only has 370 transitions (discarded 37 similar events)
// Phase 1: matrix 370 rows 252 cols
[2023-03-21 12:14:34] [INFO ] Computed 55 place invariants in 3 ms
[2023-03-21 12:14:34] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 12:14:34] [INFO ] [Nat]Absence check using 47 positive place invariants in 6 ms returned sat
[2023-03-21 12:14:35] [INFO ] [Nat]Absence check using 47 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-21 12:14:35] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 12:14:35] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-21 12:14:35] [INFO ] After 152ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 12:14:35] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-21 12:14:35] [INFO ] After 784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 28 ms.
Support contains 81 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 407/407 transitions.
Graph (complete) has 867 edges and 252 vertex of which 248 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 248 transition count 404
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 241 transition count 396
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 241 transition count 396
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 22 place count 241 transition count 391
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 240 transition count 390
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 237 transition count 385
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 237 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 237 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 236 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 236 transition count 383
Applied a total of 33 rules in 29 ms. Remains 236 /252 variables (removed 16) and now considering 383/407 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 236/252 places, 383/407 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 4) seen :1
FORMULA Vasy2003-PT-none-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) 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 3) seen :1
FORMULA Vasy2003-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
[2023-03-21 12:14:35] [INFO ] Flow matrix only has 348 transitions (discarded 35 similar events)
// Phase 1: matrix 348 rows 236 cols
[2023-03-21 12:14:35] [INFO ] Computed 53 place invariants in 6 ms
[2023-03-21 12:14:36] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 12:14:36] [INFO ] [Nat]Absence check using 46 positive place invariants in 6 ms returned sat
[2023-03-21 12:14:36] [INFO ] [Nat]Absence check using 46 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-21 12:14:36] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 12:14:36] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-21 12:14:36] [INFO ] After 91ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 12:14:36] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-21 12:14:36] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 49 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 383/383 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 236 transition count 381
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 234 transition count 381
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 27 place count 211 transition count 351
Iterating global reduction 0 with 23 rules applied. Total rules applied 50 place count 211 transition count 351
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 65 place count 211 transition count 336
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 203 transition count 326
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 203 transition count 326
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 203 transition count 322
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 200 transition count 316
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 200 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 200 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 199 transition count 313
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 196 transition count 309
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 196 transition count 309
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 108 place count 196 transition count 302
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 195 transition count 300
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 195 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 112 place count 195 transition count 298
Applied a total of 112 rules in 33 ms. Remains 195 /236 variables (removed 41) and now considering 298/383 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 195/236 places, 298/383 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1149404 steps, run timeout after 3001 ms. (steps per millisecond=383 ) properties seen :{0=1}
Probabilistic random walk after 1149404 steps, saw 903054 distinct states, run finished after 3002 ms. (steps per millisecond=382 ) properties seen :1
FORMULA Vasy2003-PT-none-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-21 12:14:39] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
// Phase 1: matrix 268 rows 195 cols
[2023-03-21 12:14:39] [INFO ] Computed 53 place invariants in 6 ms
[2023-03-21 12:14:39] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 12:14:39] [INFO ] [Nat]Absence check using 45 positive place invariants in 4 ms returned sat
[2023-03-21 12:14:39] [INFO ] [Nat]Absence check using 45 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-21 12:14:39] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 12:14:39] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-21 12:14:39] [INFO ] After 29ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 12:14:39] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-21 12:14:39] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 21 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 298/298 transitions.
Graph (complete) has 663 edges and 195 vertex of which 179 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 179 transition count 286
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 20 place count 168 transition count 274
Ensure Unique test removed 1 places
Iterating global reduction 1 with 12 rules applied. Total rules applied 32 place count 167 transition count 274
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 39 place count 167 transition count 267
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 45 place count 161 transition count 259
Iterating global reduction 2 with 6 rules applied. Total rules applied 51 place count 161 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 5 rules applied. Total rules applied 56 place count 161 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 160 transition count 254
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 59 place count 158 transition count 250
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 158 transition count 250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 63 place count 158 transition count 248
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 5 with 4 rules applied. Total rules applied 67 place count 156 transition count 246
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 68 place count 155 transition count 244
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 155 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 70 place count 155 transition count 243
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 72 place count 155 transition count 241
Applied a total of 72 rules in 36 ms. Remains 155 /195 variables (removed 40) and now considering 241/298 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 155/195 places, 241/298 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1561719 steps, run timeout after 3001 ms. (steps per millisecond=520 ) properties seen :{}
Probabilistic random walk after 1561719 steps, saw 1135357 distinct states, run finished after 3001 ms. (steps per millisecond=520 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 12:14:42] [INFO ] Flow matrix only has 215 transitions (discarded 26 similar events)
// Phase 1: matrix 215 rows 155 cols
[2023-03-21 12:14:42] [INFO ] Computed 44 place invariants in 4 ms
[2023-03-21 12:14:43] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 12:14:43] [INFO ] [Nat]Absence check using 38 positive place invariants in 5 ms returned sat
[2023-03-21 12:14:43] [INFO ] [Nat]Absence check using 38 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-21 12:14:43] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 12:14:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-21 12:14:43] [INFO ] After 22ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 12:14:43] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-21 12:14:43] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 21 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 241/241 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 155/155 places, 241/241 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 241/241 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2023-03-21 12:14:43] [INFO ] Flow matrix only has 215 transitions (discarded 26 similar events)
[2023-03-21 12:14:43] [INFO ] Invariant cache hit.
[2023-03-21 12:14:43] [INFO ] Implicit Places using invariants in 85 ms returned [43, 45, 47, 49, 50, 51, 52, 53, 54, 135, 140]
Discarding 11 places :
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT only with invariants took 88 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 144/155 places, 237/241 transitions.
Graph (trivial) has 15 edges and 144 vertex of which 4 / 144 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 142 transition count 227
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 136 transition count 227
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 13 place count 136 transition count 223
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 21 place count 132 transition count 223
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 130 transition count 221
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 130 transition count 221
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 29 place count 128 transition count 219
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
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 33 place count 126 transition count 222
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 126 transition count 220
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 126 transition count 217
Applied a total of 38 rules in 17 ms. Remains 126 /144 variables (removed 18) and now considering 217/237 (removed 20) transitions.
[2023-03-21 12:14:43] [INFO ] Flow matrix only has 194 transitions (discarded 23 similar events)
// Phase 1: matrix 194 rows 126 cols
[2023-03-21 12:14:43] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-21 12:14:43] [INFO ] Implicit Places using invariants in 85 ms returned [29, 30, 35, 36, 37, 38, 39]
Discarding 7 places :
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Implicit Place search using SMT only with invariants took 86 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 119/155 places, 211/241 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 4 place count 119 transition count 207
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 115 transition count 207
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 115 transition count 202
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 110 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 107 transition count 199
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 107 transition count 199
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 36 place count 101 transition count 193
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 48 place count 101 transition count 181
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 99 transition count 177
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 99 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 56 place count 99 transition count 173
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 63 place count 99 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Remove reverse transitions (loop back) rule discarded transition t764.t51 and 6 places that fell out of Prefix Of Interest.
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 92 transition count 158
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 67 place count 92 transition count 156
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 74 place count 92 transition count 149
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 81 place count 85 transition count 149
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 85 place count 85 transition count 145
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 87 place count 85 transition count 148
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 95 place count 83 transition count 142
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 97 place count 83 transition count 140
Applied a total of 97 rules in 25 ms. Remains 83 /119 variables (removed 36) and now considering 140/211 (removed 71) transitions.
[2023-03-21 12:14:43] [INFO ] Flow matrix only has 124 transitions (discarded 16 similar events)
// Phase 1: matrix 124 rows 83 cols
[2023-03-21 12:14:43] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-21 12:14:43] [INFO ] Implicit Places using invariants in 46 ms returned [5, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 81/155 places, 140/241 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 80 transition count 139
Applied a total of 2 rules in 3 ms. Remains 80 /81 variables (removed 1) and now considering 139/140 (removed 1) transitions.
[2023-03-21 12:14:43] [INFO ] Flow matrix only has 123 transitions (discarded 16 similar events)
// Phase 1: matrix 123 rows 80 cols
[2023-03-21 12:14:43] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-21 12:14:43] [INFO ] Implicit Places using invariants in 40 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 79/155 places, 139/241 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 319 ms. Remains : 79/155 places, 139/241 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2919837 steps, run timeout after 3001 ms. (steps per millisecond=972 ) properties seen :{}
Probabilistic random walk after 2919837 steps, saw 516919 distinct states, run finished after 3001 ms. (steps per millisecond=972 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 12:14:46] [INFO ] Flow matrix only has 123 transitions (discarded 16 similar events)
// Phase 1: matrix 123 rows 79 cols
[2023-03-21 12:14:46] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-21 12:14:46] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 12:14:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-21 12:14:46] [INFO ] [Nat]Absence check using 15 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 12:14:46] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 12:14:46] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-21 12:14:46] [INFO ] After 14ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 12:14:46] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-21 12:14:46] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 21 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 79/79 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 139/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2023-03-21 12:14:46] [INFO ] Flow matrix only has 123 transitions (discarded 16 similar events)
[2023-03-21 12:14:46] [INFO ] Invariant cache hit.
[2023-03-21 12:14:46] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-21 12:14:46] [INFO ] Flow matrix only has 123 transitions (discarded 16 similar events)
[2023-03-21 12:14:46] [INFO ] Invariant cache hit.
[2023-03-21 12:14:46] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-21 12:14:46] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-21 12:14:46] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-21 12:14:46] [INFO ] Flow matrix only has 123 transitions (discarded 16 similar events)
[2023-03-21 12:14:46] [INFO ] Invariant cache hit.
[2023-03-21 12:14:46] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 79/79 places, 139/139 transitions.
Graph (trivial) has 30 edges and 79 vertex of which 8 / 79 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 13 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 204 edges and 75 vertex of which 63 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 63 transition count 104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 63 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 61 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 60 transition count 101
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 60 transition count 96
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 60 transition count 96
Applied a total of 16 rules in 9 ms. Remains 60 /79 variables (removed 19) and now considering 96/139 (removed 43) transitions.
Running SMT prover for 1 properties.
[2023-03-21 12:14:46] [INFO ] Flow matrix only has 85 transitions (discarded 11 similar events)
// Phase 1: matrix 85 rows 60 cols
[2023-03-21 12:14:46] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-21 12:14:46] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 12:14:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-21 12:14:46] [INFO ] [Nat]Absence check using 9 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 12:14:46] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 12:14:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-21 12:14:46] [INFO ] After 9ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 12:14:46] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-21 12:14:46] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 12:14:47] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-21 12:14:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 139 transitions and 511 arcs took 1 ms.
[2023-03-21 12:14:47] [INFO ] Flatten gal took : 33 ms
Total runtime 16847 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Vasy2003_PT_none
(NrP: 79 NrTr: 139 NrArc: 511)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 2.652sec


RS generation: 0m 0.019sec


-> reachability set: #nodes 438 (4.4e+02) #states 1,216,513 (6)



starting MCC model checker
--------------------------

checking: AG [[[[[[[p13<=0 & 0<=p13] & [p45<=1 & 1<=p45]] | [p63<=1 & 1<=p63]] | [p70<=0 & 0<=p70]] | [[p21<=1 & 1<=p21] | [p34<=0 & 0<=p34]]] | [[[[p18<=0 & 0<=p18] & [[p72<=1 & 1<=p72] & [[p28<=0 & 0<=p28] | [p52<=1 & 1<=p52]]]] | [[p31<=0 & 0<=p31] & [p35<=1 & 1<=p35]]] | [[[p51<=0 & 0<=p51] & [p55<=1 & 1<=p55]] | [[[p22<=0 & 0<=p22] & [p54<=1 & 1<=p54]] | [[[p43<=0 & 0<=p43] & [p56<=1 & 1<=p56]] & [[p29<=1 & 1<=p29] & [[p2<=0 & 0<=p2] | [p32<=1 & 1<=p32]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p54<=1 & 1<=p54] & [p22<=0 & 0<=p22]] | [[[p43<=0 & 0<=p43] & [p56<=1 & 1<=p56]] & [[[p32<=1 & 1<=p32] | [p2<=0 & 0<=p2]] & [p29<=1 & 1<=p29]]]] | [[p55<=1 & 1<=p55] & [p51<=0 & 0<=p51]]] | [[[[[p52<=1 & 1<=p52] | [p28<=0 & 0<=p28]] & [p72<=1 & 1<=p72]] & [p18<=0 & 0<=p18]] | [[p35<=1 & 1<=p35] & [p31<=0 & 0<=p31]]]] | [[[p34<=0 & 0<=p34] | [p21<=1 & 1<=p21]] | [[p70<=0 & 0<=p70] | [[p63<=1 & 1<=p63] | [[p45<=1 & 1<=p45] & [p13<=0 & 0<=p13]]]]]]]]]

abstracting: (0<=p13)
states: 1,216,513 (6)
abstracting: (p13<=0)
states: 608,257 (5)
abstracting: (1<=p45)
states: 24,576 (4)
abstracting: (p45<=1)
states: 1,216,513 (6)
abstracting: (1<=p63)
states: 608,256 (5)
abstracting: (p63<=1)
states: 1,216,513 (6)
abstracting: (0<=p70)
states: 1,216,513 (6)
abstracting: (p70<=0)
states: 915,457 (5)
abstracting: (1<=p21)
states: 24,576 (4)
abstracting: (p21<=1)
states: 1,216,513 (6)
abstracting: (0<=p34)
states: 1,216,513 (6)
abstracting: (p34<=0)
states: 1,191,937 (6)
abstracting: (0<=p31)
states: 1,216,513 (6)
abstracting: (p31<=0)
states: 1,191,937 (6)
abstracting: (1<=p35)
states: 24,576 (4)
abstracting: (p35<=1)
states: 1,216,513 (6)
abstracting: (0<=p18)
states: 1,216,513 (6)
abstracting: (p18<=0)
states: 608,257 (5)
abstracting: (1<=p72)
states: 301,056 (5)
abstracting: (p72<=1)
states: 1,216,513 (6)
abstracting: (0<=p28)
states: 1,216,513 (6)
abstracting: (p28<=0)
states: 1,191,937 (6)
abstracting: (1<=p52)
states: 24,576 (4)
abstracting: (p52<=1)
states: 1,216,513 (6)
abstracting: (0<=p51)
states: 1,216,513 (6)
abstracting: (p51<=0)
states: 1,191,937 (6)
abstracting: (1<=p55)
states: 24,576 (4)
abstracting: (p55<=1)
states: 1,216,513 (6)
abstracting: (1<=p29)
states: 24,576 (4)
abstracting: (p29<=1)
states: 1,216,513 (6)
abstracting: (0<=p2)
states: 1,216,513 (6)
abstracting: (p2<=0)
states: 608,257 (5)
abstracting: (1<=p32)
states: 24,576 (4)
abstracting: (p32<=1)
states: 1,216,513 (6)
abstracting: (1<=p56)
states: 24,576 (4)
abstracting: (p56<=1)
states: 1,216,513 (6)
abstracting: (0<=p43)
states: 1,216,513 (6)
abstracting: (p43<=0)
states: 1,191,937 (6)
abstracting: (0<=p22)
states: 1,216,513 (6)
abstracting: (p22<=0)
states: 1,191,937 (6)
abstracting: (1<=p54)
states: 24,576 (4)
abstracting: (p54<=1)
states: 1,216,513 (6)
-> the formula is FALSE

FORMULA Vasy2003-PT-none-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

totally nodes used: 16693 (1.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 51730 250294 302024
used/not used/entry size/cache size: 258018 66850846 16 1024MB
basic ops cache: hits/miss/sum: 6432 14079 20511
used/not used/entry size/cache size: 31048 16746168 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 825 2370 3195
used/not used/entry size/cache size: 2370 8386238 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67092269
1 16497
2 98
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.295sec


BK_STOP 1679400892586

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:3446 (24), effective:159 (1)

initing FirstDep: 0m 0.000sec


iterations count:3665 (26), effective:127 (0)

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="ReachabilityCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is Vasy2003-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 r490-tall-167912709701230"
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 [ "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 ;