About the Execution of LTSMin+red for EisenbergMcGuire-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 910.655 | 105568.00 | 154557.00 | 474.90 | FTFFFT?TFTFFT?TF | normal |
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.r492-smll-171636266300182.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 EisenbergMcGuire-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300182
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 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 1.2M 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 EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-01
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-04
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-06
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-07
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-12
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-13
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-14
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717228658664
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:57:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:57:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:57:42] [INFO ] Load time of PNML (sax parser for PT used): 458 ms
[2024-06-01 07:57:42] [INFO ] Transformed 553 places.
[2024-06-01 07:57:42] [INFO ] Transformed 1960 transitions.
[2024-06-01 07:57:42] [INFO ] Found NUPN structural information;
[2024-06-01 07:57:42] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 739 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 74 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2696 ms. (14 steps per ms) remains 8/15 properties
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 763 ms. (52 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 874 ms. (45 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
[2024-06-01 07:57:44] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2024-06-01 07:57:44] [INFO ] Computed 22 invariants in 26 ms
[2024-06-01 07:57:44] [INFO ] State equation strengthened by 472 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-00 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-15 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 408/539 variables, 14/145 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 408/553 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 1/554 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 0/554 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/546 variables, 6/560 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 7/567 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/567 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1001/1547 variables, 546/1113 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1547 variables, 472/1585 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1547 variables, 0/1585 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 7/1554 variables, 7/1592 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1554 variables, 7/1599 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1554 variables, 1/1600 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1554 variables, 0/1600 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1554 variables, 0/1600 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1554/1554 variables, and 1600 constraints, problems are : Problem set: 2 solved, 6 unsolved in 3509 ms.
Refiners :[Domain max(s): 553/553 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 553/553 constraints, ReadFeed: 472/472 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 446/537 variables, 14/105 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 446/551 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 07:57:48] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 1/552 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 0/552 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 9/546 variables, 7/559 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 9/568 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 07:57:50] [INFO ] Deduced a trap composed of 3 places in 620 ms of which 11 ms to minimize.
[2024-06-01 07:57:50] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 3 ms to minimize.
[2024-06-01 07:57:50] [INFO ] Deduced a trap composed of 3 places in 307 ms of which 5 ms to minimize.
[2024-06-01 07:57:51] [INFO ] Deduced a trap composed of 3 places in 486 ms of which 7 ms to minimize.
[2024-06-01 07:57:51] [INFO ] Deduced a trap composed of 78 places in 567 ms of which 7 ms to minimize.
[2024-06-01 07:57:52] [INFO ] Deduced a trap composed of 26 places in 441 ms of which 6 ms to minimize.
[2024-06-01 07:57:53] [INFO ] Deduced a trap composed of 35 places in 598 ms of which 9 ms to minimize.
[2024-06-01 07:57:53] [INFO ] Deduced a trap composed of 32 places in 387 ms of which 6 ms to minimize.
SMT process timed out in 9200ms, After SMT, problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 91 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 553 transition count 1956
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 549 transition count 1955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 548 transition count 1955
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 10 place count 548 transition count 1849
Deduced a syphon composed of 106 places in 9 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 222 place count 442 transition count 1849
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 257 place count 407 transition count 1604
Iterating global reduction 3 with 35 rules applied. Total rules applied 292 place count 407 transition count 1604
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 364 place count 371 transition count 1568
Applied a total of 364 rules in 474 ms. Remains 371 /553 variables (removed 182) and now considering 1568/1960 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 496 ms. Remains : 371/553 places, 1568/1960 transitions.
RANDOM walk for 40000 steps (8 resets) in 647 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 175416 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :2 out of 6
Probabilistic random walk after 175416 steps, saw 104275 distinct states, run finished after 3008 ms. (steps per millisecond=58 ) properties seen :2
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 07:57:57] [INFO ] Flow matrix only has 609 transitions (discarded 959 similar events)
// Phase 1: matrix 609 rows 371 cols
[2024-06-01 07:57:57] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:57:57] [INFO ] State equation strengthened by 262 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 280/355 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/364 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 609/973 variables, 364/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 262/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/973 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/980 variables, 7/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/980 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/980 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/980 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 980/980 variables, and 655 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 371/371 constraints, ReadFeed: 262/262 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/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 280/355 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:57:58] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 9/364 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:57:59] [INFO ] Deduced a trap composed of 3 places in 458 ms of which 6 ms to minimize.
[2024-06-01 07:58:00] [INFO ] Deduced a trap composed of 41 places in 505 ms of which 6 ms to minimize.
[2024-06-01 07:58:00] [INFO ] Deduced a trap composed of 3 places in 322 ms of which 4 ms to minimize.
[2024-06-01 07:58:00] [INFO ] Deduced a trap composed of 41 places in 474 ms of which 5 ms to minimize.
[2024-06-01 07:58:01] [INFO ] Deduced a trap composed of 43 places in 414 ms of which 5 ms to minimize.
[2024-06-01 07:58:01] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 4 ms to minimize.
[2024-06-01 07:58:02] [INFO ] Deduced a trap composed of 26 places in 328 ms of which 4 ms to minimize.
[2024-06-01 07:58:02] [INFO ] Deduced a trap composed of 41 places in 266 ms of which 4 ms to minimize.
[2024-06-01 07:58:02] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 2 ms to minimize.
[2024-06-01 07:58:02] [INFO ] Deduced a trap composed of 3 places in 387 ms of which 5 ms to minimize.
[2024-06-01 07:58:03] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 3 ms to minimize.
[2024-06-01 07:58:03] [INFO ] Deduced a trap composed of 41 places in 342 ms of which 4 ms to minimize.
[2024-06-01 07:58:03] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 4 ms to minimize.
[2024-06-01 07:58:04] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-01 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-01 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 07:58:04] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:58:04] [INFO ] Deduced a trap composed of 48 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:58:04] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:58:04] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 3 ms to minimize.
[2024-06-01 07:58:05] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 3 ms to minimize.
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-09 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 07:58:05] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-01 is UNSAT
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-09 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 20/42 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:58:05] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 4 ms to minimize.
[2024-06-01 07:58:05] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:58:05] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 3/45 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:58:06] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 609/973 variables, 364/410 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/973 variables, 262/672 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/973 variables, 0/672 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 7/980 variables, 7/679 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/980 variables, 1/680 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/980 variables, 2/682 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/980 variables, 0/682 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/980 variables, 0/682 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 980/980 variables, and 682 constraints, problems are : Problem set: 2 solved, 2 unsolved in 8769 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 371/371 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 25/25 constraints]
After SMT, in 9830ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 769 ms.
Support contains 42 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 1568/1568 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 371 transition count 1544
Deduced a syphon composed of 24 places in 6 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 347 transition count 1544
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 342 transition count 1509
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 342 transition count 1509
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 341 transition count 1508
Applied a total of 60 rules in 151 ms. Remains 341 /371 variables (removed 30) and now considering 1508/1568 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 341/371 places, 1508/1568 transitions.
RANDOM walk for 40000 steps (8 resets) in 301 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 254912 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 254912 steps, saw 137154 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-06-01 07:58:11] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
// Phase 1: matrix 549 rows 341 cols
[2024-06-01 07:58:11] [INFO ] Computed 22 invariants in 10 ms
[2024-06-01 07:58:11] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 282/324 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/334 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 549/883 variables, 334/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 232/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/890 variables, 7/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/890 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/890 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/890 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 890/890 variables, and 595 constraints, problems are : Problem set: 0 solved, 2 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 341/341 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 282/324 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/334 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:58:12] [INFO ] Deduced a trap composed of 3 places in 356 ms of which 5 ms to minimize.
[2024-06-01 07:58:13] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 3 ms to minimize.
[2024-06-01 07:58:13] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:58:13] [INFO ] Deduced a trap composed of 33 places in 331 ms of which 5 ms to minimize.
[2024-06-01 07:58:13] [INFO ] Deduced a trap composed of 18 places in 248 ms of which 4 ms to minimize.
[2024-06-01 07:58:13] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:58:14] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:58:14] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:58:14] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:58:14] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:58:14] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:58:14] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:58:14] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:58:15] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 549/883 variables, 334/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 232/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7/890 variables, 7/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/890 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/890 variables, 2/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/890 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:58:15] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/890 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/890 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/890 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 890/890 variables, and 612 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4114 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 341/341 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 4779ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 669 ms.
Support contains 42 out of 341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 1508/1508 transitions.
Applied a total of 0 rules in 71 ms. Remains 341 /341 variables (removed 0) and now considering 1508/1508 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 341/341 places, 1508/1508 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 1508/1508 transitions.
Applied a total of 0 rules in 70 ms. Remains 341 /341 variables (removed 0) and now considering 1508/1508 (removed 0) transitions.
[2024-06-01 07:58:17] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2024-06-01 07:58:17] [INFO ] Invariant cache hit.
[2024-06-01 07:58:17] [INFO ] Implicit Places using invariants in 677 ms returned []
[2024-06-01 07:58:17] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2024-06-01 07:58:17] [INFO ] Invariant cache hit.
[2024-06-01 07:58:18] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 07:58:19] [INFO ] Implicit Places using invariants and state equation in 2121 ms returned []
Implicit Place search using SMT with State Equation took 2816 ms to find 0 implicit places.
[2024-06-01 07:58:20] [INFO ] Redundant transitions in 136 ms returned []
Running 1501 sub problems to find dead transitions.
[2024-06-01 07:58:20] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2024-06-01 07:58:20] [INFO ] Invariant cache hit.
[2024-06-01 07:58:20] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/341 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
[2024-06-01 07:58:40] [INFO ] Deduced a trap composed of 32 places in 428 ms of which 5 ms to minimize.
[2024-06-01 07:58:41] [INFO ] Deduced a trap composed of 3 places in 409 ms of which 6 ms to minimize.
[2024-06-01 07:58:41] [INFO ] Deduced a trap composed of 67 places in 304 ms of which 5 ms to minimize.
[2024-06-01 07:58:43] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:58:43] [INFO ] Deduced a trap composed of 15 places in 337 ms of which 5 ms to minimize.
[2024-06-01 07:58:44] [INFO ] Deduced a trap composed of 68 places in 380 ms of which 5 ms to minimize.
[2024-06-01 07:58:44] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:58:44] [INFO ] Deduced a trap composed of 78 places in 365 ms of which 5 ms to minimize.
[2024-06-01 07:58:44] [INFO ] Deduced a trap composed of 69 places in 379 ms of which 5 ms to minimize.
[2024-06-01 07:58:45] [INFO ] Deduced a trap composed of 70 places in 457 ms of which 5 ms to minimize.
[2024-06-01 07:58:45] [INFO ] Deduced a trap composed of 75 places in 471 ms of which 6 ms to minimize.
[2024-06-01 07:58:46] [INFO ] Deduced a trap composed of 61 places in 512 ms of which 6 ms to minimize.
[2024-06-01 07:58:46] [INFO ] Deduced a trap composed of 62 places in 418 ms of which 5 ms to minimize.
[2024-06-01 07:58:47] [INFO ] Deduced a trap composed of 24 places in 361 ms of which 5 ms to minimize.
[2024-06-01 07:58:47] [INFO ] Deduced a trap composed of 3 places in 443 ms of which 5 ms to minimize.
[2024-06-01 07:58:48] [INFO ] Deduced a trap composed of 12 places in 273 ms of which 3 ms to minimize.
[2024-06-01 07:58:48] [INFO ] Deduced a trap composed of 71 places in 303 ms of which 4 ms to minimize.
[2024-06-01 07:58:48] [INFO ] Deduced a trap composed of 66 places in 512 ms of which 6 ms to minimize.
[2024-06-01 07:58:49] [INFO ] Deduced a trap composed of 60 places in 495 ms of which 5 ms to minimize.
[2024-06-01 07:58:49] [INFO ] Deduced a trap composed of 58 places in 501 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/890 variables, and 42 constraints, problems are : Problem set: 0 solved, 1501 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/341 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1501/1501 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/341 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
[2024-06-01 07:58:57] [INFO ] Deduced a trap composed of 67 places in 494 ms of which 6 ms to minimize.
[2024-06-01 07:58:57] [INFO ] Deduced a trap composed of 56 places in 521 ms of which 5 ms to minimize.
[2024-06-01 07:58:58] [INFO ] Deduced a trap composed of 66 places in 439 ms of which 6 ms to minimize.
[2024-06-01 07:58:58] [INFO ] Deduced a trap composed of 52 places in 437 ms of which 5 ms to minimize.
[2024-06-01 07:58:59] [INFO ] Deduced a trap composed of 64 places in 414 ms of which 5 ms to minimize.
[2024-06-01 07:58:59] [INFO ] Deduced a trap composed of 53 places in 446 ms of which 5 ms to minimize.
[2024-06-01 07:58:59] [INFO ] Deduced a trap composed of 73 places in 460 ms of which 5 ms to minimize.
[2024-06-01 07:59:00] [INFO ] Deduced a trap composed of 66 places in 441 ms of which 5 ms to minimize.
[2024-06-01 07:59:00] [INFO ] Deduced a trap composed of 53 places in 445 ms of which 6 ms to minimize.
[2024-06-01 07:59:01] [INFO ] Deduced a trap composed of 53 places in 308 ms of which 3 ms to minimize.
[2024-06-01 07:59:01] [INFO ] Deduced a trap composed of 18 places in 464 ms of which 6 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 3 places in 488 ms of which 5 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 16 places in 457 ms of which 5 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 14 places in 502 ms of which 5 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:59:05] [INFO ] Deduced a trap composed of 54 places in 465 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
[2024-06-01 07:59:08] [INFO ] Deduced a trap composed of 44 places in 506 ms of which 6 ms to minimize.
[2024-06-01 07:59:09] [INFO ] Deduced a trap composed of 72 places in 385 ms of which 5 ms to minimize.
[2024-06-01 07:59:09] [INFO ] Deduced a trap composed of 70 places in 495 ms of which 5 ms to minimize.
[2024-06-01 07:59:10] [INFO ] Deduced a trap composed of 23 places in 478 ms of which 5 ms to minimize.
[2024-06-01 07:59:10] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:59:10] [INFO ] Deduced a trap composed of 26 places in 454 ms of which 4 ms to minimize.
[2024-06-01 07:59:12] [INFO ] Deduced a trap composed of 66 places in 500 ms of which 6 ms to minimize.
[2024-06-01 07:59:12] [INFO ] Deduced a trap composed of 52 places in 444 ms of which 5 ms to minimize.
[2024-06-01 07:59:13] [INFO ] Deduced a trap composed of 74 places in 485 ms of which 5 ms to minimize.
[2024-06-01 07:59:13] [INFO ] Deduced a trap composed of 60 places in 471 ms of which 5 ms to minimize.
[2024-06-01 07:59:14] [INFO ] Deduced a trap composed of 47 places in 454 ms of which 5 ms to minimize.
[2024-06-01 07:59:14] [INFO ] Deduced a trap composed of 59 places in 455 ms of which 5 ms to minimize.
[2024-06-01 07:59:15] [INFO ] Deduced a trap composed of 46 places in 459 ms of which 5 ms to minimize.
[2024-06-01 07:59:15] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:59:15] [INFO ] Deduced a trap composed of 31 places in 502 ms of which 6 ms to minimize.
[2024-06-01 07:59:16] [INFO ] Deduced a trap composed of 68 places in 512 ms of which 6 ms to minimize.
[2024-06-01 07:59:16] [INFO ] Deduced a trap composed of 70 places in 536 ms of which 5 ms to minimize.
[2024-06-01 07:59:17] [INFO ] Deduced a trap composed of 72 places in 489 ms of which 6 ms to minimize.
[2024-06-01 07:59:17] [INFO ] Deduced a trap composed of 90 places in 445 ms of which 5 ms to minimize.
[2024-06-01 07:59:18] [INFO ] Deduced a trap composed of 77 places in 454 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
[2024-06-01 07:59:21] [INFO ] Deduced a trap composed of 62 places in 507 ms of which 6 ms to minimize.
[2024-06-01 07:59:22] [INFO ] Deduced a trap composed of 62 places in 494 ms of which 6 ms to minimize.
SMT process timed out in 62000ms, After SMT, problems are : Problem set: 0 solved, 1501 unsolved
Search for dead transitions found 0 dead transitions in 62033ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65077 ms. Remains : 341/341 places, 1508/1508 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1230 edges and 341 vertex of which 42 / 341 are part of one of the 7 SCC in 7 ms
Free SCC test removed 35 places
Drop transitions (Empty/Sink Transition effects.) removed 125 transitions
Ensure Unique test removed 946 transitions
Reduce isomorphic transitions removed 1071 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 306 transition count 385
Reduce places removed 52 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 59 rules applied. Total rules applied 112 place count 254 transition count 378
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 119 place count 247 transition count 378
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 119 place count 247 transition count 370
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 136 place count 238 transition count 370
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 270 place count 171 transition count 303
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 295 place count 171 transition count 278
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 301 place count 168 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 317 place count 168 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 319 place count 167 transition count 275
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 356 place count 167 transition count 238
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 393 place count 130 transition count 238
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 398 place count 130 transition count 238
Applied a total of 398 rules in 104 ms. Remains 130 /341 variables (removed 211) and now considering 238/1508 (removed 1270) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 238 rows 130 cols
[2024-06-01 07:59:22] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 07:59:22] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:59:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-06-01 07:59:22] [INFO ] [Nat]Absence check using 15 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 07:59:22] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 07:59:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:59:22] [INFO ] After 61ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 07:59:22] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:59:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:59:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
TRAPS : Iteration 1
[2024-06-01 07:59:23] [INFO ] After 332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 07:59:23] [INFO ] After 688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 907 ms.
[2024-06-01 07:59:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-06-01 07:59:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 341 places, 1508 transitions and 7748 arcs took 28 ms.
[2024-06-01 07:59:23] [INFO ] Flatten gal took : 343 ms
Total runtime 102532 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-06
Could not compute solution for formula : EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-13
BK_STOP 1717228764232
--------------------
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 EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-06
rfs formula type EF
rfs formula formula --invariant=/tmp/899/inv_0_
rfs formula name EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-13
rfs formula type EF
rfs formula formula --invariant=/tmp/899/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="EisenbergMcGuire-PT-07"
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 EisenbergMcGuire-PT-07, 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 r492-smll-171636266300182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-07.tgz
mv EisenbergMcGuire-PT-07 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 '
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 ;