fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r180-tall-171640603100287
Last Updated
July 7, 2024

About the Execution of ITS-Tools for FunctionPointer-PT-c004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16187.752 3600000.00 10770459.00 3607.60 TFTT?F?TFFFFT?F? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640603100287.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603100287
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-01
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-02
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2023-04
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-05
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-08
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2023-10
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-11
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-12
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2023-13
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-14
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716479046212

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
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
ReachabilityFireability PT
Running Version 202405141337
[2024-05-23 15:44:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 15:44:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 15:44:07] [INFO ] Load time of PNML (sax parser for PT used): 413 ms
[2024-05-23 15:44:07] [INFO ] Transformed 2826 places.
[2024-05-23 15:44:08] [INFO ] Transformed 8960 transitions.
[2024-05-23 15:44:08] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 586 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 42 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 4114 ms. (9 steps per ms) remains 10/12 properties
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 15:44:09] [INFO ] Flatten gal took : 736 ms
BEST_FIRST walk for 40004 steps (8 resets) in 972 ms. (41 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
[2024-05-23 15:44:09] [INFO ] Flatten gal took : 430 ms
BEST_FIRST walk for 40004 steps (8 resets) in 611 ms. (65 steps per ms) remains 9/10 properties
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 9/9 properties
[2024-05-23 15:44:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13539315450889636187.gal : 152 ms
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 8/9 properties
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
[2024-05-23 15:44:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1275411712682047204.prop : 1 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/ReachabilityCardinality13539315450889636187.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1275411712682047204.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 8/8 properties

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 ...329
[2024-05-23 15:44:10] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 15:44:10] [INFO ] Computed 4 invariants in 166 ms
[2024-05-23 15:44:10] [INFO ] State equation strengthened by 479 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality1275411712682047204.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem FunctionPointer-PT-c004-ReachabilityFireability-2024-09 is UNSAT
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 531/619 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/619 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/620 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1784/2404 variables, 620/624 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2404 variables, 402/1026 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2404 variables, 0/1026 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2189/4593 variables, 592/1618 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4593 variables, 77/1695 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4593 variables, 0/1695 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 554/5147 variables, 395/2090 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5147 variables, 0/2090 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 21/5168 variables, 21/2111 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3450 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 535/597 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/598 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1667/2265 variables, 598/602 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2265 variables, 402/1004 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2265 variables, 0/1004 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2121/4386 variables, 549/1553 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4386 variables, 77/1630 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4386 variables, 5/1635 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 31
At refinement iteration 11 (INCLUDED_ONLY) 0/4386 variables, 0/1635 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 644/5030 variables, 426/2061 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-23 15:44:18] [INFO ] Deduced a trap composed of 131 places in 584 ms of which 55 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/5030 variables, 1/2062 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5030/5168 variables, and 2062 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1573/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 9396ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.14 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 270 places :
Symmetric choice reduction at 0 with 270 rule applications. Total rules 271 place count 1341 transition count 4044
Iterating global reduction 0 with 270 rules applied. Total rules applied 541 place count 1341 transition count 4044
Ensure Unique test removed 552 transitions
Reduce isomorphic transitions removed 552 transitions.
Iterating post reduction 0 with 552 rules applied. Total rules applied 1093 place count 1341 transition count 3492
Discarding 128 places :
Symmetric choice reduction at 1 with 128 rule applications. Total rules 1221 place count 1213 transition count 3236
Iterating global reduction 1 with 128 rules applied. Total rules applied 1349 place count 1213 transition count 3236
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 1477 place count 1213 transition count 3108
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1491 place count 1199 transition count 3080
Iterating global reduction 2 with 14 rules applied. Total rules applied 1505 place count 1199 transition count 3080
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1518 place count 1186 transition count 3054
Iterating global reduction 2 with 13 rules applied. Total rules applied 1531 place count 1186 transition count 3054
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1544 place count 1173 transition count 3028
Iterating global reduction 2 with 13 rules applied. Total rules applied 1557 place count 1173 transition count 3028
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1570 place count 1160 transition count 3002
Iterating global reduction 2 with 13 rules applied. Total rules applied 1583 place count 1160 transition count 3002
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1596 place count 1147 transition count 2976
Iterating global reduction 2 with 13 rules applied. Total rules applied 1609 place count 1147 transition count 2976
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1619 place count 1137 transition count 2956
Iterating global reduction 2 with 10 rules applied. Total rules applied 1629 place count 1137 transition count 2956
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1636 place count 1130 transition count 2942
Iterating global reduction 2 with 7 rules applied. Total rules applied 1643 place count 1130 transition count 2942
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1664 place count 1109 transition count 2864
Iterating global reduction 2 with 21 rules applied. Total rules applied 1685 place count 1109 transition count 2864
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1706 place count 1088 transition count 2780
Iterating global reduction 2 with 21 rules applied. Total rules applied 1727 place count 1088 transition count 2780
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1748 place count 1067 transition count 2728
Iterating global reduction 2 with 21 rules applied. Total rules applied 1769 place count 1067 transition count 2728
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1790 place count 1046 transition count 2686
Iterating global reduction 2 with 21 rules applied. Total rules applied 1811 place count 1046 transition count 2686
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1830 place count 1027 transition count 2648
Iterating global reduction 2 with 19 rules applied. Total rules applied 1849 place count 1027 transition count 2648
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1868 place count 1008 transition count 2610
Iterating global reduction 2 with 19 rules applied. Total rules applied 1887 place count 1008 transition count 2610
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1903 place count 992 transition count 2578
Iterating global reduction 2 with 16 rules applied. Total rules applied 1919 place count 992 transition count 2578
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1922 place count 989 transition count 2572
Iterating global reduction 2 with 3 rules applied. Total rules applied 1925 place count 989 transition count 2572
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :31 after 1926
Drop transitions (Redundant composition of simpler transitions.) removed 86 transitions
Redundant transition composition rules discarded 86 transitions
Iterating global reduction 2 with 86 rules applied. Total rules applied 2011 place count 989 transition count 2486
Applied a total of 2011 rules in 1849 ms. Remains 989 /1628 variables (removed 639) and now considering 2486/5962 (removed 3476) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1868 ms. Remains : 989/1628 places, 2486/5962 transitions.
RANDOM walk for 40006 steps (8 resets) in 354 ms. (112 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 6/7 properties
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
[2024-05-23 15:44:22] [INFO ] Flow matrix only has 1693 transitions (discarded 793 similar events)
// Phase 1: matrix 1693 rows 989 cols
[2024-05-23 15:44:22] [INFO ] Computed 2 invariants in 22 ms
[2024-05-23 15:44:22] [INFO ] State equation strengthened by 403 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 381/404 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1150/1554 variables, 404/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1554 variables, 292/697 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1554 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 815/2369 variables, 382/1079 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2369 variables, 1/1080 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2369 variables, 111/1191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2369 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 281/2650 variables, 177/1368 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2650 variables, 0/1368 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 27/2677 variables, 23/1391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2677 variables, 0/1391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 5/2682 variables, 3/1394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2682 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2682 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2682/2682 variables, and 1394 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2004 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 989/989 constraints, ReadFeed: 403/403 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 381/404 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1150/1554 variables, 404/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1554 variables, 292/697 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1554 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 815/2369 variables, 382/1079 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2369 variables, 1/1080 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2369 variables, 111/1191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2369 variables, 6/1197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 15:44:25] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2369 variables, 1/1198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2369 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 281/2650 variables, 177/1375 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2650 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 27/2677 variables, 23/1398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2677 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 5/2682 variables, 3/1401 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2682 variables, 0/1401 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/2682 variables, 0/1401 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2682/2682 variables, and 1401 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6076 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 989/989 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 8222ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2023-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 8269 ms.
Support contains 6 out of 989 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 989/989 places, 2486/2486 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 952 transition count 2388
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 952 transition count 2388
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 92 place count 952 transition count 2370
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 128 place count 916 transition count 2298
Iterating global reduction 1 with 36 rules applied. Total rules applied 164 place count 916 transition count 2298
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 176 place count 916 transition count 2286
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 204 place count 888 transition count 2198
Iterating global reduction 2 with 28 rules applied. Total rules applied 232 place count 888 transition count 2198
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 267 place count 853 transition count 2104
Iterating global reduction 2 with 35 rules applied. Total rules applied 302 place count 853 transition count 2104
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 340 place count 815 transition count 2016
Iterating global reduction 2 with 38 rules applied. Total rules applied 378 place count 815 transition count 2016
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 416 place count 777 transition count 1940
Iterating global reduction 2 with 38 rules applied. Total rules applied 454 place count 777 transition count 1940
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 490 place count 741 transition count 1868
Iterating global reduction 2 with 36 rules applied. Total rules applied 526 place count 741 transition count 1868
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 561 place count 706 transition count 1796
Iterating global reduction 2 with 35 rules applied. Total rules applied 596 place count 706 transition count 1796
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 631 place count 671 transition count 1726
Iterating global reduction 2 with 35 rules applied. Total rules applied 666 place count 671 transition count 1726
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 685 place count 652 transition count 1688
Iterating global reduction 2 with 19 rules applied. Total rules applied 704 place count 652 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 711 place count 645 transition count 1674
Iterating global reduction 2 with 7 rules applied. Total rules applied 718 place count 645 transition count 1674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 719 place count 644 transition count 1672
Iterating global reduction 2 with 1 rules applied. Total rules applied 720 place count 644 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 721 place count 643 transition count 1670
Iterating global reduction 2 with 1 rules applied. Total rules applied 722 place count 643 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 723 place count 642 transition count 1668
Iterating global reduction 2 with 1 rules applied. Total rules applied 724 place count 642 transition count 1668
Applied a total of 724 rules in 378 ms. Remains 642 /989 variables (removed 347) and now considering 1668/2486 (removed 818) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 642/989 places, 1668/2486 transitions.
RANDOM walk for 40002 steps (8 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 240573 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 4
Probabilistic random walk after 240573 steps, saw 156803 distinct states, run finished after 3004 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-23 15:44:42] [INFO ] Flow matrix only has 1117 transitions (discarded 551 similar events)
// Phase 1: matrix 1117 rows 642 cols
[2024-05-23 15:44:42] [INFO ] Computed 2 invariants in 8 ms
[2024-05-23 15:44:42] [INFO ] State equation strengthened by 276 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 352/358 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1189/1547 variables, 492/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1547 variables, 276/774 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1547 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 62/1609 variables, 1/775 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1609 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1610 variables, 1/776 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1610 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1610 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 149/1759 variables, 143/920 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1759 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1759 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1759/1759 variables, and 920 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 642/642 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 352/358 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1189/1547 variables, 492/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1547 variables, 276/774 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1547 variables, 4/778 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1547 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1609 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1609 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1610 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1610 variables, 1/781 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1610 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 149/1759 variables, 143/924 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 15:44:44] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1759 variables, 1/925 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1759 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1759 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1759/1759 variables, and 925 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2382 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 642/642 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3605ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 957 ms.
Support contains 6 out of 642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 1668/1668 transitions.
Applied a total of 0 rules in 77 ms. Remains 642 /642 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 642/642 places, 1668/1668 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 1668/1668 transitions.
Applied a total of 0 rules in 75 ms. Remains 642 /642 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
[2024-05-23 15:44:46] [INFO ] Flow matrix only has 1117 transitions (discarded 551 similar events)
[2024-05-23 15:44:46] [INFO ] Invariant cache hit.
[2024-05-23 15:44:47] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-23 15:44:47] [INFO ] Flow matrix only has 1117 transitions (discarded 551 similar events)
[2024-05-23 15:44:47] [INFO ] Invariant cache hit.
[2024-05-23 15:44:47] [INFO ] State equation strengthened by 276 read => feed constraints.
[2024-05-23 15:44:48] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned []
Implicit Place search using SMT with State Equation took 2170 ms to find 0 implicit places.
[2024-05-23 15:44:49] [INFO ] Redundant transitions in 75 ms returned []
Running 1666 sub problems to find dead transitions.
[2024-05-23 15:44:49] [INFO ] Flow matrix only has 1117 transitions (discarded 551 similar events)
[2024-05-23 15:44:49] [INFO ] Invariant cache hit.
[2024-05-23 15:44:49] [INFO ] State equation strengthened by 276 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/1759 variables, and 2 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/642 constraints, ReadFeed: 0/276 constraints, PredecessorRefiner: 1666/1666 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 3 (OVERLAPS) 1117/1759 variables, 642/644 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1759 variables, 276/920 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1759/1759 variables, and 2586 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 31568 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 642/642 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 1666/1666 constraints, Known Traps: 0/0 constraints]
After SMT, in 69861ms problems are : Problem set: 0 solved, 1666 unsolved
Search for dead transitions found 0 dead transitions in 69880ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72215 ms. Remains : 642/642 places, 1668/1668 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 980 edges and 642 vertex of which 192 / 642 are part of one of the 64 SCC in 4 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 423 transitions
Reduce isomorphic transitions removed 743 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 514 transition count 916
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 505 transition count 916
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 19 place count 505 transition count 835
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 181 place count 424 transition count 835
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 244 place count 361 transition count 772
Iterating global reduction 2 with 63 rules applied. Total rules applied 307 place count 361 transition count 772
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 433 place count 361 transition count 646
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 697 place count 229 transition count 514
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 761 place count 165 transition count 386
Iterating global reduction 3 with 64 rules applied. Total rules applied 825 place count 165 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 826 place count 165 transition count 385
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 889 place count 102 transition count 259
Iterating global reduction 4 with 63 rules applied. Total rules applied 952 place count 102 transition count 259
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1015 place count 39 transition count 133
Iterating global reduction 4 with 63 rules applied. Total rules applied 1078 place count 39 transition count 133
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1141 place count 39 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1141 place count 39 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1143 place count 38 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1145 place count 37 transition count 68
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1151 place count 34 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1155 place count 34 transition count 64
Applied a total of 1155 rules in 80 ms. Remains 34 /642 variables (removed 608) and now considering 64/1668 (removed 1604) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 64 rows 34 cols
[2024-05-23 15:45:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 15:45:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 15:45:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 15:45:59] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 15:45:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 15:45:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 15:45:59] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 15:45:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 15:45:59] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-23 15:45:59] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-23 15:45:59] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-23 15:45:59] [INFO ] Flatten gal took : 3 ms
[2024-05-23 15:45:59] [INFO ] Flatten gal took : 3 ms
[2024-05-23 15:45:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15381279813547186738.gal : 1 ms
[2024-05-23 15:45:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7459498360117012197.prop : 1 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/ReachabilityCardinality15381279813547186738.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7459498360117012197.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 ...329
Loading property file /tmp/ReachabilityCardinality7459498360117012197.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 105
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :105 after 19290
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19290 after 1.68825e+06
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1.68825e+06 after 1.04809e+08
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1.04809e+08 after 6.58253e+09
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :6.58253e+09 after 3.99256e+11
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :3.99256e+11 after 2.48651e+13
Detected timeout of ITS tools.
[2024-05-23 15:46:14] [INFO ] Flatten gal took : 6 ms
[2024-05-23 15:46:14] [INFO ] Applying decomposition
[2024-05-23 15:46:14] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7379962191542439994.txt' '-o' '/tmp/graph7379962191542439994.bin' '-w' '/tmp/graph7379962191542439994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7379962191542439994.bin' '-l' '-1' '-v' '-w' '/tmp/graph7379962191542439994.weights' '-q' '0' '-e' '0.001'
[2024-05-23 15:46:14] [INFO ] Decomposing Gal with order
[2024-05-23 15:46:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 15:46:14] [INFO ] Removed a total of 82 redundant transitions.
[2024-05-23 15:46:14] [INFO ] Flatten gal took : 35 ms
[2024-05-23 15:46:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-05-23 15:46:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1090711130766283499.gal : 2 ms
[2024-05-23 15:46:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13100961880358882718.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/ReachabilityCardinality1090711130766283499.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13100961880358882718.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality13100961880358882718.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 30
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30512 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 15:46:29] [INFO ] Flatten gal took : 177 ms
[2024-05-23 15:46:29] [INFO ] Applying decomposition
[2024-05-23 15:46:29] [INFO ] Flatten gal took : 176 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11743383222200180622.txt' '-o' '/tmp/graph11743383222200180622.bin' '-w' '/tmp/graph11743383222200180622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11743383222200180622.bin' '-l' '-1' '-v' '-w' '/tmp/graph11743383222200180622.weights' '-q' '0' '-e' '0.001'
[2024-05-23 15:46:30] [INFO ] Decomposing Gal with order
[2024-05-23 15:46:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 15:46:31] [INFO ] Removed a total of 7407 redundant transitions.
[2024-05-23 15:46:32] [INFO ] Flatten gal took : 1221 ms
[2024-05-23 15:46:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 3767 labels/synchronizations in 362 ms.
[2024-05-23 15:46:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2112246471006310684.gal : 37 ms
[2024-05-23 15:46:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16836193721032644212.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/ReachabilityCardinality2112246471006310684.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16836193721032644212.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality16836193721032644212.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :11 after 25
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :25 after 52
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :52 after 116
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :116 after 251
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :251 after 554
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :554 after 1218
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1218 after 2470
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2470 after 5007
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :5007 after 138224
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :138224 after 262863
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :262863 after 498856
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :498856 after 952038
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :952038 after 1.39412e+07
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :1.39412e+07 after 5.61512e+07
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :5.61512e+07 after 1.84364e+08
ITS-tools command line returned an error code 137
[2024-05-23 16:05:23] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11542772140308330902
[2024-05-23 16:05:23] [INFO ] Too many transitions (1668) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:05:23] [INFO ] Applying decomposition
[2024-05-23 16:05:23] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11542772140308330902
Running compilation step : cd /tmp/ltsmin11542772140308330902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 16:05:23] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9641433570692847668.txt' '-o' '/tmp/graph9641433570692847668.bin' '-w' '/tmp/graph9641433570692847668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9641433570692847668.bin' '-l' '-1' '-v' '-w' '/tmp/graph9641433570692847668.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:05:23] [INFO ] Decomposing Gal with order
[2024-05-23 16:05:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:05:24] [INFO ] Removed a total of 2770 redundant transitions.
[2024-05-23 16:05:24] [INFO ] Flatten gal took : 74 ms
[2024-05-23 16:05:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1240 labels/synchronizations in 33 ms.
[2024-05-23 16:05:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1696486812453301623.gal : 10 ms
[2024-05-23 16:05:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3744030633005077692.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/ReachabilityFireability1696486812453301623.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3744030633005077692.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityFireability3744030633005077692.prop.
Compilation finished in 3810 ms.
Running link step : cd /tmp/ltsmin11542772140308330902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin11542772140308330902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTc004ReachabilityFireability202304==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin11542772140308330902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTc004ReachabilityFireability202304==true'
Running LTSmin : cd /tmp/ltsmin11542772140308330902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTc004ReachabilityFireability202406==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin11542772140308330902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTc004ReachabilityFireability202406==true'
Running LTSmin : cd /tmp/ltsmin11542772140308330902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTc004ReachabilityFireability202313==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin11542772140308330902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTc004ReachabilityFireability202313==true'
Running LTSmin : cd /tmp/ltsmin11542772140308330902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTc004ReachabilityFireability202315==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin11542772140308330902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTc004ReachabilityFireability202315==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin11542772140308330902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTc004ReachabilityFireability202304==true'
Detected timeout of ITS tools.
[2024-05-23 16:32:29] [INFO ] Applying decomposition
[2024-05-23 16:32:29] [INFO ] Flatten gal took : 126 ms
[2024-05-23 16:32:29] [INFO ] Decomposing Gal with order
[2024-05-23 16:32:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:32:29] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to l128 in partition [l0, l64, l512, l896],[s1, s3, s5],[l1029, l1285],[l1054, p1319],[s0, s2, s4, l704],[l1086, l1342],[l1087, l1215, l1216, p1289],[p1059, l1306],[p2019, l2074],[p1479, l2046],[l1541, l1605],[l2014, l2078],[l1664, l2375, l2439],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1234)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 16:32:29] [INFO ] Flatten gal took : 128 ms
[2024-05-23 16:32:29] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13015208987638984245.gal : 16 ms
[2024-05-23 16:32:29] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5514593136455328169.prop : 1 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/ReachabilityFireability13015208987638984245.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5514593136455328169.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 ...329
Loading property file /tmp/ReachabilityFireability5514593136455328169.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :31 after 1834
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1834 after 651084
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :651084 after 4.42085e+07
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :4.42085e+07 after 5.04047e+07
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :5.04047e+07 after 1.12504e+08
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.12504e+08 after 2.20979e+08
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2.20979e+08 after 2.28785e+08
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.28785e+08 after 2.30561e+08

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="ReachabilityFireability"
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 ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640603100287"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;