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.r464-smll-171620118400359.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 Anderson-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400359
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 927K May 18 16:42 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 Anderson-PT-09-ReachabilityFireability-2024-00
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-01
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-02
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-03
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-04
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-05
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-06
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-07
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-08
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-09
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-10
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-11
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-12
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-13
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-14
FORMULA_NAME Anderson-PT-09-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717258691488

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:18:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:18:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:18:14] [INFO ] Load time of PNML (sax parser for PT used): 430 ms
[2024-06-01 16:18:14] [INFO ] Transformed 505 places.
[2024-06-01 16:18:14] [INFO ] Transformed 1845 transitions.
[2024-06-01 16:18:14] [INFO ] Found NUPN structural information;
[2024-06-01 16:18:14] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 700 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 4309 ms. (9 steps per ms) remains 9/16 properties
FORMULA Anderson-PT-09-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 8/9 properties
FORMULA Anderson-PT-09-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 436 ms. (91 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 287 ms. (138 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 5/8 properties
FORMULA Anderson-PT-09-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 5/5 properties
// Phase 1: matrix 1845 rows 505 cols
[2024-06-01 16:18:16] [INFO ] Computed 21 invariants in 104 ms
[2024-06-01 16:18:16] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 444/501 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 444/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 5/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 4/505 variables, 6/522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 4/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1845/2350 variables, 505/1031 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2350 variables, 72/1103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2350 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2350 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2350/2350 variables, and 1103 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2341 ms.
Refiners :[Domain max(s): 505/505 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 505/505 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 444/501 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 444/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 5/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem Anderson-PT-09-ReachabilityFireability-2024-01 is UNSAT
FORMULA Anderson-PT-09-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 4/505 variables, 6/522 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 4/526 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 16:18:21] [INFO ] Deduced a trap composed of 109 places in 888 ms of which 60 ms to minimize.
[2024-06-01 16:18:22] [INFO ] Deduced a trap composed of 150 places in 751 ms of which 10 ms to minimize.
[2024-06-01 16:18:23] [INFO ] Deduced a trap composed of 140 places in 808 ms of which 16 ms to minimize.
[2024-06-01 16:18:23] [INFO ] Deduced a trap composed of 71 places in 696 ms of which 5 ms to minimize.
[2024-06-01 16:18:24] [INFO ] Deduced a trap composed of 157 places in 763 ms of which 5 ms to minimize.
SMT process timed out in 8016ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 68 Pre rules applied. Total rules applied 0 place count 505 transition count 1777
Deduced a syphon composed of 68 places in 5 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 0 with 136 rules applied. Total rules applied 136 place count 437 transition count 1777
Discarding 121 places :
Symmetric choice reduction at 0 with 121 rule applications. Total rules 257 place count 316 transition count 824
Iterating global reduction 0 with 121 rules applied. Total rules applied 378 place count 316 transition count 824
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 384 place count 313 transition count 821
Applied a total of 384 rules in 305 ms. Remains 313 /505 variables (removed 192) and now considering 821/1845 (removed 1024) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 313/505 places, 821/1845 transitions.
RANDOM walk for 40000 steps (8 resets) in 683 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 338 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 223 ms. (178 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 223837 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 4
Probabilistic random walk after 223837 steps, saw 152515 distinct states, run finished after 3006 ms. (steps per millisecond=74 ) properties seen :0
// Phase 1: matrix 821 rows 313 cols
[2024-06-01 16:18:28] [INFO ] Computed 21 invariants in 13 ms
[2024-06-01 16:18:28] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 266/305 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/313 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 821/1134 variables, 313/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 72/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1134 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1134 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1134/1134 variables, and 406 constraints, problems are : Problem set: 0 solved, 4 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 313/313 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 266/305 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/313 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:18:30] [INFO ] Deduced a trap composed of 121 places in 411 ms of which 4 ms to minimize.
[2024-06-01 16:18:30] [INFO ] Deduced a trap composed of 92 places in 389 ms of which 4 ms to minimize.
[2024-06-01 16:18:30] [INFO ] Deduced a trap composed of 103 places in 276 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:18:31] [INFO ] Deduced a trap composed of 106 places in 290 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:18:31] [INFO ] Deduced a trap composed of 154 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:18:32] [INFO ] Deduced a trap composed of 165 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:18:32] [INFO ] Deduced a trap composed of 76 places in 310 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 821/1134 variables, 313/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1134 variables, 72/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1134 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1134 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1134 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1134/1134 variables, and 417 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7933 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 313/313 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 8757ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 6100 ms.
Support contains 39 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 821/821 transitions.
Applied a total of 0 rules in 30 ms. Remains 313 /313 variables (removed 0) and now considering 821/821 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 313/313 places, 821/821 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 821/821 transitions.
Applied a total of 0 rules in 25 ms. Remains 313 /313 variables (removed 0) and now considering 821/821 (removed 0) transitions.
[2024-06-01 16:18:43] [INFO ] Invariant cache hit.
[2024-06-01 16:18:44] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-06-01 16:18:44] [INFO ] Invariant cache hit.
[2024-06-01 16:18:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:18:46] [INFO ] Implicit Places using invariants and state equation in 2273 ms returned []
Implicit Place search using SMT with State Equation took 2715 ms to find 0 implicit places.
[2024-06-01 16:18:46] [INFO ] Redundant transitions in 67 ms returned []
Running 812 sub problems to find dead transitions.
[2024-06-01 16:18:46] [INFO ] Invariant cache hit.
[2024-06-01 16:18:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 812 unsolved
[2024-06-01 16:18:58] [INFO ] Deduced a trap composed of 57 places in 420 ms of which 5 ms to minimize.
[2024-06-01 16:18:59] [INFO ] Deduced a trap composed of 100 places in 467 ms of which 6 ms to minimize.
[2024-06-01 16:18:59] [INFO ] Deduced a trap composed of 141 places in 437 ms of which 6 ms to minimize.
[2024-06-01 16:19:00] [INFO ] Deduced a trap composed of 85 places in 363 ms of which 4 ms to minimize.
[2024-06-01 16:19:00] [INFO ] Deduced a trap composed of 150 places in 443 ms of which 6 ms to minimize.
[2024-06-01 16:19:01] [INFO ] Deduced a trap composed of 93 places in 440 ms of which 5 ms to minimize.
[2024-06-01 16:19:01] [INFO ] Deduced a trap composed of 167 places in 370 ms of which 5 ms to minimize.
[2024-06-01 16:19:02] [INFO ] Deduced a trap composed of 138 places in 319 ms of which 4 ms to minimize.
[2024-06-01 16:19:02] [INFO ] Deduced a trap composed of 141 places in 423 ms of which 5 ms to minimize.
[2024-06-01 16:19:02] [INFO ] Deduced a trap composed of 143 places in 419 ms of which 6 ms to minimize.
[2024-06-01 16:19:03] [INFO ] Deduced a trap composed of 112 places in 412 ms of which 5 ms to minimize.
[2024-06-01 16:19:03] [INFO ] Deduced a trap composed of 154 places in 460 ms of which 6 ms to minimize.
[2024-06-01 16:19:04] [INFO ] Deduced a trap composed of 152 places in 467 ms of which 5 ms to minimize.
[2024-06-01 16:19:04] [INFO ] Deduced a trap composed of 132 places in 427 ms of which 5 ms to minimize.
[2024-06-01 16:19:05] [INFO ] Deduced a trap composed of 153 places in 449 ms of which 5 ms to minimize.
[2024-06-01 16:19:05] [INFO ] Deduced a trap composed of 141 places in 449 ms of which 5 ms to minimize.
[2024-06-01 16:19:06] [INFO ] Deduced a trap composed of 137 places in 492 ms of which 7 ms to minimize.
[2024-06-01 16:19:06] [INFO ] Deduced a trap composed of 118 places in 406 ms of which 5 ms to minimize.
[2024-06-01 16:19:07] [INFO ] Deduced a trap composed of 145 places in 460 ms of which 5 ms to minimize.
[2024-06-01 16:19:07] [INFO ] Deduced a trap composed of 111 places in 459 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 812 unsolved
[2024-06-01 16:19:09] [INFO ] Deduced a trap composed of 135 places in 425 ms of which 6 ms to minimize.
[2024-06-01 16:19:10] [INFO ] Deduced a trap composed of 91 places in 456 ms of which 6 ms to minimize.
[2024-06-01 16:19:10] [INFO ] Deduced a trap composed of 144 places in 440 ms of which 5 ms to minimize.
[2024-06-01 16:19:11] [INFO ] Deduced a trap composed of 141 places in 378 ms of which 5 ms to minimize.
[2024-06-01 16:19:11] [INFO ] Deduced a trap composed of 139 places in 482 ms of which 5 ms to minimize.
[2024-06-01 16:19:12] [INFO ] Deduced a trap composed of 140 places in 457 ms of which 6 ms to minimize.
[2024-06-01 16:19:12] [INFO ] Deduced a trap composed of 155 places in 470 ms of which 5 ms to minimize.
[2024-06-01 16:19:13] [INFO ] Deduced a trap composed of 95 places in 495 ms of which 6 ms to minimize.
[2024-06-01 16:19:13] [INFO ] Deduced a trap composed of 72 places in 470 ms of which 5 ms to minimize.
[2024-06-01 16:19:14] [INFO ] Deduced a trap composed of 141 places in 479 ms of which 5 ms to minimize.
[2024-06-01 16:19:14] [INFO ] Deduced a trap composed of 92 places in 466 ms of which 5 ms to minimize.
[2024-06-01 16:19:15] [INFO ] Deduced a trap composed of 109 places in 458 ms of which 5 ms to minimize.
[2024-06-01 16:19:15] [INFO ] Deduced a trap composed of 172 places in 463 ms of which 5 ms to minimize.
[2024-06-01 16:19:16] [INFO ] Deduced a trap composed of 170 places in 448 ms of which 5 ms to minimize.
[2024-06-01 16:19:16] [INFO ] Deduced a trap composed of 132 places in 443 ms of which 5 ms to minimize.
[2024-06-01 16:19:17] [INFO ] Deduced a trap composed of 151 places in 472 ms of which 5 ms to minimize.
[2024-06-01 16:19:17] [INFO ] Deduced a trap composed of 91 places in 447 ms of which 5 ms to minimize.
[2024-06-01 16:19:18] [INFO ] Deduced a trap composed of 171 places in 439 ms of which 5 ms to minimize.
[2024-06-01 16:19:18] [INFO ] Deduced a trap composed of 110 places in 409 ms of which 5 ms to minimize.
SMT process timed out in 32139ms, After SMT, problems are : Problem set: 0 solved, 812 unsolved
Search for dead transitions found 0 dead transitions in 32161ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34990 ms. Remains : 313/313 places, 821/821 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 80 Pre rules applied. Total rules applied 0 place count 313 transition count 741
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 0 with 160 rules applied. Total rules applied 160 place count 233 transition count 741
Applied a total of 160 rules in 46 ms. Remains 233 /313 variables (removed 80) and now considering 741/821 (removed 80) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 741 rows 233 cols
[2024-06-01 16:19:18] [INFO ] Computed 21 invariants in 10 ms
[2024-06-01 16:19:18] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 16:19:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-06-01 16:19:18] [INFO ] [Nat]Absence check using 10 positive and 11 generalized place invariants in 23 ms returned sat
[2024-06-01 16:19:19] [INFO ] After 960ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 16:19:20] [INFO ] After 1787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 16:19:21] [INFO ] After 2644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 2899 ms.
[2024-06-01 16:19:21] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2024-06-01 16:19:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 821 transitions and 3276 arcs took 17 ms.
[2024-06-01 16:19:22] [INFO ] Flatten gal took : 232 ms
Total runtime 68333 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 : Anderson-PT-09-ReachabilityFireability-2024-03
Could not compute solution for formula : Anderson-PT-09-ReachabilityFireability-2024-04
Could not compute solution for formula : Anderson-PT-09-ReachabilityFireability-2024-09
Could not compute solution for formula : Anderson-PT-09-ReachabilityFireability-2024-12

BK_STOP 1717258762680

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name Anderson-PT-09-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/698/inv_0_
rfs formula name Anderson-PT-09-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/698/inv_1_
rfs formula name Anderson-PT-09-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/698/inv_2_
rfs formula name Anderson-PT-09-ReachabilityFireability-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_3_
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="Anderson-PT-09"
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 Anderson-PT-09, 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 r464-smll-171620118400359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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