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.r536-tall-171690533300871.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 ltsminxred
Input is Szymanski-PT-b04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533300871
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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-b04-ReachabilityFireability-2024-00
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-01
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-02
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-03
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-04
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2023-05
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-06
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-07
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-08
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2023-09
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-10
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-11
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-12
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2023-13
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-14
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717282980227

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:03:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 23:03:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:03:01] [INFO ] Load time of PNML (sax parser for PT used): 315 ms
[2024-06-01 23:03:01] [INFO ] Transformed 568 places.
[2024-06-01 23:03:01] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:03:01] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 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-b04-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40003 steps (9 resets) in 2455 ms. (16 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 184 ms. (21 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 179 ms. (22 steps per ms) remains 14/15 properties
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4002 steps (8 resets) in 169 ms. (23 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 115 ms. (34 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 13/14 properties
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
[2024-06-01 23:03:03] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-06-01 23:03:03] [INFO ] Computed 3 invariants in 47 ms
[2024-06-01 23:03:03] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem Szymanski-PT-b04-ReachabilityFireability-2024-00 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2024-01 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2024-04 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2023-05 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2023-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2024-07 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2024-08 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2023-09 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2023-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2024-11 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2023-13 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2023-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2024-15 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 149/307 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 3 unsolved
[2024-06-01 23:03:05] [INFO ] Deduced a trap composed of 60 places in 576 ms of which 25 ms to minimize.
[2024-06-01 23:03:05] [INFO ] Deduced a trap composed of 62 places in 496 ms of which 2 ms to minimize.
[2024-06-01 23:03:06] [INFO ] Deduced a trap composed of 74 places in 530 ms of which 2 ms to minimize.
[2024-06-01 23:03:06] [INFO ] Deduced a trap composed of 47 places in 535 ms of which 3 ms to minimize.
[2024-06-01 23:03:07] [INFO ] Deduced a trap composed of 50 places in 487 ms of which 3 ms to minimize.
[2024-06-01 23:03:07] [INFO ] Deduced a trap composed of 58 places in 483 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 6/8 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/8 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/308 variables, 1/9 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/9 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2733/3041 variables, 308/317 constraints. Problems are: Problem set: 10 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3041/3041 variables, and 464 constraints, problems are : Problem set: 10 solved, 3 unsolved in 5080 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: 13/6 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 10 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 302/307 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 6/8 constraints. Problems are: Problem set: 10 solved, 3 unsolved
[2024-06-01 23:03:09] [INFO ] Deduced a trap composed of 102 places in 438 ms of which 2 ms to minimize.
[2024-06-01 23:03:09] [INFO ] Deduced a trap composed of 146 places in 290 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 2/10 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/308 variables, 1/11 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/11 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2733/3041 variables, 308/319 constraints. Problems are: Problem set: 10 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3041/3041 variables, and 466 constraints, problems are : Problem set: 10 solved, 3 unsolved in 4777 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: 0/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 10621ms problems are : Problem set: 10 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 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.15 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 457 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 472 ms. Remains : 305/308 places, 7808/8064 transitions.
RANDOM walk for 40003 steps (8 resets) in 245 ms. (162 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/3 properties
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-01 23:03:14] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 23:03:14] [INFO ] Computed 3 invariants in 26 ms
[2024-06-01 23:03:14] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 301/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:03:15] [INFO ] Deduced a trap composed of 36 places in 460 ms of which 2 ms to minimize.
[2024-06-01 23:03:15] [INFO ] Deduced a trap composed of 70 places in 431 ms of which 2 ms to minimize.
[2024-06-01 23:03:16] [INFO ] Deduced a trap composed of 134 places in 492 ms of which 2 ms to minimize.
[2024-06-01 23:03:16] [INFO ] Deduced a trap composed of 138 places in 490 ms of which 3 ms to minimize.
[2024-06-01 23:03:17] [INFO ] Deduced a trap composed of 144 places in 486 ms of which 2 ms to minimize.
[2024-06-01 23:03:17] [INFO ] Deduced a trap composed of 47 places in 462 ms of which 2 ms to minimize.
[2024-06-01 23:03:18] [INFO ] Deduced a trap composed of 45 places in 501 ms of which 2 ms to minimize.
[2024-06-01 23:03:18] [INFO ] Deduced a trap composed of 157 places in 477 ms of which 2 ms to minimize.
[2024-06-01 23:03:19] [INFO ] Deduced a trap composed of 73 places in 469 ms of which 3 ms to minimize.
[2024-06-01 23:03:19] [INFO ] Deduced a trap composed of 78 places in 408 ms of which 2 ms to minimize.
[2024-06-01 23:03:19] [INFO ] Deduced a trap composed of 74 places in 374 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2604/2909 variables, 305/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2909 variables, 147/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2909 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 466 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7334 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 301/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2604/2909 variables, 305/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2909 variables, 147/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:03:28] [INFO ] Deduced a trap composed of 114 places in 380 ms of which 2 ms to minimize.
[2024-06-01 23:03:28] [INFO ] Deduced a trap composed of 101 places in 260 ms of which 2 ms to minimize.
[2024-06-01 23:03:29] [INFO ] Deduced a trap composed of 124 places in 373 ms of which 2 ms to minimize.
[2024-06-01 23:03:29] [INFO ] Deduced a trap composed of 195 places in 235 ms of which 1 ms to minimize.
[2024-06-01 23:03:30] [INFO ] Deduced a trap composed of 123 places in 415 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 5/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2909 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 473 constraints, problems are : Problem set: 0 solved, 2 unsolved in 16963 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints]
After SMT, in 24379ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 405 ms.
Support contains 4 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 235 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 236 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40002 steps (8 resets) in 247 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 161979 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 161979 steps, saw 58034 distinct states, run finished after 3006 ms. (steps per millisecond=53 ) properties seen :0
[2024-06-01 23:03:42] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:03:42] [INFO ] Invariant cache hit.
[2024-06-01 23:03:42] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 301/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:03:43] [INFO ] Deduced a trap composed of 167 places in 493 ms of which 3 ms to minimize.
[2024-06-01 23:03:43] [INFO ] Deduced a trap composed of 75 places in 507 ms of which 2 ms to minimize.
[2024-06-01 23:03:44] [INFO ] Deduced a trap composed of 138 places in 506 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2604/2909 variables, 305/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2909 variables, 147/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2909 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4755 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 301/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2604/2909 variables, 305/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2909 variables, 147/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 41018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 45804ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 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 298 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 299 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 198 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:04:29] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:04:29] [INFO ] Invariant cache hit.
[2024-06-01 23:04:29] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-06-01 23:04:29] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:04:29] [INFO ] Invariant cache hit.
[2024-06-01 23:04:30] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:04:56] [INFO ] Implicit Places using invariants and state equation in 27275 ms returned []
Implicit Place search using SMT with State Equation took 27882 ms to find 0 implicit places.
[2024-06-01 23:04:57] [INFO ] Redundant transitions in 876 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:04:57] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:04:57] [INFO ] Invariant cache hit.
[2024-06-01 23:04:58] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30123 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-06-01 23:05:59] [INFO ] Deduced a trap composed of 138 places in 444 ms of which 2 ms to minimize.
[2024-06-01 23:06:01] [INFO ] Deduced a trap composed of 31 places in 455 ms of which 2 ms to minimize.
[2024-06-01 23:06:02] [INFO ] Deduced a trap composed of 106 places in 463 ms of which 2 ms to minimize.
[2024-06-01 23:06:02] [INFO ] Deduced a trap composed of 104 places in 467 ms of which 2 ms to minimize.
[2024-06-01 23:06:02] [INFO ] Deduced a trap composed of 37 places in 367 ms of which 2 ms to minimize.
[2024-06-01 23:06:03] [INFO ] Deduced a trap composed of 59 places in 381 ms of which 2 ms to minimize.
[2024-06-01 23:06:03] [INFO ] Deduced a trap composed of 42 places in 343 ms of which 2 ms to minimize.
[2024-06-01 23:06:04] [INFO ] Deduced a trap composed of 50 places in 323 ms of which 1 ms to minimize.
[2024-06-01 23:06:04] [INFO ] Deduced a trap composed of 42 places in 331 ms of which 2 ms to minimize.
[2024-06-01 23:06:04] [INFO ] Deduced a trap composed of 47 places in 309 ms of which 2 ms to minimize.
[2024-06-01 23:06:05] [INFO ] Deduced a trap composed of 62 places in 439 ms of which 2 ms to minimize.
[2024-06-01 23:06:05] [INFO ] Deduced a trap composed of 78 places in 424 ms of which 2 ms to minimize.
[2024-06-01 23:06:06] [INFO ] Deduced a trap composed of 48 places in 405 ms of which 3 ms to minimize.
[2024-06-01 23:06:06] [INFO ] Deduced a trap composed of 75 places in 396 ms of which 2 ms to minimize.
[2024-06-01 23:06:06] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 2 ms to minimize.
[2024-06-01 23:06:07] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 2 ms to minimize.
[2024-06-01 23:06:07] [INFO ] Deduced a trap composed of 50 places in 401 ms of which 2 ms to minimize.
[2024-06-01 23:06:07] [INFO ] Deduced a trap composed of 97 places in 409 ms of which 2 ms to minimize.
[2024-06-01 23:06:08] [INFO ] Deduced a trap composed of 64 places in 327 ms of which 2 ms to minimize.
[2024-06-01 23:06:08] [INFO ] Deduced a trap composed of 72 places in 378 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:06:13] [INFO ] Deduced a trap composed of 44 places in 421 ms of which 2 ms to minimize.
[2024-06-01 23:06:13] [INFO ] Deduced a trap composed of 57 places in 395 ms of which 2 ms to minimize.
[2024-06-01 23:06:14] [INFO ] Deduced a trap composed of 57 places in 391 ms of which 2 ms to minimize.
[2024-06-01 23:06:14] [INFO ] Deduced a trap composed of 72 places in 364 ms of which 2 ms to minimize.
[2024-06-01 23:06:14] [INFO ] Deduced a trap composed of 115 places in 397 ms of which 2 ms to minimize.
[2024-06-01 23:06:15] [INFO ] Deduced a trap composed of 114 places in 410 ms of which 2 ms to minimize.
[2024-06-01 23:06:15] [INFO ] Deduced a trap composed of 101 places in 352 ms of which 2 ms to minimize.
[2024-06-01 23:06:16] [INFO ] Deduced a trap composed of 114 places in 377 ms of which 2 ms to minimize.
[2024-06-01 23:06:16] [INFO ] Deduced a trap composed of 113 places in 385 ms of which 2 ms to minimize.
[2024-06-01 23:06:17] [INFO ] Deduced a trap composed of 125 places in 455 ms of which 3 ms to minimize.
[2024-06-01 23:06:18] [INFO ] Deduced a trap composed of 58 places in 381 ms of which 2 ms to minimize.
[2024-06-01 23:06:24] [INFO ] Deduced a trap composed of 86 places in 384 ms of which 1 ms to minimize.
[2024-06-01 23:06:24] [INFO ] Deduced a trap composed of 78 places in 305 ms of which 1 ms to minimize.
[2024-06-01 23:06:24] [INFO ] Deduced a trap composed of 120 places in 401 ms of which 2 ms to minimize.
[2024-06-01 23:06:25] [INFO ] Deduced a trap composed of 134 places in 266 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 38 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30099 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: 35/35 constraints]
After SMT, in 88213ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 88282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117288 ms. Remains : 305/305 places, 7808/7808 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 5040 edges and 305 vertex of which 37 / 305 are part of one of the 2 SCC in 4 ms
Free SCC test removed 35 places
Drop transitions (Empty/Sink Transition effects.) removed 4072 transitions
Ensure Unique test removed 1372 transitions
Reduce isomorphic transitions removed 5444 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 270 transition count 1948
Applied a total of 417 rules in 322 ms. Remains 270 /305 variables (removed 35) and now considering 1948/7808 (removed 5860) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1948 rows 270 cols
[2024-06-01 23:06:26] [INFO ] Computed 3 invariants in 10 ms
[2024-06-01 23:06:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 23:06:27] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 23:06:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:06:27] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 23:06:27] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-06-01 23:06:28] [INFO ] After 782ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 23:06:29] [INFO ] After 1432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 23:06:29] [INFO ] After 2319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 3263 ms.
[2024-06-01 23:06:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2024-06-01 23:06:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7808 transitions and 31360 arcs took 31 ms.
[2024-06-01 23:06:30] [INFO ] Flatten gal took : 460 ms
Total runtime 208937 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Szymanski-PT-b04-ReachabilityFireability-2024-02
Could not compute solution for formula : Szymanski-PT-b04-ReachabilityFireability-2024-03

BK_STOP 1717283190559

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name Szymanski-PT-b04-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/745/inv_0_
rfs formula name Szymanski-PT-b04-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/745/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-b04"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Szymanski-PT-b04, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690533300871"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b04.tgz
mv Szymanski-PT-b04 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;