Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640603100282.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 itstools
Input is FunctionPointer-PT-c004, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603100282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K 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 98K 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-c004-CTLFireability-2024-00
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-01
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-02
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-03
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-04
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-05
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-06
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-07
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-08
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-09
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-10
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-11
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2023-12
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2023-13
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2023-14
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716477930069

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-23 15:25:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 15:25:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 15:25:31] [INFO ] Load time of PNML (sax parser for PT used): 405 ms
[2024-05-23 15:25:31] [INFO ] Transformed 2826 places.
[2024-05-23 15:25:31] [INFO ] Transformed 8960 transitions.
[2024-05-23 15:25:31] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 571 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Deduced a syphon composed of 1198 places in 42 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 277 places :
Symmetric choice reduction at 1 with 277 rule applications. Total rules 294 place count 1334 transition count 3928
Iterating global reduction 1 with 277 rules applied. Total rules applied 571 place count 1334 transition count 3928
Ensure Unique test removed 474 transitions
Reduce isomorphic transitions removed 474 transitions.
Iterating post reduction 1 with 474 rules applied. Total rules applied 1045 place count 1334 transition count 3454
Discarding 136 places :
Symmetric choice reduction at 2 with 136 rule applications. Total rules 1181 place count 1198 transition count 3182
Iterating global reduction 2 with 136 rules applied. Total rules applied 1317 place count 1198 transition count 3182
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 1433 place count 1198 transition count 3066
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1447 place count 1184 transition count 3038
Iterating global reduction 3 with 14 rules applied. Total rules applied 1461 place count 1184 transition count 3038
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1475 place count 1170 transition count 3010
Iterating global reduction 3 with 14 rules applied. Total rules applied 1489 place count 1170 transition count 3010
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1503 place count 1156 transition count 2982
Iterating global reduction 3 with 14 rules applied. Total rules applied 1517 place count 1156 transition count 2982
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1531 place count 1142 transition count 2954
Iterating global reduction 3 with 14 rules applied. Total rules applied 1545 place count 1142 transition count 2954
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1559 place count 1128 transition count 2926
Iterating global reduction 3 with 14 rules applied. Total rules applied 1573 place count 1128 transition count 2926
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1584 place count 1117 transition count 2904
Iterating global reduction 3 with 11 rules applied. Total rules applied 1595 place count 1117 transition count 2904
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1603 place count 1109 transition count 2888
Iterating global reduction 3 with 8 rules applied. Total rules applied 1611 place count 1109 transition count 2888
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1637 place count 1083 transition count 2792
Iterating global reduction 3 with 26 rules applied. Total rules applied 1663 place count 1083 transition count 2792
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1696 place count 1050 transition count 2660
Iterating global reduction 3 with 33 rules applied. Total rules applied 1729 place count 1050 transition count 2660
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1759 place count 1020 transition count 2578
Iterating global reduction 3 with 30 rules applied. Total rules applied 1789 place count 1020 transition count 2578
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1819 place count 990 transition count 2518
Iterating global reduction 3 with 30 rules applied. Total rules applied 1849 place count 990 transition count 2518
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1878 place count 961 transition count 2460
Iterating global reduction 3 with 29 rules applied. Total rules applied 1907 place count 961 transition count 2460
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1936 place count 932 transition count 2402
Iterating global reduction 3 with 29 rules applied. Total rules applied 1965 place count 932 transition count 2402
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1991 place count 906 transition count 2350
Iterating global reduction 3 with 26 rules applied. Total rules applied 2017 place count 906 transition count 2350
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2028 place count 895 transition count 2328
Iterating global reduction 3 with 11 rules applied. Total rules applied 2039 place count 895 transition count 2328
Applied a total of 2039 rules in 1219 ms. Remains 895 /1628 variables (removed 733) and now considering 2328/5962 (removed 3634) transitions.
[2024-05-23 15:25:33] [INFO ] Flow matrix only has 1570 transitions (discarded 758 similar events)
// Phase 1: matrix 1570 rows 895 cols
[2024-05-23 15:25:33] [INFO ] Computed 2 invariants in 45 ms
[2024-05-23 15:25:34] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-23 15:25:34] [INFO ] Flow matrix only has 1570 transitions (discarded 758 similar events)
[2024-05-23 15:25:34] [INFO ] Invariant cache hit.
[2024-05-23 15:25:34] [INFO ] State equation strengthened by 369 read => feed constraints.
[2024-05-23 15:25:36] [INFO ] Implicit Places using invariants and state equation in 2625 ms returned []
Implicit Place search using SMT with State Equation took 3431 ms to find 0 implicit places.
Running 2326 sub problems to find dead transitions.
[2024-05-23 15:25:36] [INFO ] Flow matrix only has 1570 transitions (discarded 758 similar events)
[2024-05-23 15:25:36] [INFO ] Invariant cache hit.
[2024-05-23 15:25:36] [INFO ] State equation strengthened by 369 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/895 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2326 unsolved
SMT process timed out in 42800ms, After SMT, problems are : Problem set: 0 solved, 2326 unsolved
Search for dead transitions found 0 dead transitions in 42848ms
Starting structural reductions in LTL mode, iteration 1 : 895/1628 places, 2328/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47535 ms. Remains : 895/1628 places, 2328/5962 transitions.
Support contains 65 out of 895 places after structural reductions.
[2024-05-23 15:26:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-23 15:26:20] [INFO ] Flatten gal took : 194 ms
[2024-05-23 15:26:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FunctionPointer-PT-c004-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 15:26:20] [INFO ] Flatten gal took : 150 ms
[2024-05-23 15:26:20] [INFO ] Input system was already deterministic with 2328 transitions.
Support contains 50 out of 895 places (down from 65) after GAL structural reductions.
RANDOM walk for 40001 steps (8 resets) in 3031 ms. (13 steps per ms) remains 30/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 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 10 ms. (363 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 12 ms. (308 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 12 ms. (308 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 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 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 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
[2024-05-23 15:26:21] [INFO ] Flow matrix only has 1570 transitions (discarded 758 similar events)
[2024-05-23 15:26:21] [INFO ] Invariant cache hit.
[2024-05-23 15:26:21] [INFO ] State equation strengthened by 369 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 377/412 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 70/482 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 5 (OVERLAPS) 1138/1620 variables, 482/484 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1620 variables, 305/789 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1620 variables, 0/789 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 635/2255 variables, 260/1049 constraints. Problems are: Problem set: 2 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2255 variables, 64/1113 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2255 variables, 0/1113 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 199/2454 variables, 144/1257 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2454 variables, 0/1257 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 11/2465 variables, 9/1266 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2465 variables, 0/1266 constraints. Problems are: Problem set: 2 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2465/2465 variables, and 1266 constraints, problems are : Problem set: 2 solved, 22 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 895/895 constraints, ReadFeed: 369/369 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 378/409 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 70/479 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 1134/1613 variables, 479/481 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1613 variables, 305/786 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1613 variables, 0/786 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 636/2249 variables, 260/1046 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2249 variables, 64/1110 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2249 variables, 22/1132 constraints. Problems are: Problem set: 2 solved, 22 unsolved
[2024-05-23 15:26:30] [INFO ] Deduced a trap composed of 139 places in 206 ms of which 25 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2249 variables, 1/1133 constraints. Problems are: Problem set: 2 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2249/2465 variables, and 1133 constraints, problems are : Problem set: 2 solved, 22 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 739/895 constraints, ReadFeed: 369/369 constraints, PredecessorRefiner: 22/24 constraints, Known Traps: 1/1 constraints]
After SMT, in 10300ms problems are : Problem set: 2 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 895/895 places, 2328/2328 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 876 transition count 2278
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 876 transition count 2278
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 52 place count 876 transition count 2264
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 68 place count 860 transition count 2230
Iterating global reduction 1 with 16 rules applied. Total rules applied 84 place count 860 transition count 2230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 860 transition count 2226
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 848 transition count 2188
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 848 transition count 2188
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 128 place count 832 transition count 2128
Iterating global reduction 2 with 16 rules applied. Total rules applied 144 place count 832 transition count 2128
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 162 place count 814 transition count 2072
Iterating global reduction 2 with 18 rules applied. Total rules applied 180 place count 814 transition count 2072
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 198 place count 796 transition count 2030
Iterating global reduction 2 with 18 rules applied. Total rules applied 216 place count 796 transition count 2030
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 234 place count 778 transition count 1994
Iterating global reduction 2 with 18 rules applied. Total rules applied 252 place count 778 transition count 1994
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 269 place count 761 transition count 1960
Iterating global reduction 2 with 17 rules applied. Total rules applied 286 place count 761 transition count 1960
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 303 place count 744 transition count 1926
Iterating global reduction 2 with 17 rules applied. Total rules applied 320 place count 744 transition count 1926
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 330 place count 734 transition count 1906
Iterating global reduction 2 with 10 rules applied. Total rules applied 340 place count 734 transition count 1906
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 343 place count 731 transition count 1900
Iterating global reduction 2 with 3 rules applied. Total rules applied 346 place count 731 transition count 1900
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 374 place count 731 transition count 1872
Applied a total of 374 rules in 659 ms. Remains 731 /895 variables (removed 164) and now considering 1872/2328 (removed 456) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 659 ms. Remains : 731/895 places, 1872/2328 transitions.
RANDOM walk for 40000 steps (8 resets) in 703 ms. (56 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 128110 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :1 out of 20
Probabilistic random walk after 128110 steps, saw 83632 distinct states, run finished after 3006 ms. (steps per millisecond=42 ) properties seen :1
[2024-05-23 15:26:36] [INFO ] Flow matrix only has 1267 transitions (discarded 605 similar events)
// Phase 1: matrix 1267 rows 731 cols
[2024-05-23 15:26:36] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 15:26:36] [INFO ] State equation strengthened by 312 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 379/406 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 978/1384 variables, 406/407 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1384 variables, 232/639 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1384 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 511/1895 variables, 233/872 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1895 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1895 variables, 80/953 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1895 variables, 0/953 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 103/1998 variables, 92/1045 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1998 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/1998 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1998/1998 variables, and 1045 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 731/731 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 379/406 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 978/1384 variables, 406/407 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1384 variables, 232/639 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1384 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 511/1895 variables, 233/872 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1895 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1895 variables, 80/953 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1895 variables, 19/972 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-23 15:26:41] [INFO ] Deduced a trap composed of 135 places in 154 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1895 variables, 1/973 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1895 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 103/1998 variables, 92/1065 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1998 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/1998 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1998/1998 variables, and 1065 constraints, problems are : Problem set: 0 solved, 19 unsolved in 9523 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 731/731 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
After SMT, in 12908ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 13 properties in 6420 ms.
Support contains 10 out of 731 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 1872/1872 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 719 transition count 1846
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 719 transition count 1846
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 719 transition count 1838
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 707 transition count 1812
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 707 transition count 1812
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 66 place count 697 transition count 1786
Iterating global reduction 1 with 10 rules applied. Total rules applied 76 place count 697 transition count 1786
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 84 place count 689 transition count 1768
Iterating global reduction 1 with 8 rules applied. Total rules applied 92 place count 689 transition count 1768
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 681 transition count 1752
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 681 transition count 1752
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 115 place count 674 transition count 1738
Iterating global reduction 1 with 7 rules applied. Total rules applied 122 place count 674 transition count 1738
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 127 place count 669 transition count 1728
Iterating global reduction 1 with 5 rules applied. Total rules applied 132 place count 669 transition count 1728
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 137 place count 664 transition count 1718
Iterating global reduction 1 with 5 rules applied. Total rules applied 142 place count 664 transition count 1718
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 146 place count 660 transition count 1710
Iterating global reduction 1 with 4 rules applied. Total rules applied 150 place count 660 transition count 1710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 151 place count 659 transition count 1708
Iterating global reduction 1 with 1 rules applied. Total rules applied 152 place count 659 transition count 1708
Applied a total of 152 rules in 272 ms. Remains 659 /731 variables (removed 72) and now considering 1708/1872 (removed 164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 659/731 places, 1708/1872 transitions.
RANDOM walk for 40001 steps (8 resets) in 311 ms. (128 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 161446 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 6
Probabilistic random walk after 161446 steps, saw 105265 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-23 15:26:59] [INFO ] Flow matrix only has 1143 transitions (discarded 565 similar events)
// Phase 1: matrix 1143 rows 659 cols
[2024-05-23 15:26:59] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 15:26:59] [INFO ] State equation strengthened by 280 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 383/393 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 808/1201 variables, 393/394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 71/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1201 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 510/1711 variables, 183/648 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1711 variables, 209/857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1711 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/1712 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1712 variables, 1/859 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1712 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 90/1802 variables, 82/941 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1802 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1802 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1802/1802 variables, and 941 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1455 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 659/659 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 383/393 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 808/1201 variables, 393/394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 71/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1201 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 510/1711 variables, 183/648 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1711 variables, 209/857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1711 variables, 6/863 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1711 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/1712 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1712 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1712 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 90/1802 variables, 82/947 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1802 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1802 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1802/1802 variables, and 947 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2908 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 659/659 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 4466ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1269 ms.
Support contains 10 out of 659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1708/1708 transitions.
Applied a total of 0 rules in 108 ms. Remains 659 /659 variables (removed 0) and now considering 1708/1708 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 659/659 places, 1708/1708 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1708/1708 transitions.
Applied a total of 0 rules in 92 ms. Remains 659 /659 variables (removed 0) and now considering 1708/1708 (removed 0) transitions.
[2024-05-23 15:27:05] [INFO ] Flow matrix only has 1143 transitions (discarded 565 similar events)
[2024-05-23 15:27:05] [INFO ] Invariant cache hit.
[2024-05-23 15:27:05] [INFO ] Implicit Places using invariants in 818 ms returned []
[2024-05-23 15:27:05] [INFO ] Flow matrix only has 1143 transitions (discarded 565 similar events)
[2024-05-23 15:27:05] [INFO ] Invariant cache hit.
[2024-05-23 15:27:06] [INFO ] State equation strengthened by 280 read => feed constraints.
[2024-05-23 15:27:07] [INFO ] Implicit Places using invariants and state equation in 1862 ms returned []
Implicit Place search using SMT with State Equation took 2689 ms to find 0 implicit places.
[2024-05-23 15:27:07] [INFO ] Redundant transitions in 89 ms returned []
Running 1706 sub problems to find dead transitions.
[2024-05-23 15:27:07] [INFO ] Flow matrix only has 1143 transitions (discarded 565 similar events)
[2024-05-23 15:27:07] [INFO ] Invariant cache hit.
[2024-05-23 15:27:07] [INFO ] State equation strengthened by 280 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/659 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/659 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 659/1802 variables, and 2 constraints, problems are : Problem set: 0 solved, 1706 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/659 constraints, ReadFeed: 0/280 constraints, PredecessorRefiner: 1706/1706 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/659 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/659 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/659 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 3 (OVERLAPS) 1143/1802 variables, 659/661 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1802 variables, 280/941 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1802/1802 variables, and 2647 constraints, problems are : Problem set: 0 solved, 1706 unsolved in 31623 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 659/659 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 1706/1706 constraints, Known Traps: 0/0 constraints]
After SMT, in 70524ms problems are : Problem set: 0 solved, 1706 unsolved
Search for dead transitions found 0 dead transitions in 70540ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73428 ms. Remains : 659/659 places, 1708/1708 transitions.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA FunctionPointer-PT-c004-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 15:28:18] [INFO ] Flatten gal took : 117 ms
[2024-05-23 15:28:18] [INFO ] Flatten gal took : 81 ms
[2024-05-23 15:28:18] [INFO ] Input system was already deterministic with 2328 transitions.
Support contains 39 out of 895 places (down from 40) after GAL structural reductions.
FORMULA FunctionPointer-PT-c004-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 192 stabilizing places and 512 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 895/895 places, 2328/2328 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 859 transition count 2232
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 859 transition count 2232
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 92 place count 859 transition count 2212
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 124 place count 827 transition count 2142
Iterating global reduction 1 with 32 rules applied. Total rules applied 156 place count 827 transition count 2142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 160 place count 827 transition count 2138
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 184 place count 803 transition count 2066
Iterating global reduction 2 with 24 rules applied. Total rules applied 208 place count 803 transition count 2066
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 240 place count 771 transition count 1954
Iterating global reduction 2 with 32 rules applied. Total rules applied 272 place count 771 transition count 1954
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 304 place count 739 transition count 1860
Iterating global reduction 2 with 32 rules applied. Total rules applied 336 place count 739 transition count 1860
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 366 place count 709 transition count 1798
Iterating global reduction 2 with 30 rules applied. Total rules applied 396 place count 709 transition count 1798
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 424 place count 681 transition count 1742
Iterating global reduction 2 with 28 rules applied. Total rules applied 452 place count 681 transition count 1742
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 479 place count 654 transition count 1688
Iterating global reduction 2 with 27 rules applied. Total rules applied 506 place count 654 transition count 1688
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 531 place count 629 transition count 1638
Iterating global reduction 2 with 25 rules applied. Total rules applied 556 place count 629 transition count 1638
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 571 place count 614 transition count 1608
Iterating global reduction 2 with 15 rules applied. Total rules applied 586 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 587 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 588 place count 613 transition count 1606
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 592 place count 613 transition count 1602
Applied a total of 592 rules in 711 ms. Remains 613 /895 variables (removed 282) and now considering 1602/2328 (removed 726) transitions.
[2024-05-23 15:28:19] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2024-05-23 15:28:19] [INFO ] Computed 2 invariants in 8 ms
[2024-05-23 15:28:20] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-05-23 15:28:20] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 15:28:20] [INFO ] Invariant cache hit.
[2024-05-23 15:28:20] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 15:28:21] [INFO ] Implicit Places using invariants and state equation in 1845 ms returned []
Implicit Place search using SMT with State Equation took 2417 ms to find 0 implicit places.
[2024-05-23 15:28:22] [INFO ] Redundant transitions in 84 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-23 15:28:22] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 15:28:22] [INFO ] Invariant cache hit.
[2024-05-23 15:28:22] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 3 (OVERLAPS) 1070/1683 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2480 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 31490 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
After SMT, in 69540ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 69554ms
Starting structural reductions in SI_CTL mode, iteration 1 : 613/895 places, 1602/2328 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72788 ms. Remains : 613/895 places, 1602/2328 transitions.
[2024-05-23 15:29:31] [INFO ] Flatten gal took : 36 ms
[2024-05-23 15:29:31] [INFO ] Flatten gal took : 51 ms
[2024-05-23 15:29:31] [INFO ] Input system was already deterministic with 1602 transitions.
RANDOM walk for 40000 steps (8 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
[2024-05-23 15:29:32] [INFO ] Flatten gal took : 122 ms
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
[2024-05-23 15:29:32] [INFO ] Flatten gal took : 91 ms
[2024-05-23 15:29:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality394044179928629439.gal : 61 ms
[2024-05-23 15:29:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4874542970617213539.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality394044179928629439.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4874542970617213539.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality4874542970617213539.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1824
Interrupted probabilistic random walk after 347841 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 347841 steps, saw 225781 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2024-05-23 15:29:35] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 15:29:35] [INFO ] Invariant cache hit.
[2024-05-23 15:29:35] [INFO ] State equation strengthened by 265 read => feed constraints.
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) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1824 after 635404
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1683 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 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) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 15:29:37] [INFO ] Deduced a trap composed of 131 places in 259 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1683 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2200 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3312ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 100 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 613/613 places, 1602/1602 transitions.
RANDOM walk for 400008 steps (8 resets) in 4508 ms. (88 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-23 15:29:39] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 15:29:39] [INFO ] Invariant cache hit.
[2024-05-23 15:29:40] [INFO ] [Real]Absence check using 1 positive place invariants in 34 ms returned sat
[2024-05-23 15:29:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 34 ms returned sat
[2024-05-23 15:29:41] [INFO ] After 854ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 15:29:41] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 15:29:41] [INFO ] After 119ms SMT Verify possible using 265 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 15:29:41] [INFO ] After 180ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 15:29:41] [INFO ] After 1422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 15:29:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 15:29:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :635404 after 3.95239e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.95239e+07 after 4.52129e+07
[2024-05-23 15:29:42] [INFO ] After 950ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 15:29:42] [INFO ] After 117ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 15:29:42] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 15:29:42] [INFO ] After 1365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000001 steps (8 resets) in 24108 ms. (165 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.52129e+07 after 1.02431e+08
BEST_FIRST walk for 4000004 steps (8 resets) in 3651 ms. (1095 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3220850 steps, run timeout after 21001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 3220850 steps, saw 2090289 distinct states, run finished after 21008 ms. (steps per millisecond=153 ) properties seen :0
[2024-05-23 15:30:11] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 15:30:11] [INFO ] Invariant cache hit.
[2024-05-23 15:30:11] [INFO ] State equation strengthened by 265 read => feed constraints.
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) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1683 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 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) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 15:30:13] [INFO ] Deduced a trap composed of 131 places in 296 ms of which 20 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1683 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1484 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2430ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 120 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 613/613 places, 1602/1602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 90 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
[2024-05-23 15:30:13] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 15:30:13] [INFO ] Invariant cache hit.
[2024-05-23 15:30:14] [INFO ] Implicit Places using invariants in 864 ms returned []
[2024-05-23 15:30:14] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 15:30:14] [INFO ] Invariant cache hit.
[2024-05-23 15:30:15] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 15:30:18] [INFO ] Implicit Places using invariants and state equation in 3573 ms returned []
Implicit Place search using SMT with State Equation took 4464 ms to find 0 implicit places.
[2024-05-23 15:30:18] [INFO ] Redundant transitions in 59 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-23 15:30:18] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 15:30:18] [INFO ] Invariant cache hit.
[2024-05-23 15:30:18] [INFO ] State equation strengthened by 265 read => feed constraints.

BK_STOP 1716478232853

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-c004"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FunctionPointer-PT-c004, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640603100282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;