Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447200478.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-PT-S05J80, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 38K Apr 12 09:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 12 09:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 74K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 357K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 156K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 79K Apr 12 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 324K Apr 12 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 131K Apr 12 10:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 566K Apr 12 10:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717260796674

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J80
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:53:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:53:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:53:18] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-06-01 16:53:18] [INFO ] Transformed 1189 places.
[2024-06-01 16:53:18] [INFO ] Transformed 2350 transitions.
[2024-06-01 16:53:18] [INFO ] Parsed PT model containing 1189 places and 2350 transitions and 14464 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2759 resets) in 2611 ms. (15 steps per ms) remains 11/16 properties
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (381 resets) in 420 ms. (95 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (326 resets) in 336 ms. (118 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1024 resets) in 2279 ms. (17 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (997 resets) in 554 ms. (72 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1212 resets) in 646 ms. (61 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (423 resets) in 253 ms. (157 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (306 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (457 resets) in 183 ms. (217 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (500 resets) in 240 ms. (165 steps per ms) remains 10/11 properties
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (444 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (464 resets) in 172 ms. (231 steps per ms) remains 10/10 properties
[2024-06-01 16:53:21] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2024-06-01 16:53:21] [INFO ] Computed 182 invariants in 213 ms
[2024-06-01 16:53:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-02 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-07 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1019 variables, 83/83 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1019 variables, 4/87 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/87 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-10 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-13 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 144/1163 variables, 74/161 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1163 variables, 0/161 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-03 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-06 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 26/1189 variables, 21/182 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1189 variables, 0/182 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1691/2880 variables, 1189/1371 constraints. Problems are: Problem set: 9 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2880/2880 variables, and 1372 constraints, problems are : Problem set: 9 solved, 1 unsolved in 3223 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 1189/1189 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 246/248 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 432/680 variables, 72/75 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 0/75 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 360/1040 variables, 72/147 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1040 variables, 0/147 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 138/1178 variables, 25/172 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1178 variables, 0/172 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/1188 variables, 10/182 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1188 variables, 0/182 constraints. Problems are: Problem set: 9 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2879/2880 variables, and 1370 constraints, problems are : Problem set: 9 solved, 1 unsolved in 1891 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 1188/1189 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 6340ms problems are : Problem set: 9 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 177 place count 1098 transition count 1524
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 347 place count 1013 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 348 place count 1012 transition count 1523
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 1012 transition count 1523
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 353 place count 1010 transition count 1521
Applied a total of 353 rules in 548 ms. Remains 1010 /1189 variables (removed 179) and now considering 1521/1695 (removed 174) transitions.
Running 1515 sub problems to find dead transitions.
[2024-06-01 16:53:28] [INFO ] Flow matrix only has 1517 transitions (discarded 4 similar events)
// Phase 1: matrix 1517 rows 1010 cols
[2024-06-01 16:53:28] [INFO ] Computed 177 invariants in 99 ms
[2024-06-01 16:53:28] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1005 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 1515 unsolved
SMT process timed out in 25258ms, After SMT, problems are : Problem set: 0 solved, 1515 unsolved
Search for dead transitions found 0 dead transitions in 25305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25888 ms. Remains : 1010/1189 places, 1521/1695 transitions.
RANDOM walk for 40000 steps (2105 resets) in 948 ms. (42 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (114 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 123046 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 1
Probabilistic random walk after 123046 steps, saw 36827 distinct states, run finished after 3006 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 16:53:56] [INFO ] Flow matrix only has 1517 transitions (discarded 4 similar events)
[2024-06-01 16:53:56] [INFO ] Invariant cache hit.
[2024-06-01 16:53:56] [INFO ] State equation strengthened by 1 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) 245/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 288/535 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 360/895 variables, 72/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/895 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 104/999 variables, 21/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/999 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/1009 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1009 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1517/2526 variables, 1009/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2526 variables, 1/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2526 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2527 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2527 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2527 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2527/2527 variables, and 1188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1827 ms.
Refiners :[Positive P Invariants (semi-flows): 156/156 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 1010/1010 constraints, ReadFeed: 1/1 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) 245/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 288/535 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 360/895 variables, 72/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/895 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 104/999 variables, 21/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/999 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/1009 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1009 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1517/2526 variables, 1009/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2526 variables, 1/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2526 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2526 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2527 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2527 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2527 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2527/2527 variables, and 1189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3362 ms.
Refiners :[Positive P Invariants (semi-flows): 156/156 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 1010/1010 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5221ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 2 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1521/1521 transitions.
Applied a total of 0 rules in 101 ms. Remains 1010 /1010 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 1010/1010 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1521/1521 transitions.
Applied a total of 0 rules in 73 ms. Remains 1010 /1010 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-06-01 16:54:02] [INFO ] Flow matrix only has 1517 transitions (discarded 4 similar events)
[2024-06-01 16:54:02] [INFO ] Invariant cache hit.
[2024-06-01 16:54:05] [INFO ] Implicit Places using invariants in 3156 ms returned []
[2024-06-01 16:54:05] [INFO ] Flow matrix only has 1517 transitions (discarded 4 similar events)
[2024-06-01 16:54:05] [INFO ] Invariant cache hit.
[2024-06-01 16:54:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:54:33] [INFO ] Implicit Places using invariants and state equation in 28040 ms returned []
Implicit Place search using SMT with State Equation took 31232 ms to find 0 implicit places.
[2024-06-01 16:54:33] [INFO ] Redundant transitions in 111 ms returned []
Running 1515 sub problems to find dead transitions.
[2024-06-01 16:54:33] [INFO ] Flow matrix only has 1517 transitions (discarded 4 similar events)
[2024-06-01 16:54:33] [INFO ] Invariant cache hit.
[2024-06-01 16:54:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1005 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 1515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1005 variables, 16/172 constraints. Problems are: Problem set: 0 solved, 1515 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1005/2527 variables, and 172 constraints, problems are : Problem set: 0 solved, 1515 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 156/156 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/1010 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1515/1515 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1005 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 1515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1005 variables, 16/172 constraints. Problems are: Problem set: 0 solved, 1515 unsolved
[2024-06-01 16:55:11] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 23 ms to minimize.
[2024-06-01 16:55:39] [INFO ] Deduced a trap composed of 13 places in 573 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/2527 variables, and 174 constraints, problems are : Problem set: 0 solved, 1515 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 156/156 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/1010 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1515 constraints, Known Traps: 2/2 constraints]
After SMT, in 65900ms problems are : Problem set: 0 solved, 1515 unsolved
Search for dead transitions found 0 dead transitions in 65917ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97357 ms. Remains : 1010/1010 places, 1521/1521 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1010 transition count 1517
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1010 transition count 1516
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1009 transition count 1516
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1009 transition count 1515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1008 transition count 1515
Applied a total of 8 rules in 197 ms. Remains 1008 /1010 variables (removed 2) and now considering 1515/1521 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1515 rows 1008 cols
[2024-06-01 16:55:39] [INFO ] Computed 177 invariants in 30 ms
[2024-06-01 16:55:39] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 16:55:40] [INFO ] [Nat]Absence check using 156 positive place invariants in 31 ms returned sat
[2024-06-01 16:55:40] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 37 ms returned sat
[2024-06-01 16:55:41] [INFO ] After 1826ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 16:55:42] [INFO ] After 2040ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 16:55:42] [INFO ] After 2404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2840 ms.
[2024-06-01 16:55:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-06-01 16:55:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1010 places, 1521 transitions and 7904 arcs took 17 ms.
[2024-06-01 16:55:42] [INFO ] Flatten gal took : 260 ms
Total runtime 144869 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 : PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-00

BK_STOP 1717260943090

--------------------
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
mcc2024
rfs formula name PolyORBNT-PT-S05J80-ReachabilityCardinality-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/586/inv_0_
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="PolyORBNT-PT-S05J80"
export BK_EXAMINATION="ReachabilityCardinality"
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 PolyORBNT-PT-S05J80, 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 r516-tajo-171654447200478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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