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.r399-tall-171690531300894.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 greatspnxred
Input is Szymanski-PT-b10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531300894
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 11 15:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 11 15:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b10-ReachabilityCardinality-2024-00
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-01
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-02
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-03
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-04
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-05
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-06
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-07
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-08
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-09
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-10
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-11
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-12
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-13
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-14
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717107352077

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 22:15:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 22:15:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 22:15:53] [INFO ] Load time of PNML (sax parser for PT used): 336 ms
[2024-05-30 22:15:53] [INFO ] Transformed 568 places.
[2024-05-30 22:15:53] [INFO ] Transformed 8320 transitions.
[2024-05-30 22:15:53] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 475 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40012 steps (13 resets) in 1409 ms. (28 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (11 resets) in 372 ms. (107 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (11 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 194 ms. (205 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (15 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 280 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (10 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (10 resets) in 254 ms. (156 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (11 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (11 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 723 ms. (55 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 101134 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 12
Probabilistic random walk after 101134 steps, saw 79407 distinct states, run finished after 3006 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-30 22:15:58] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-05-30 22:15:58] [INFO ] Computed 3 invariants in 54 ms
[2024-05-30 22:15:58] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem Szymanski-PT-b10-ReachabilityCardinality-2024-01 is UNSAT
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b10-ReachabilityCardinality-2024-03 is UNSAT
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b10-ReachabilityCardinality-2024-04 is UNSAT
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b10-ReachabilityCardinality-2024-05 is UNSAT
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b10-ReachabilityCardinality-2024-06 is UNSAT
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b10-ReachabilityCardinality-2024-07 is UNSAT
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b10-ReachabilityCardinality-2024-10 is UNSAT
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b10-ReachabilityCardinality-2024-11 is UNSAT
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b10-ReachabilityCardinality-2024-13 is UNSAT
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b10-ReachabilityCardinality-2024-14 is UNSAT
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b10-ReachabilityCardinality-2024-15 is UNSAT
FORMULA Szymanski-PT-b10-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 253/308 variables, 2/3 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2733/3041 variables, 308/311 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3041 variables, 147/458 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3041/3041 variables, and 458 constraints, problems are : Problem set: 11 solved, 1 unsolved in 1176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 308/308 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 255/257 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/1 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/307 variables, 1/2 constraints. Problems are: Problem set: 11 solved, 1 unsolved
[2024-05-30 22:16:00] [INFO ] Deduced a trap composed of 32 places in 656 ms of which 31 ms to minimize.
[2024-05-30 22:16:01] [INFO ] Deduced a trap composed of 65 places in 668 ms of which 4 ms to minimize.
[2024-05-30 22:16:01] [INFO ] Deduced a trap composed of 139 places in 616 ms of which 2 ms to minimize.
[2024-05-30 22:16:02] [INFO ] Deduced a trap composed of 132 places in 599 ms of which 4 ms to minimize.
[2024-05-30 22:16:02] [INFO ] Deduced a trap composed of 131 places in 599 ms of which 2 ms to minimize.
[2024-05-30 22:16:03] [INFO ] Deduced a trap composed of 131 places in 595 ms of which 3 ms to minimize.
[2024-05-30 22:16:04] [INFO ] Deduced a trap composed of 130 places in 538 ms of which 3 ms to minimize.
[2024-05-30 22:16:04] [INFO ] Deduced a trap composed of 60 places in 528 ms of which 2 ms to minimize.
SMT process timed out in 6456ms, After SMT, problems are : Problem set: 11 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 487 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 305/308 places, 7808/8064 transitions.
RANDOM walk for 40014 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 241957 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 1
Probabilistic random walk after 241957 steps, saw 187003 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-30 22:16:08] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-30 22:16:08] [INFO ] Computed 3 invariants in 29 ms
[2024-05-30 22:16:08] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 22:16:09] [INFO ] Deduced a trap composed of 48 places in 462 ms of which 3 ms to minimize.
[2024-05-30 22:16:09] [INFO ] Deduced a trap composed of 72 places in 471 ms of which 3 ms to minimize.
[2024-05-30 22:16:10] [INFO ] Deduced a trap composed of 75 places in 421 ms of which 5 ms to minimize.
[2024-05-30 22:16:10] [INFO ] Deduced a trap composed of 129 places in 419 ms of which 2 ms to minimize.
[2024-05-30 22:16:11] [INFO ] Deduced a trap composed of 129 places in 447 ms of which 2 ms to minimize.
[2024-05-30 22:16:11] [INFO ] Deduced a trap composed of 138 places in 428 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 22:16:13] [INFO ] Deduced a trap composed of 37 places in 545 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 463 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5143 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 5807ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 238 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 217 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 321 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-30 22:16:14] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 22:16:14] [INFO ] Invariant cache hit.
[2024-05-30 22:16:15] [INFO ] Implicit Places using invariants in 647 ms returned []
[2024-05-30 22:16:15] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 22:16:15] [INFO ] Invariant cache hit.
[2024-05-30 22:16:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 22:16:35] [INFO ] Implicit Places using invariants and state equation in 19732 ms returned []
Implicit Place search using SMT with State Equation took 20390 ms to find 0 implicit places.
[2024-05-30 22:16:36] [INFO ] Redundant transitions in 867 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-05-30 22:16:36] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 22:16:36] [INFO ] Invariant cache hit.
[2024-05-30 22:16:36] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30142 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 22:17:39] [INFO ] Deduced a trap composed of 138 places in 442 ms of which 2 ms to minimize.
[2024-05-30 22:17:40] [INFO ] Deduced a trap composed of 48 places in 318 ms of which 2 ms to minimize.
[2024-05-30 22:17:40] [INFO ] Deduced a trap composed of 118 places in 311 ms of which 2 ms to minimize.
[2024-05-30 22:17:41] [INFO ] Deduced a trap composed of 157 places in 285 ms of which 2 ms to minimize.
[2024-05-30 22:17:41] [INFO ] Deduced a trap composed of 101 places in 217 ms of which 1 ms to minimize.
[2024-05-30 22:17:41] [INFO ] Deduced a trap composed of 72 places in 308 ms of which 2 ms to minimize.
[2024-05-30 22:17:42] [INFO ] Deduced a trap composed of 85 places in 263 ms of which 2 ms to minimize.
[2024-05-30 22:17:42] [INFO ] Deduced a trap composed of 74 places in 330 ms of which 3 ms to minimize.
[2024-05-30 22:17:42] [INFO ] Deduced a trap composed of 111 places in 348 ms of which 2 ms to minimize.
[2024-05-30 22:17:43] [INFO ] Deduced a trap composed of 103 places in 233 ms of which 2 ms to minimize.
[2024-05-30 22:17:43] [INFO ] Deduced a trap composed of 107 places in 347 ms of which 2 ms to minimize.
[2024-05-30 22:17:43] [INFO ] Deduced a trap composed of 112 places in 298 ms of which 2 ms to minimize.
[2024-05-30 22:17:44] [INFO ] Deduced a trap composed of 103 places in 236 ms of which 2 ms to minimize.
[2024-05-30 22:17:44] [INFO ] Deduced a trap composed of 132 places in 212 ms of which 1 ms to minimize.
[2024-05-30 22:17:44] [INFO ] Deduced a trap composed of 134 places in 324 ms of which 2 ms to minimize.
[2024-05-30 22:17:44] [INFO ] Deduced a trap composed of 134 places in 308 ms of which 2 ms to minimize.
[2024-05-30 22:17:45] [INFO ] Deduced a trap composed of 125 places in 294 ms of which 2 ms to minimize.
[2024-05-30 22:17:45] [INFO ] Deduced a trap composed of 195 places in 195 ms of which 1 ms to minimize.
[2024-05-30 22:18:01] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 2 ms to minimize.
(s202 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 22 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 19/19 constraints]
After SMT, in 89104ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 89188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110812 ms. Remains : 305/305 places, 7808/7808 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 5 ms
Free SCC test removed 36 places
Drop transitions (Empty/Sink Transition effects.) removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1946
Applied a total of 417 rules in 309 ms. Remains 269 /305 variables (removed 36) and now considering 1946/7808 (removed 5862) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1946 rows 269 cols
[2024-05-30 22:18:05] [INFO ] Computed 3 invariants in 11 ms
[2024-05-30 22:18:05] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 22:18:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-05-30 22:18:06] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 22:18:06] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-30 22:18:06] [INFO ] After 178ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 22:18:06] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 22:18:06] [INFO ] After 717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1163 ms.
[2024-05-30 22:18:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-30 22:18:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7808 transitions and 31360 arcs took 38 ms.
[2024-05-30 22:18:07] [INFO ] Flatten gal took : 478 ms
Total runtime 134065 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Szymanski-PT-b10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 305
TRANSITIONS: 7808
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.149s, Sys 0.011s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.023s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 687
MODEL NAME: /home/mcc/execution/411/model
305 places, 7808 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1717108052903

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="Szymanski-PT-b10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Szymanski-PT-b10, 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 r399-tall-171690531300894"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b10.tgz
mv Szymanski-PT-b10 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 ;