About the Execution of LTSMin+red for HirschbergSinclair-PT-20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
789.659 | 85277.00 | 150611.00 | 447.30 | F?????F??FF????? | 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.r500-smll-171649587400081.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 HirschbergSinclair-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587400081
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 13 03:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 13 03:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 13 03:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 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 284K 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 HirschbergSinclair-PT-20-CTLCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2023-12
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2023-13
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2023-14
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717240420875
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:13:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:13:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:13:44] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-06-01 11:13:44] [INFO ] Transformed 530 places.
[2024-06-01 11:13:44] [INFO ] Transformed 485 transitions.
[2024-06-01 11:13:44] [INFO ] Parsed PT model containing 530 places and 485 transitions and 1479 arcs in 449 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
Support contains 165 out of 530 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 485/485 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 518 transition count 485
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 19 place count 511 transition count 478
Iterating global reduction 1 with 7 rules applied. Total rules applied 26 place count 511 transition count 478
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 508 transition count 475
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 508 transition count 475
Applied a total of 32 rules in 422 ms. Remains 508 /530 variables (removed 22) and now considering 475/485 (removed 10) transitions.
// Phase 1: matrix 475 rows 508 cols
[2024-06-01 11:13:44] [INFO ] Computed 33 invariants in 31 ms
[2024-06-01 11:13:45] [INFO ] Implicit Places using invariants in 996 ms returned []
[2024-06-01 11:13:45] [INFO ] Invariant cache hit.
[2024-06-01 11:13:48] [INFO ] Implicit Places using invariants and state equation in 2217 ms returned []
Implicit Place search using SMT with State Equation took 3277 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-01 11:13:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 28/508 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-01 11:14:14] [INFO ] Deduced a trap composed of 191 places in 544 ms of which 76 ms to minimize.
[2024-06-01 11:14:16] [INFO ] Deduced a trap composed of 191 places in 364 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/983 variables, and 35 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/508 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 28/508 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (OVERLAPS) 475/983 variables, 508/543 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/983 variables, 455/998 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 983/983 variables, and 998 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 508/508 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 2/2 constraints]
After SMT, in 60968ms problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 61042ms
Starting structural reductions in LTL mode, iteration 1 : 508/530 places, 475/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64817 ms. Remains : 508/530 places, 475/485 transitions.
Support contains 165 out of 508 places after structural reductions.
[2024-06-01 11:14:49] [INFO ] Flatten gal took : 174 ms
[2024-06-01 11:14:49] [INFO ] Flatten gal took : 172 ms
[2024-06-01 11:14:50] [INFO ] Input system was already deterministic with 475 transitions.
RANDOM walk for 40000 steps (80 resets) in 4338 ms. (9 steps per ms) remains 24/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
[2024-06-01 11:14:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 1 (OVERLAPS) 373/420 variables, 24/24 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/24 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 18/438 variables, 5/29 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/29 constraints. Problems are: Problem set: 16 solved, 8 unsolved
Problem AtomicPropp50 is UNSAT
At refinement iteration 5 (OVERLAPS) 33/471 variables, 4/33 constraints. Problems are: Problem set: 17 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/33 constraints. Problems are: Problem set: 17 solved, 7 unsolved
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp91 is UNSAT
At refinement iteration 7 (OVERLAPS) 475/946 variables, 471/504 constraints. Problems are: Problem set: 19 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/946 variables, 0/504 constraints. Problems are: Problem set: 19 solved, 5 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 9 (OVERLAPS) 37/983 variables, 37/541 constraints. Problems are: Problem set: 20 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/983 variables, 0/541 constraints. Problems are: Problem set: 20 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/983 variables, 0/541 constraints. Problems are: Problem set: 20 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 983/983 variables, and 541 constraints, problems are : Problem set: 20 solved, 4 unsolved in 2768 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 508/508 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 394/407 variables, 21/21 constraints. Problems are: Problem set: 20 solved, 4 unsolved
[2024-06-01 11:14:56] [INFO ] Deduced a trap composed of 38 places in 1423 ms of which 6 ms to minimize.
[2024-06-01 11:14:57] [INFO ] Deduced a trap composed of 58 places in 339 ms of which 38 ms to minimize.
[2024-06-01 11:14:57] [INFO ] Deduced a trap composed of 111 places in 420 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 3/24 constraints. Problems are: Problem set: 20 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/24 constraints. Problems are: Problem set: 20 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 28/435 variables, 8/32 constraints. Problems are: Problem set: 20 solved, 4 unsolved
[2024-06-01 11:14:58] [INFO ] Deduced a trap composed of 17 places in 321 ms of which 33 ms to minimize.
[2024-06-01 11:14:58] [INFO ] Deduced a trap composed of 31 places in 555 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 2/34 constraints. Problems are: Problem set: 20 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 0/34 constraints. Problems are: Problem set: 20 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 34/469 variables, 4/38 constraints. Problems are: Problem set: 20 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/38 constraints. Problems are: Problem set: 20 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 475/944 variables, 469/507 constraints. Problems are: Problem set: 20 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/944 variables, 3/510 constraints. Problems are: Problem set: 20 solved, 4 unsolved
[2024-06-01 11:15:00] [INFO ] Deduced a trap composed of 70 places in 413 ms of which 4 ms to minimize.
SMT process timed out in 7807ms, After SMT, problems are : Problem set: 20 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 475/475 transitions.
Graph (complete) has 952 edges and 508 vertex of which 498 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.6 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 498 transition count 277
Reduce places removed 194 places and 0 transitions.
Graph (complete) has 524 edges and 304 vertex of which 270 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 270 transition count 273
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 436 place count 266 transition count 239
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 441 place count 261 transition count 234
Iterating global reduction 3 with 5 rules applied. Total rules applied 446 place count 261 transition count 234
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 3 with 4 rules applied. Total rules applied 450 place count 261 transition count 230
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 451 edges and 257 vertex of which 249 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 5 rules applied. Total rules applied 455 place count 249 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 463 place count 249 transition count 222
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 6 with 19 rules applied. Total rules applied 482 place count 249 transition count 203
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 501 place count 230 transition count 203
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 7 with 19 rules applied. Total rules applied 520 place count 211 transition count 184
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 7 with 25 rules applied. Total rules applied 545 place count 207 transition count 163
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 22 rules applied. Total rules applied 567 place count 186 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 568 place count 185 transition count 162
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 15 Pre rules applied. Total rules applied 568 place count 185 transition count 147
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 598 place count 170 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 600 place count 169 transition count 146
Applied a total of 600 rules in 181 ms. Remains 169 /508 variables (removed 339) and now considering 146/475 (removed 329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 169/508 places, 146/475 transitions.
RANDOM walk for 40000 steps (276 resets) in 1301 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (86 resets) in 339 ms. (117 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (92 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (86 resets) in 263 ms. (151 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (75 resets) in 56 ms. (701 steps per ms) remains 1/2 properties
// Phase 1: matrix 146 rows 169 cols
[2024-06-01 11:15:01] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 11:15:01] [INFO ] State equation strengthened by 6 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) 129/131 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/161 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 141/302 variables, 161/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 6/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/306 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/307 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/307 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/315 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 164/169 constraints, ReadFeed: 6/6 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) 129/131 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/161 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 141/302 variables, 161/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 6/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/306 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/307 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/307 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/315 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 164/169 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 678ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 112 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=112 )
Parikh walk visited 1 properties in 13 ms.
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
FORMULA HirschbergSinclair-PT-20-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:15:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 11:15:01] [INFO ] Flatten gal took : 80 ms
FORMULA HirschbergSinclair-PT-20-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:15:02] [INFO ] Flatten gal took : 70 ms
[2024-06-01 11:15:02] [INFO ] Input system was already deterministic with 475 transitions.
Support contains 103 out of 508 places (down from 114) after GAL structural reductions.
Computed a total of 508 stabilizing places and 475 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 508 transition count 475
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA HirschbergSinclair-PT-20-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 475/475 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 500 transition count 475
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 24 place count 484 transition count 459
Iterating global reduction 1 with 16 rules applied. Total rules applied 40 place count 484 transition count 459
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 53 place count 471 transition count 446
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 471 transition count 446
Applied a total of 66 rules in 84 ms. Remains 471 /508 variables (removed 37) and now considering 446/475 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 471/508 places, 446/475 transitions.
[2024-06-01 11:15:02] [INFO ] Flatten gal took : 39 ms
[2024-06-01 11:15:02] [INFO ] Flatten gal took : 58 ms
[2024-06-01 11:15:02] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 508/508 places, 475/475 transitions.
Graph (complete) has 952 edges and 508 vertex of which 500 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 19 places and 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 481 transition count 253
Reduce places removed 203 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 205 rules applied. Total rules applied 409 place count 278 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 411 place count 276 transition count 251
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 427 place count 260 transition count 235
Iterating global reduction 3 with 16 rules applied. Total rules applied 443 place count 260 transition count 235
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 3 with 4 rules applied. Total rules applied 447 place count 260 transition count 231
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 451 place count 256 transition count 231
Applied a total of 451 rules in 160 ms. Remains 256 /508 variables (removed 252) and now considering 231/475 (removed 244) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 160 ms. Remains : 256/508 places, 231/475 transitions.
[2024-06-01 11:15:02] [INFO ] Flatten gal took : 12 ms
[2024-06-01 11:15:02] [INFO ] Flatten gal took : 24 ms
[2024-06-01 11:15:02] [INFO ] Input system was already deterministic with 231 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 508/508 places, 475/475 transitions.
Graph (complete) has 952 edges and 508 vertex of which 500 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 19 places and 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 194 place count 481 transition count 263
Reduce places removed 193 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 194 rules applied. Total rules applied 388 place count 288 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 389 place count 287 transition count 262
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 406 place count 270 transition count 245
Iterating global reduction 3 with 17 rules applied. Total rules applied 423 place count 270 transition count 245
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 3 with 4 rules applied. Total rules applied 427 place count 270 transition count 241
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 431 place count 266 transition count 241
Applied a total of 431 rules in 88 ms. Remains 266 /508 variables (removed 242) and now considering 241/475 (removed 234) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 103 ms. Remains : 266/508 places, 241/475 transitions.
[2024-06-01 11:15:02] [INFO ] Flatten gal took : 12 ms
[2024-06-01 11:15:03] [INFO ] Flatten gal took : 20 ms
[2024-06-01 11:15:03] [INFO ] Input system was already deterministic with 241 transitions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 475/475 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 501 transition count 475
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 23 place count 485 transition count 459
Iterating global reduction 1 with 16 rules applied. Total rules applied 39 place count 485 transition count 459
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 473 transition count 447
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 473 transition count 447
Applied a total of 63 rules in 133 ms. Remains 473 /508 variables (removed 35) and now considering 447/475 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 473/508 places, 447/475 transitions.
[2024-06-01 11:15:03] [INFO ] Flatten gal took : 21 ms
[2024-06-01 11:15:03] [INFO ] Flatten gal took : 21 ms
[2024-06-01 11:15:03] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 508/508 places, 475/475 transitions.
Graph (complete) has 952 edges and 508 vertex of which 500 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 20 places and 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 208 place count 480 transition count 248
Reduce places removed 207 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 208 rules applied. Total rules applied 416 place count 273 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 417 place count 272 transition count 247
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 434 place count 255 transition count 230
Iterating global reduction 3 with 17 rules applied. Total rules applied 451 place count 255 transition count 230
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 3 with 4 rules applied. Total rules applied 455 place count 255 transition count 226
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 459 place count 251 transition count 226
Applied a total of 459 rules in 58 ms. Remains 251 /508 variables (removed 257) and now considering 226/475 (removed 249) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 251/508 places, 226/475 transitions.
[2024-06-01 11:15:03] [INFO ] Flatten gal took : 8 ms
[2024-06-01 11:15:03] [INFO ] Flatten gal took : 11 ms
[2024-06-01 11:15:03] [INFO ] Input system was already deterministic with 226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 475/475 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 500 transition count 475
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 24 place count 484 transition count 459
Iterating global reduction 1 with 16 rules applied. Total rules applied 40 place count 484 transition count 459
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 472 transition count 447
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 472 transition count 447
Applied a total of 64 rules in 105 ms. Remains 472 /508 variables (removed 36) and now considering 447/475 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 472/508 places, 447/475 transitions.
[2024-06-01 11:15:03] [INFO ] Flatten gal took : 24 ms
[2024-06-01 11:15:03] [INFO ] Flatten gal took : 20 ms
[2024-06-01 11:15:03] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 475/475 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 501 transition count 475
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 22 place count 486 transition count 460
Iterating global reduction 1 with 15 rules applied. Total rules applied 37 place count 486 transition count 460
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 475 transition count 449
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 475 transition count 449
Applied a total of 59 rules in 98 ms. Remains 475 /508 variables (removed 33) and now considering 449/475 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 475/508 places, 449/475 transitions.
[2024-06-01 11:15:03] [INFO ] Flatten gal took : 23 ms
[2024-06-01 11:15:03] [INFO ] Flatten gal took : 45 ms
[2024-06-01 11:15:04] [INFO ] Input system was already deterministic with 449 transitions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 475/475 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 501 transition count 475
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 23 place count 485 transition count 459
Iterating global reduction 1 with 16 rules applied. Total rules applied 39 place count 485 transition count 459
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 473 transition count 447
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 473 transition count 447
Applied a total of 63 rules in 130 ms. Remains 473 /508 variables (removed 35) and now considering 447/475 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 473/508 places, 447/475 transitions.
[2024-06-01 11:15:04] [INFO ] Flatten gal took : 25 ms
[2024-06-01 11:15:04] [INFO ] Flatten gal took : 35 ms
[2024-06-01 11:15:04] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 475/475 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 503 transition count 475
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 489 transition count 461
Iterating global reduction 1 with 14 rules applied. Total rules applied 33 place count 489 transition count 461
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 480 transition count 452
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 480 transition count 452
Applied a total of 51 rules in 82 ms. Remains 480 /508 variables (removed 28) and now considering 452/475 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 480/508 places, 452/475 transitions.
[2024-06-01 11:15:04] [INFO ] Flatten gal took : 34 ms
[2024-06-01 11:15:04] [INFO ] Flatten gal took : 35 ms
[2024-06-01 11:15:04] [INFO ] Input system was already deterministic with 452 transitions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 475/475 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 500 transition count 475
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 25 place count 483 transition count 458
Iterating global reduction 1 with 17 rules applied. Total rules applied 42 place count 483 transition count 458
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 55 place count 470 transition count 445
Iterating global reduction 1 with 13 rules applied. Total rules applied 68 place count 470 transition count 445
Applied a total of 68 rules in 91 ms. Remains 470 /508 variables (removed 38) and now considering 445/475 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 470/508 places, 445/475 transitions.
[2024-06-01 11:15:04] [INFO ] Flatten gal took : 18 ms
[2024-06-01 11:15:04] [INFO ] Flatten gal took : 19 ms
[2024-06-01 11:15:04] [INFO ] Input system was already deterministic with 445 transitions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 475/475 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 500 transition count 475
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 22 place count 486 transition count 461
Iterating global reduction 1 with 14 rules applied. Total rules applied 36 place count 486 transition count 461
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 475 transition count 450
Iterating global reduction 1 with 11 rules applied. Total rules applied 58 place count 475 transition count 450
Applied a total of 58 rules in 71 ms. Remains 475 /508 variables (removed 33) and now considering 450/475 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 475/508 places, 450/475 transitions.
[2024-06-01 11:15:04] [INFO ] Flatten gal took : 17 ms
[2024-06-01 11:15:05] [INFO ] Flatten gal took : 33 ms
[2024-06-01 11:15:05] [INFO ] Input system was already deterministic with 450 transitions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 475/475 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 501 transition count 475
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 22 place count 486 transition count 460
Iterating global reduction 1 with 15 rules applied. Total rules applied 37 place count 486 transition count 460
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 47 place count 476 transition count 450
Iterating global reduction 1 with 10 rules applied. Total rules applied 57 place count 476 transition count 450
Applied a total of 57 rules in 65 ms. Remains 476 /508 variables (removed 32) and now considering 450/475 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 476/508 places, 450/475 transitions.
[2024-06-01 11:15:05] [INFO ] Flatten gal took : 15 ms
[2024-06-01 11:15:05] [INFO ] Flatten gal took : 19 ms
[2024-06-01 11:15:05] [INFO ] Input system was already deterministic with 450 transitions.
[2024-06-01 11:15:05] [INFO ] Flatten gal took : 21 ms
[2024-06-01 11:15:05] [INFO ] Flatten gal took : 19 ms
[2024-06-01 11:15:05] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 11:15:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 508 places, 475 transitions and 1426 arcs took 12 ms.
Total runtime 81762 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=
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="HirschbergSinclair-PT-20"
export BK_EXAMINATION="CTLCardinality"
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 HirschbergSinclair-PT-20, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r500-smll-171649587400081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-20.tgz
mv HirschbergSinclair-PT-20 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;