About the Execution of LTSMin+red for FunctionPointer-PT-c008
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4333.312 | 130511.00 | 199922.00 | 313.50 | TFFFFT?FFF??FFFF | 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.r496-tall-171640603100295.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 FunctionPointer-PT-c008, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603100295
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.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 FunctionPointer-PT-c008-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2024-01
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2024-02
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2024-04
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2023-05
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2024-08
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2024-10
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2023-11
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2023-12
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2024-13
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2023-14
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717191792182
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:43:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:43:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:43:13] [INFO ] Load time of PNML (sax parser for PT used): 370 ms
[2024-05-31 21:43:13] [INFO ] Transformed 2826 places.
[2024-05-31 21:43:13] [INFO ] Transformed 8960 transitions.
[2024-05-31 21:43:13] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 561 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 45 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (8 resets) in 3590 ms. (11 steps per ms) remains 14/15 properties
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 12/14 properties
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 680 ms. (58 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 12/12 properties
[2024-05-31 21:43:15] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 21:43:15] [INFO ] Computed 4 invariants in 89 ms
[2024-05-31 21:43:16] [INFO ] State equation strengthened by 479 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem FunctionPointer-PT-c008-ReachabilityFireability-2024-15 is UNSAT
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 526/598 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/599 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1653/2252 variables, 599/603 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2252 variables, 403/1006 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2252 variables, 0/1006 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1970/4222 variables, 526/1532 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4222 variables, 76/1608 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4222 variables, 0/1608 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 628/4850 variables, 412/2020 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4850 variables, 0/2020 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 231/5081 variables, 68/2088 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5081 variables, 0/2088 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 87/5168 variables, 23/2111 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5055 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 12/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 529/596 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/597 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1636/2233 variables, 597/601 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2233 variables, 403/1004 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2233 variables, 0/1004 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1978/4211 variables, 523/1527 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4211 variables, 76/1603 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4211 variables, 5/1608 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-31 21:43:24] [INFO ] Deduced a trap composed of 139 places in 286 ms of which 43 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4211 variables, 1/1609 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4211/5168 variables, and 1609 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1120/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 11/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 10673ms problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.31 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 273 places :
Symmetric choice reduction at 0 with 273 rule applications. Total rules 274 place count 1338 transition count 3982
Iterating global reduction 0 with 273 rules applied. Total rules applied 547 place count 1338 transition count 3982
Ensure Unique test removed 514 transitions
Reduce isomorphic transitions removed 514 transitions.
Iterating post reduction 0 with 514 rules applied. Total rules applied 1061 place count 1338 transition count 3468
Discarding 134 places :
Symmetric choice reduction at 1 with 134 rule applications. Total rules 1195 place count 1204 transition count 3200
Iterating global reduction 1 with 134 rules applied. Total rules applied 1329 place count 1204 transition count 3200
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 1453 place count 1204 transition count 3076
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1466 place count 1191 transition count 3050
Iterating global reduction 2 with 13 rules applied. Total rules applied 1479 place count 1191 transition count 3050
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1492 place count 1178 transition count 3024
Iterating global reduction 2 with 13 rules applied. Total rules applied 1505 place count 1178 transition count 3024
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1518 place count 1165 transition count 2998
Iterating global reduction 2 with 13 rules applied. Total rules applied 1531 place count 1165 transition count 2998
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1544 place count 1152 transition count 2972
Iterating global reduction 2 with 13 rules applied. Total rules applied 1557 place count 1152 transition count 2972
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1569 place count 1140 transition count 2948
Iterating global reduction 2 with 12 rules applied. Total rules applied 1581 place count 1140 transition count 2948
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1591 place count 1130 transition count 2928
Iterating global reduction 2 with 10 rules applied. Total rules applied 1601 place count 1130 transition count 2928
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1609 place count 1122 transition count 2912
Iterating global reduction 2 with 8 rules applied. Total rules applied 1617 place count 1122 transition count 2912
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 1644 place count 1095 transition count 2810
Iterating global reduction 2 with 27 rules applied. Total rules applied 1671 place count 1095 transition count 2810
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1700 place count 1066 transition count 2694
Iterating global reduction 2 with 29 rules applied. Total rules applied 1729 place count 1066 transition count 2694
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1757 place count 1038 transition count 2626
Iterating global reduction 2 with 28 rules applied. Total rules applied 1785 place count 1038 transition count 2626
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1813 place count 1010 transition count 2570
Iterating global reduction 2 with 28 rules applied. Total rules applied 1841 place count 1010 transition count 2570
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1869 place count 982 transition count 2514
Iterating global reduction 2 with 28 rules applied. Total rules applied 1897 place count 982 transition count 2514
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1925 place count 954 transition count 2458
Iterating global reduction 2 with 28 rules applied. Total rules applied 1953 place count 954 transition count 2458
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 1980 place count 927 transition count 2404
Iterating global reduction 2 with 27 rules applied. Total rules applied 2007 place count 927 transition count 2404
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2013 place count 921 transition count 2392
Iterating global reduction 2 with 6 rules applied. Total rules applied 2019 place count 921 transition count 2392
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 2 with 72 rules applied. Total rules applied 2091 place count 921 transition count 2320
Applied a total of 2091 rules in 2088 ms. Remains 921 /1628 variables (removed 707) and now considering 2320/5962 (removed 3642) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2114 ms. Remains : 921/1628 places, 2320/5962 transitions.
RANDOM walk for 40009 steps (8 resets) in 571 ms. (69 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 143852 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 11
Probabilistic random walk after 143852 steps, saw 93391 distinct states, run finished after 3009 ms. (steps per millisecond=47 ) properties seen :0
[2024-05-31 21:43:32] [INFO ] Flow matrix only has 1570 transitions (discarded 750 similar events)
// Phase 1: matrix 1570 rows 921 cols
[2024-05-31 21:43:32] [INFO ] Computed 2 invariants in 18 ms
[2024-05-31 21:43:32] [INFO ] State equation strengthened by 371 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 370/437 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/513 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1196/1709 variables, 513/515 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1709 variables, 308/823 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1709 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 639/2348 variables, 283/1106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2348 variables, 63/1169 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2348 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 142/2490 variables, 124/1293 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2490 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 1/2491 variables, 1/1294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2491 variables, 0/1294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/2491 variables, 0/1294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2491/2491 variables, and 1294 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2465 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 921/921 constraints, ReadFeed: 371/371 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 370/437 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/513 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1196/1709 variables, 513/515 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1709 variables, 308/823 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1709 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 639/2348 variables, 283/1106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2348 variables, 63/1169 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2348 variables, 11/1180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 21:43:37] [INFO ] Deduced a trap composed of 131 places in 170 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2348 variables, 1/1181 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2348 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 142/2490 variables, 124/1305 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2490 variables, 0/1305 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 1/2491 variables, 1/1306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2491 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/2491 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2491/2491 variables, and 1306 constraints, problems are : Problem set: 0 solved, 11 unsolved in 9540 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 921/921 constraints, ReadFeed: 371/371 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 12295ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 9 different solutions.
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-2023-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-2023-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-2023-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 8 properties in 15317 ms.
Support contains 23 out of 921 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 921/921 places, 2320/2320 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 897 transition count 2264
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 897 transition count 2264
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 72 place count 897 transition count 2240
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 92 place count 877 transition count 2198
Iterating global reduction 1 with 20 rules applied. Total rules applied 112 place count 877 transition count 2198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 116 place count 877 transition count 2194
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 133 place count 860 transition count 2142
Iterating global reduction 2 with 17 rules applied. Total rules applied 150 place count 860 transition count 2142
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 172 place count 838 transition count 2080
Iterating global reduction 2 with 22 rules applied. Total rules applied 194 place count 838 transition count 2080
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 216 place count 816 transition count 2034
Iterating global reduction 2 with 22 rules applied. Total rules applied 238 place count 816 transition count 2034
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 260 place count 794 transition count 1990
Iterating global reduction 2 with 22 rules applied. Total rules applied 282 place count 794 transition count 1990
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 302 place count 774 transition count 1950
Iterating global reduction 2 with 20 rules applied. Total rules applied 322 place count 774 transition count 1950
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 342 place count 754 transition count 1910
Iterating global reduction 2 with 20 rules applied. Total rules applied 362 place count 754 transition count 1910
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 381 place count 735 transition count 1872
Iterating global reduction 2 with 19 rules applied. Total rules applied 400 place count 735 transition count 1872
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 410 place count 725 transition count 1852
Iterating global reduction 2 with 10 rules applied. Total rules applied 420 place count 725 transition count 1852
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 422 place count 723 transition count 1846
Iterating global reduction 2 with 2 rules applied. Total rules applied 424 place count 723 transition count 1846
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 425 place count 722 transition count 1844
Iterating global reduction 2 with 1 rules applied. Total rules applied 426 place count 722 transition count 1844
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 427 place count 721 transition count 1842
Iterating global reduction 2 with 1 rules applied. Total rules applied 428 place count 721 transition count 1842
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 429 place count 720 transition count 1840
Iterating global reduction 2 with 1 rules applied. Total rules applied 430 place count 720 transition count 1840
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 431 place count 719 transition count 1838
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 719 transition count 1838
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 433 place count 718 transition count 1836
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 718 transition count 1836
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 435 place count 717 transition count 1834
Iterating global reduction 2 with 1 rules applied. Total rules applied 436 place count 717 transition count 1834
Applied a total of 436 rules in 552 ms. Remains 717 /921 variables (removed 204) and now considering 1834/2320 (removed 486) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 553 ms. Remains : 717/921 places, 1834/2320 transitions.
RANDOM walk for 40001 steps (8 resets) in 176 ms. (225 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 227241 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 3
Probabilistic random walk after 227241 steps, saw 147509 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-31 21:44:03] [INFO ] Flow matrix only has 1236 transitions (discarded 598 similar events)
// Phase 1: matrix 1236 rows 717 cols
[2024-05-31 21:44:03] [INFO ] Computed 2 invariants in 7 ms
[2024-05-31 21:44:03] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 380/403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 954/1357 variables, 403/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 222/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1357 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 503/1860 variables, 224/850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1860 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1860 variables, 81/932 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1860 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 93/1953 variables, 90/1022 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1953 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1953 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1953/1953 variables, and 1022 constraints, problems are : Problem set: 0 solved, 3 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 717/717 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 380/403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 954/1357 variables, 403/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 222/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1357 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 503/1860 variables, 224/850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1860 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1860 variables, 81/932 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1860 variables, 3/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 21:44:05] [INFO ] Deduced a trap composed of 131 places in 180 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1860 variables, 1/936 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1860 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 93/1953 variables, 90/1026 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1953 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1953 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1953/1953 variables, and 1026 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2130 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 717/717 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3011ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1111 ms.
Support contains 23 out of 717 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 717/717 places, 1834/1834 transitions.
Applied a total of 0 rules in 91 ms. Remains 717 /717 variables (removed 0) and now considering 1834/1834 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 717/717 places, 1834/1834 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 717/717 places, 1834/1834 transitions.
Applied a total of 0 rules in 96 ms. Remains 717 /717 variables (removed 0) and now considering 1834/1834 (removed 0) transitions.
[2024-05-31 21:44:07] [INFO ] Flow matrix only has 1236 transitions (discarded 598 similar events)
[2024-05-31 21:44:07] [INFO ] Invariant cache hit.
[2024-05-31 21:44:08] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-31 21:44:08] [INFO ] Flow matrix only has 1236 transitions (discarded 598 similar events)
[2024-05-31 21:44:08] [INFO ] Invariant cache hit.
[2024-05-31 21:44:08] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-31 21:44:10] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2180 ms to find 0 implicit places.
[2024-05-31 21:44:10] [INFO ] Redundant transitions in 86 ms returned []
Running 1832 sub problems to find dead transitions.
[2024-05-31 21:44:10] [INFO ] Flow matrix only has 1236 transitions (discarded 598 similar events)
[2024-05-31 21:44:10] [INFO ] Invariant cache hit.
[2024-05-31 21:44:10] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/717 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/717 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 29.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 717/1953 variables, and 2 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/717 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/717 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/717 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/717 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 3 (OVERLAPS) 1236/1953 variables, 717/719 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1953 variables, 303/1022 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1953/1953 variables, and 2854 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 32033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 717/717 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 0/0 constraints]
After SMT, in 71206ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 71227ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73616 ms. Remains : 717/717 places, 1834/1834 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1060 edges and 717 vertex of which 189 / 717 are part of one of the 63 SCC in 4 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 315 transitions
Ensure Unique test removed 472 transitions
Reduce isomorphic transitions removed 787 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 591 transition count 1029
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 573 transition count 1029
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 37 place count 573 transition count 928
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 239 place count 472 transition count 928
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 301 place count 410 transition count 866
Iterating global reduction 2 with 62 rules applied. Total rules applied 363 place count 410 transition count 866
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 487 place count 410 transition count 742
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 1 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 268 rules applied. Total rules applied 755 place count 276 transition count 608
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 816 place count 215 transition count 486
Iterating global reduction 3 with 61 rules applied. Total rules applied 877 place count 215 transition count 486
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 879 place count 215 transition count 484
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 939 place count 155 transition count 364
Iterating global reduction 4 with 60 rules applied. Total rules applied 999 place count 155 transition count 364
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 1059 place count 95 transition count 244
Iterating global reduction 4 with 60 rules applied. Total rules applied 1119 place count 95 transition count 244
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 1177 place count 95 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1179 place count 94 transition count 185
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 1197 place count 85 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 1208 place count 85 transition count 182
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1209 place count 85 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1210 place count 84 transition count 181
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1211 place count 84 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1212 place count 84 transition count 180
Applied a total of 1212 rules in 106 ms. Remains 84 /717 variables (removed 633) and now considering 180/1834 (removed 1654) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 180 rows 84 cols
[2024-05-31 21:45:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:45:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 21:45:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-31 21:45:21] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 21:45:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 21:45:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:45:21] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-31 21:45:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:45:21] [INFO ] After 50ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-31 21:45:21] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-31 21:45:22] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 532 ms.
[2024-05-31 21:45:22] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-31 21:45:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 717 places, 1834 transitions and 7462 arcs took 11 ms.
[2024-05-31 21:45:22] [INFO ] Flatten gal took : 149 ms
Total runtime 128975 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="FunctionPointer-PT-c008"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-c008, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640603100295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;